| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 423166 | Electronic Notes in Theoretical Computer Science | 2009 | 19 Pages |
Abstract
In this paper, we present several timed extensions of temporal logics, that can be used for model-checking real-time systems. We give different formalisms and the corresponding decidability/complexity results. We also give intuition to explain these results.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
