Bisimulation minimization and symbolic model checking

Formal Methods in System Design

Volumn 21, Issue 1, 2002, Pages 39-78

  Fisler, Kathi ^a   Vardi, Moshe Y ^b  

^a Worcester Polytechnic Institute   (United States)

^b Rice University   (United States)

Author keywords

Bisimulation minimization; Invariant properties; On the fly model checking; Symbolic model checking

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; INVARIANCE; MATHEMATICAL MODELS; OPTIMIZATION; STATE SPACE METHODS;

BISIMULATION MINIMIZATION; SYMBOLIC MODEL CHECKING;

SYSTEMS ANALYSIS;

EID: 0036645926     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1016091902809     Document Type: Article

References (39)

1. An implementation of three algorithms for timing verification based on automata emptiness
2. Minimizing interacting finite state machines: A compositional approach to language containment
3. Methodology and system for practical formal verification of reactive hardware
4. Symbolic bisimulation for timed processes
5. Minimal model generation
6. XEVE, an ESTEREL verification environment
7. Symbolic bisimulation minimization
8. The FC2TOOLS set
9. The steam boiler controller problem in ESTEREL and its verification by means of symbolic analysis
10. Exploiting symmetry in temporal logic model checking
11. Model-checking and abstraction
12. Word level model checking - Avoiding the pentium FDIV error
13. Computer aided verification
14. The concurrency factory - Practical tools for specification, simulation, verification, and implementation of concurrent systems
15. The concurrency workbench: A semantics-based tool for the verification of concurrent systems
16. The NCSU concurrency workbench
17. TTP: A case study in combining induction and data independence
18. Abstract interpretation and partition refinement for model checking
19. Generation of reduced models for checking fragments of CTL
20. The formal design of 1M-gate ASICs
21. Aldébaran: A tool for verification of communicating processes
22. "On the fly" verification of behavioral equivalences and preorders
23. Bisimulation minimization in an automata-theoretic verification framework
24. Model checking and modular verification
25. Symbolic bisimulations
26. Algebraic laws for nondeterminism and concurrency
27. From pre-historic to post-modern symbolic model checking
28. An n log n algorithm for minimizing states in a finite automation
29. CCS expressions, finite state processes, and three problems of equivalence
30. On the complexity of branching modular model checking
31. Model checking of safety properties
32. Online minimization of transition systems
33. Three partition refinement algorithms
34. Property-dependent reduction of finite state machines for modular model checking: Application to VHDL with computational results
35. VIS: A system for verification and synthesis