An efficient algorithm for minimizing real-time transition systems
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 210-224
- https://doi.org/10.1007/3-540-56922-7_18
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Decidability of bisimulation equivalences for parallel timer processesPublished by Springer Nature ,1993
- Minimum and maximum delay problems in real-time systemsFormal Methods in System Design, 1992
- Minimal state graph generationScience of Computer Programming, 1992
- Online minimization of transition systems (extended abstract)Published by Association for Computing Machinery (ACM) ,1992
- CCS expressions, finite state processes, and three problems of equivalenceInformation and Computation, 1990
- Timing assumptions and verification of finite-state concurrent systemsPublished by Springer Nature ,1990
- Efficient tests for top-down termination of logical rulesJournal of the ACM, 1988
- An improved protocol reachability analysis techniqueSoftware: Practice and Experience, 1988
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986