An implementation of three algorithms for timing verification based on automata emptiness
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Minimization of timed transition systemsPublished by Springer Nature ,2006
- Concurrency and automata on infinite sequencesPublished by Springer Nature ,2005
- Model-checking for real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Minimal state graph generationScience of Computer Programming, 1992
- Analysis of discrete event coordinationLecture Notes in Computer Science, 1990
- The complementation problem for Büchi automata with applications to temporal logicTheoretical Computer Science, 1987
- A fast mutual exclusion algorithmACM Transactions on Computer Systems, 1987
- Specification and verification of concurrent programs by A ∀ automataPublished by Association for Computing Machinery (ACM) ,1987
- Hierarchical correctness proofs for distributed algorithmsPublished by Association for Computing Machinery (ACM) ,1987
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972