Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
- 1 January 1996
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Protocol pruningProceedings of the IEEE, 1995
- On the complexity of omega -automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Modalities for model checking: branching time logic strikes backScience of Computer Programming, 1987
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972