Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL

Catalin Dima

doi:10.1109/TIME.2009.21

Conference papers

Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL

Catalin Dima ¹

1 LACL - Laboratoire d'Algorithmique Complexité et Logique

Abstract : no abstract

Document type :

Conference papers

Domain :

Computer Science [cs]

Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01699954
Contributor : Catalin Dima <>
Submitted on : Friday, February 2, 2018 - 10:52:33 PM
Last modification on : Friday, October 4, 2019 - 1:12:47 AM

Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL

Identifiers

Collections

Citation

Export

Metrics

70

Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL

Identifiers

Collections

Citation

Export

Share

Metrics

70