Theoretical Computer Science
Checking Linear Duration Invariants by Linear Programming
ASIAN '96 Proceedings of the Second Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Some Extensions to Propositional Mean-Value Caculus: Expressiveness and Decidability
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Semantics and Completeness of Duration Calculus
Proceedings of the Real-Time: Theory in Practice, REX Workshop
A Kleene theorem for timed automata
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
On Checking Parallel Real-Time Systems for Linear Duration Invariants
PDSE '98 Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems
Deriving Real-Time Programs from Duration Calculus Specifications
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
A Complete Fragment of Higher-Order Duration µ-Calculus
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
Duration Calculus with Iteration (DC*) has been used as an interface between original Duration Calculus and Timed Automata, but has not been studied rigorously. In this paper, we study a subset of DC* formulas consisting of so-called simple ones which corresponds precisely with the class of Timed Automata. We give a complete proof system and the decidability results for the subset.