A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Theoretical Computer Science
A mean value calculus of durations
A classical mind
Specifying and Verifying Requirements of Real-Time Systems
IEEE Transactions on Software Engineering
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
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Decidability and Undecidability Results for Duration Calculus
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Liveness and Fairness in Duration Calculus
CONCUR '94 Proceedings of the Concurrency Theory
Duration Calculi: An Overview (Invited Paper)
Proceedings of the International Conference on Formal Methods in Programming and Their Applications
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
Towards a Duration Calculus Proof Assistant in PVS
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
Mona: Decidable Arithmetic in Practice
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Weak Chop Inverses and Liveness in Mean-Value Calculus
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Bounded Model Construction for Monadic Second-Order Logics
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
From Duration Calculus To Linear Hybrid Automata
Proceedings of the 7th International Conference on Computer Aided Verification
Model-checking dense-time Duration Calculus
Formal Aspects of Computing
Decidability of a Hybrid Duration Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
On sampling abstraction of continuous time logic with durations
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A theory of duration calculus with application
Domain modeling and the duration calculus
Model-checking of specifications integrating processes, data and time
FM'05 Proceedings of the 2005 international conference on Formal Methods
Bounded validity checking of interval duration logic
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
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 |
Following the recent successes of bounded model-checking, we reconsider the problem of constructing models of discrete-time Duration Calculus formulae. While this problem is known to be nonelementary when arbitrary length models are considered [Han94], it turns out to be only NP-complete when constrained to bounded length.As a corollary we obtain that model construction is in NP for the formulae actually encountered in case studies using Duration Calculus, as these have a certain small-model property.First experiments with a prototype implementation of the procedures demonstrate a competitive performance.