Bounded reachability checking with process semantics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2154, Issue , 2001, Pages 218-232

  Heljanko, Keijo ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS; SEMANTICS;

ASYNCHRONOUS SYSTEM; BOOLEAN CIRCUIT; BOUNDED MODEL CHECKING; BOUNDED REACHABILITY PROBLEM; INTERLEAVING SEMANTICS; PROCESS SEMANTICS; REACTIVE SYSTEM; VERIFICATION METHOD;

MODEL CHECKING;

EID: 84944063124     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_15     Document Type: Conference Paper

References (16)

1. E. Best and R. Devillers. Sequential and concurrent behaviour in Petri net theory. Theoretical Computer Science, 55(1):87–136, 1987.
2. E. Best and C. Fernández. Nonsequential Processes: A Petri Net View, volume 13 of EATCS monographs on Theoretical Computer Science. Springer-Verlag, 1988.
3. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS’99), pages 193–207. Springer, 1999. LNCS 1579.
4. J. C. Corbett. Evaluating deadlock detection methods for concurrent software. Technical report, Department of Information and Computer Science, University of Hawaii at Manoa, 1995.
5. V. Diekert and Y. Métivier. Partial commutation and traces. In Handbook of formal languages, Vol. 3, pages 457–534. Springer, Berlin, 1997.
6. J. Esparza. Decidability and complexity of Petri net problems – An introduction. In Lectures on Petri Nets I: Basic Models, pages 374–428. Springer-Verlag, 1998. LNCS 1491.
7. J. Esparza, S. Römer, and W. Vogler. An improvement of McMillan’s unfolding algorithm. In Proceedings of 2nd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’96), pages 87–106, 1996. LNCS 1055.
8. J. Esparza, S. Römer, and W. Vogler. An improvement of McMillan’s unfolding algorithm, 2001. Accepted for publication in Formal Methods for System Design.
9. K. Heljanko and I. Niemelä. Answer set programming and bounded model checking. In Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, pages 90–96, Stanford, USA, March 2001. AAAI Press, Technical Report SS-01-01.
10. T. A. Junttila and I. Niemelä. Towards an efficient tableau method for Boolean circuit satisfiability checking. In Computational Logic – CL 2000; First International Conference, pages 553–567, London, UK, 2000. LNCS 1861.
11. H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic and stochastic search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, pages 1194–1201. AAAI Press/MIT Press, 1996.
12. H. C. M. Kleijn and M. Koutny. Process semantics of P/T-nets with inhibitor arcs. In Proceedings of the 21st International Conference on Application and Theory of Petri Nets, pages 261–281, 2000. LNCS 1825.
13. S. Melzer and S. Römer. Deadlock checking using net unfoldings. In Proceedings of 9th International Conference on Computer-Aided Verification (CAV’97), pages 352–363, 1997. LNCS 1254.
14. S. Merkel. Verification of fault tolerant algorithms using PEP. Technical Report TUM-19734, SFB-Bericht Nr. 342/23/97 A, Technische Universität München, München, Germany, 1997.
15. I. Niemelä. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241–273, 1999.
16. S. Römer. Theorie und Praxis der Netzentfaltungen als Basis für die Verifikation nebenläufiger Systeme. PhD thesis, Technische Universität München, Fakultät für Informatik, München, Germany, 2000.