Completeness and Decidability of a Fragment of Duration Calculus with Iteration
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Sharpening the Undecidability of Interval Temporal Logic
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
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
On the completeness and decidability of duration calculus with iteration
Theoretical Computer Science
Sharpening the Incompleteness of the Duration Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A theory of duration calculus with application
Domain modeling and the duration calculus
Reasoning about QoS Contracts in the Probabilistic Duration Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Succinctness Gap between Monadic Logic and Duration Calculus
Fundamenta Informaticae
| Hi-index | 0.01 |