Executing temporal logic programs
Executing temporal logic programs
Handbook of logic in computer science (vol. 2): background: computational structures
Handbook of logic in computer science (vol. 2): background: computational structures
Theoretical Computer Science
A mean value calculus of durations
A classical mind
Hierarchical design of a chemical concentration control system
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
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
Checking Hybrid Automata for Linear Duration Invariants
ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
Decidability and Undecidability Results for Duration Calculus
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
A Formal Proof of the Deadline Driven Scheduler
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
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
Duration Calculus of Weakly Monotonic Time
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
On the Design of Hybrid Control Systems Using Automata Models
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
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
Formal Design of Hybrid Systems
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
Complete Proof Systems for First Order Interval Temporal Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Kleene theorem for timed automata
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Modeling and Verification of Biphase Mark Protocolsin Duration Calculus Using PVS
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
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
Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris)
A Complete Proof System for First-order Interval Temporal Logic with Projection
Journal of Logic and Computation
A theory of duration calculus with application
Domain modeling and the duration calculus
Specifying various time models with temporal propositional variables in duration calculus
Formal methods and hybrid real-time systems
Reasoning about QoS Contracts in the Probabilistic Duration Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
An assume/guarantee based compositional calculus for hybrid CSP
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
Hi-index | 5.23 |
The extension of the duration calculus (DC) by iteration, which is also known as Kleene star, enables the straightforward specification of repetitive behaviour in DC and facilitates the translation of design descriptions between DC, timed regular expressions and timed automata. In this paper we present axioms and a proof rule about iteration in DC. We consider abstract-time DC and its extension by a state-variable binding existential quantifier known as higher-order DC (HDC). We show that the ω-complete proof systems for DC and HDC known from our earlier work can be extended by our axioms and rule in various ways in order to axiomatise iteration completely. The additions we propose include either the proof rule or an induction axiom. We also present results on the decidability of a subset of the extension DC* of DC by iteration.