Towards Bounded Model Checking for the Universal Fragment of TCTL
- 4 October 2002
- book chapter
- Published by Springer Nature
- p. 265-288
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- An implementation of three algorithms for timing verification based on automata emptiness2003
- On-the-fly symbolic model checking for real-time systems2002
- Bounded Model Checking Using Satisfiability SolvingFormal Methods in System Design, 2001
- Symbolic Model Checking without BDDs1999
- Partial order reductions for timed systems1998
- Data-structures for the verification of timed automata1997
- The benefits of relaxing punctualityJournal of the ACM, 1996
- A theory of timed automataTheoretical Computer Science, 1994
- Model-Checking in Dense Real-TimeInformation and Computation, 1993
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986