Minimal state graph generation

Science of Computer Programming

Volumn 18, Issue 3, 1992, Pages 247-269

  Bouajjani, A ^a   Fernandez, J C ^a   Halbwachs, N ^a   Raymond, P ^a   Ratel, C ^b  

^a IMAG/LGI ^*  (France)

^b Merlin Gerin/SES ^*  (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0005659208     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6423(92)90018-7     Document Type: Article

References (15)

1. The synchronous programming language Esterel, design, semantics, implementation
2. Original concepts of PRIAM, an industrial tool for efficient formal verification of combinational circuits
3. Minimal model generation
4. Graph-based algorithms for boolean function manipulation
5. 20 states and beyond
6. Lustre: a declarative language for programming synchronous systems
7. Automatic verification of finite-state concurrent systems using temporal logic specifications
8. Verification of synchronous sequential machines based on symbolic execution
9. An implementation of an efficient algorithm for bisimulation equivalence
10. Generating efficient code from data-flow programs
11. CCS expressions, finite state processes and three problems of equivalence
12. A Calculus of Communicating Systems
13. Three partition refinement algorithms
14. Verification in Xesar of the sliding window protocol
15. A unified approach for studying the properties of transition systems