Model checking Object Petri nets in prolog

Proceedings of the Sixth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'04

Volumn , Issue , 2004, Pages 20-31

  Farwer, Berndt ^a   Leuschel, Michael ^b  

^a UNIVERSITY OF HAMBURG   (Germany)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Animation; Compilation; Model Checking; Object Petri Nets; Prolog

Indexed keywords

ALGORITHMS; ANIMATION; COMPUTER SOFTWARE; MATHEMATICAL MODELS; PETRI NETS; PROGRAM COMPILERS; SEMANTICS;

COMPILATION; MODEL CHECKING; OBJECT PETRI NETS (OPN); PLACE TRANSITION;

PROLOG (PROGRAMMING LANGUAGE);

EID: 11244251938     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1013963.1013970     Document Type: Conference Paper

References (28)

1. M. Butler. csp2B: A practical approach to combining CSP and B. Formal Aspects of Computing, 12:182-198, 2000.
2. E.M. Clarke and E.A. Emerson. Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic. In D. Kozen, editor, Proceedings of the Workshop on Logics of Programs, LNCS 131, pages 52-71, Yorktown Heights, New York, May 1981. Springer-Verlag.
3. B. Farwer. Comparing concepts of object Petri net formalisms. Fundamenta Informaticae, 47(3-4):247-258, 2001.
4. B. Farwer and M. Leuschel. Model checking object Petri nets in Prolog. Technical Report DSSE-TR-2003-4, Declarative Systems and Software Engineering Group, School of Electronics and Computer Science, University of Southampton, SO17 1BJ, UK, 2003.
5. B. Farwer and M. Leuschel. Model checking object Petri nets in Maude and Prolog. Technical Report FBI-HH-B-258/04, Fachbereich Informatik, Universität Hamburg, Germany, 2004.
6. B. Farwer and K. Misra. Modelling with hierarchical object Petri nets. Fundamenta Informaticae, 55(2):129-147, 2003.
7. A. Finkel. The minimal coverability graph for Petri nets. LNCS 674, pages 210-243, 1993.
8. H. F. Guo, C. R. Ramakrishnan, and I. V. Ramakrishnan. Justification based on program transformation. In M. Leuschel, editor, Logic-based Program Synthesis and Transformation (LOPSTR'2002), LNCS 2664, pages 158-159, Madrid, Spain, September 2002. Springer-Verlag.
9. P. Henderson. Modelling architectures for dynamic systems. In A. Mclver and C. Morgan, editors, Programming Methodology. Springer-Verlag, 2003.
10. K. Jensen. Coloured Petri nets and the invariant-method. Theoretical Computer Science, 14:317-336, 1981.
11. K. Jensen. Coloured Petri Nets. Volume 1: Basic Concepts. Springer-Verlag, 1992.
12. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
13. R. M. Karp and R. E. Miller. Parallel program schemata. Journal of Computer and System Sciences, 3:147-195, 1969.
14. C. A. Lakos. Object Petri nets - definition and relationship to coloured nets. Technical report, TR94-3, Computer Science Department, University of Tasmania, 1994.
15. M. Leuschel. Design and implementation of the high-level specification language CSP(LP) in Prolog. In I. V. Ramakrishnan, editor, Proceedings of PAUL'01, LNCS 1990, pages 14-28. Springer-Verlag, March 2001.
16. M. Leuschel and M. Butler. ProB: A model checker for B. In K. Araki, S. Gnesi, and D. Mandrioli, editors, FME 2003: Formal Methods, LNCS 2805, pages 855-874. Springer-Verlag, 2003.
17. M. Leuschel, J. Jørgensen, W. Vanhoof, and M. Bruynooghe. Offline specialisation in Prolog using a hand-written compiler generator. Theory and Practice of Logic Programming, 4(1):139-191, 2004.
18. M. Leuschel and H. Lehmann. Solving coverability problems of Petri nets by partial deduction. In M. Gabbrielli and F. Pfenning, editors, Proceedings of PPDP'2000, pages 268-279, Montreal, Canada, 2000. ACM Press.
19. M. Leuschel, B. Martens, and D. De Schreye. Controlling generalisation and polyvariance in partial deduction of normal logic programs. ACM Transactions on Programming Languages and Systems, 20(1):208-258, January 1998.
20. M. Leuschel and T. Massart. Infinite state model checking by abstract interpretation and program specialisation. In A. Bossi, editor, Logic-Based Program Synthesis and Transformation. Proceedings of LOPSTR'99, LNCS 1817, pages 63-82, Venice, Italy, 2000.
21. M. Leuschel and T. Massart. Logic programming and partial deduction for the verification of reactive systems: An experimental evaluation. In G. Norman, M. Kwiatkowska, and D. Guelev, editors, Proceedings of AVoCS 2002, Second Workshop on Automated Verification of Critical Systems, pages 143-149, 2002. Available as Technical Report CSR-02-6, University of Birmingham.
22. I. A. Lomazova. Nested Petri nets - a formalism for specification of multi-agent distributed systems. In H.-D. Burkhard, L. Czaja, H.-S. Nguyen, and P. Starke, editors, Concurrency Specification and Programming (CSP'99), Proceedings, pages 127-140. University of Warsaw, 1999.
23. C. A. Petri. Kommunikation mit Automaten. Technical report, Rhein.-Westfäl. Inst. für Instr. Mathematik an der Universität Bonn. Schrift Nr. 2, 1962.
24. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In O. Grumberg, editor, Proceedings of the International Conference on Computer-Aided Verification (CAV'97), LNCS 1254, pages 143-154. Springer-Verlag, 1997.
25. W. Reisig. Petri Nets - An Introduction. Springer Verlag, 1982.
26. K. Sagonas, T. Swift, and D. S. Warren. XSB as an efficient deductive database engine. In Proceedings of the ACM SIGMOD International Conference on the Management of Data, pages 442-453, Minneapolis, Minnesota, May 1994. ACM.
27. R. Valk. Petri nets as token objects. An introduction to elementary object nets. In J. Desel and M. Silva, editors, Applications and Theory of Petri Nets 1998. Proceedings, volume 1420, pages 1-25. Springer-Verlag, 1998.
28. R. Valk. Relating different semantics for object Petri nets. Technical report, FBI-HH-B-266/00, Fachbereich Informatik, Universität Hamburg, 2000.