Towards Bounded Model Checking for the Universal Fragment of TCTL
- 4 October 2002
- book chapter
- Published by Springer Nature
- p. 265-288
- https://doi.org/10.1007/3-540-45739-9_17
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Minimization of timed transition systemsPublished by Springer Nature ,2006
- An implementation of three algorithms for timing verification based on automata emptinessPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On-the-fly symbolic model checking for real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A theory of timed automataPublished by Elsevier ,2002
- Symbolic Model Checking without BDDsPublished by Springer Nature ,1999
- Partial order reductions for timed systemsPublished by Springer Nature ,1998
- Data-structures for the verification of timed automataPublished by Springer Nature ,1997
- The benefits of relaxing punctualityJournal of the ACM, 1996
- Model-Checking in Dense Real-TimeInformation and Computation, 1993
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986