Combining structural and symbolic methods for the verification of concurrent systems

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

Volumn 1998-March, Issue , 1998, Pages 2-7

  Cortadella, Jordi ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; MODEL CHECKING; PETRI NETS; SYSTEMS ANALYSIS;

CONCURRENT SYSTEMS; DEPTH FIRST SEARCH ALGORITHMS; EFFICIENT ENCODING; MODEL-CHECKING VERIFICATION; REACHABILITY SET; STRUCTURAL THEORIES; SYMBOLIC METHODS; SYMBOLIC REPRESENTATION;

FORMAL VERIFICATION;

EID: 0005454614     PISSN: 15504808     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSD.1998.657533     Document Type: Conference Paper

References (18)

1. A. Arnold. Finite transition systems: Semantics of communicating systems. Prentice Hall, 1994.
2. R. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comput- ing Surveys, 24(3): 293-318, September 1992.
3. G. Cabodi and P. Camurati. Symbolic FSM traversals based on the transition relation. IEEE Trans. on Computer-Aided Design, 16(5): 448-457, May 1997.
4. O. Coudert, C. Berthet, and J. C. Madre. Verifi- cation of sequential machines using boolean functional vectors. In L. Claesen, editor, Proc. IFIP Int. Workshop on Applied Formal Methods for Correct VLSI Design, pages 111-128, Leuven, Belgium, November 1989.
5. J. Desel, K.-P. Neuendorf, and M.-D. Radola. Proving nonreachability by modulo-invariants. Theoretical Computer Science, 153: 49-64, 1996.
6. J. Esparza and S. Melzer. Model checking LTL using constraint programming. In 18th Interna- tional Conference on Application and Theory of Petri Nets, pages 1-20, June 1997.
7. M. Hack. Analysis of production schemata by Petri nets. PhD thesis, MIT, 1972.
8. R. Kannan and A. Bachem. Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM J. Com- put., 8(4): 499-577, November 1979.
9. A. Kovalyov and J. Esparza. A polynomial algorithm to compute the concurrency relation of free-choice signal transition graphs. In Proc. of the International Workshop on Discrete Event Systems (WODES), pages 1-6, August 1996.
10. K. McAloon and C. Tretkoff. Optimization and Computational Logic. John Wiley & Sons, 1996.
11. K.L. McMillan. Symbolic Model Checking. Kluwer, 1993.
12. T. Murata. Petri Nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4): 541-580, April 1989.
13. E. Pastor and J. Cortadella. Efficient encoding schemes for symbolic analysis of Petri nets. In Proc. of the Conference on Design, Automation and Test in Europe (DATE), March 1998.
14. E. Pastor, O. Roig, J. Cortadella, and R. Badia. Petri net analysis using boolean manipulation. In 15th International Conference on Application and Theory of Petri Nets, pages 416-435, June 1994.
15. D. Peled. Combining partial order reductions with on-The-y model-checking. Formal Methods in System Design, 8: 39-64, 1996.
16. C. A. Petri. Kommunikation mit Automaten. PhD thesis, Bonn, Institut für Instrumentelle Mathematik, 1962. (technical report Schriften des IIM Nr. 3).
17. M. Silva. Las Redes de Petri: En la Automatica y la Informatica. AC, 1985. (in Spanish).
18. A. Valmari. Stubborn sets for reduced state space generation. In 10th International Conference on Application and Theory of Petri Nets, pages 1-22, June 1989.