An implementation of three algorithms for timing verification based on automata emptiness
Authors:
- R. AlurRAR. Alur
- C. CourcoubetisCCC. Courcoubetis
- D. DillDDD. Dill
- N. HalbwachsNHN. Halbwachs
- H. Wong-ToiHWH. Wong-Toi
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 157-166
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Automata for modeling real-time systems2005
- Concurrency and automata on infinite sequences2005
- Model-checking for real-time systems2002
- Minimal state graph generationScience of Computer Programming, 1992
- Analysis of discrete event coordinationLecture Notes in Computer Science, 1990
- A fast mutual exclusion algorithmACM Transactions on Computer Systems, 1987
- Specification and verification of concurrent programs by A ∀ automata1987
- Hierarchical correctness proofs for distributed algorithms1987
- The complementation problem for Büchi automata with applications to temporal logicTheoretical Computer Science, 1987
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972