Specifying and Verifying Requirements of Real-Time Systems
IEEE Transactions on Software Engineering
A Hardware Semantics Based on Temporal Intervals
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Decidability and Undecidability Results for Duration Calculus
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Duration Specifications for Shared Processors
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
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
Synthesizing Controllers from Duration Calculus
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Some Decidability Results for Duration Calculus under Synchronous Interpretation
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Model-checking dense-time Duration Calculus
Formal Aspects of Computing
Decidability of a Hybrid Duration Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Duration Calculus is a temporal logic introduced to specify real-time systems. It is a very expressive but undecidable logic. In this paper we turn our attention to a decidable fragment for which we develop a tableau-based decision method taking into account some semantic restrictions.