Solving coverability problems of Petri nets by partial deduction

Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn , Issue , 2000, Pages 268-279

  Leuschel, Michael ^a   Lehmann, Helko ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Abstract interpreration; Concurrency; Logic programming; Model checking; Partial evaluation; Petri nets; Program analysis and verification

Indexed keywords

ALGORITHMS; LOGIC PROGRAMMING; PROBLEM SOLVING; TREES (MATHEMATICS);

INFINITE STATE MODEL CHECKING;

PETRI NETS;

EID: 0034593073     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/351268.351298     Document Type: Conference Paper

References (39)

1. P. A. Abdulla, K. Čerāns, B. Jonsson, and Y.-K. Tsay. General decidability theorems for infinite-state systems. In Proceedings of LICS'96, pages 313-321, July 1996. IEEE Computer Society Press.
2. M. Alpuente, M. Falaschi, G. Vidal. Partial Evaluation of Functional Logic Programs. ACM Transactions on Programming Languages and Systems, 20(4):768-844, 1998.
3. B. Bérard and L. Fribourg. Reachabilty analysis of (timed) Petri nets using real arithmetic. In Proceedings of Concur'99, LNCS 1664, pages 178-193. Springer-Verlag, 1999.
4. W. Charatonik and A. Podelski. Set-based analysis of reactive infinite-state systems. In B. Steffen, editor, Proceedings of TACAS'99, LNCS 1384, pages 358-375. Springer-Verlag, March 1998.
5. D. De Schreye, R. Glück, J. Jørgensen, M. Leuschel, B. Martens, and M. H. Sørensen. Conjunctive partial deduction: Foundations, control, algorithms and experiments. The Journal of Logic Programming, 41(2 & 3):231-277, November 1999.
6. G. Delzanno and A. Podelski. Model checking in CLP. In R. Cleaveland, editor, Proceedings of TACAS'99, LNCS 1579, pages 223-239. Springer-Verlag, 1999.
7. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pages 243-320. Elsevier, MIT Press, 1990.
8. C. Dufourd, A. Finkel, and P. Schnoebelen. Reset nets between decidability and undecidability. In Proceedings of ICALP'98, LNCS 1443, pages 103-115. Springer-Verlag, 1998.
9. E. A. Emerson and K. S. Namjoshi. On model checking for nondeterministic infinite state systems. In Proceedings of LICS'98, pages 70-80, 1998.
10. J. Ezparza. Decidability of model-checking for infinite-state concurrent systems. Acta Informatica, 34:85-107, 1997.
11. A. Finkel. The minimal coverability graph for Petri nets. Lecture Notes in Computer Science, 674:210-243, 1993.
12. A. Finkel and P. Schnoebelen. Fundamental structures in well-structured infinite transition systems. In Proceedings of LATIN'93, LNCS 1380, pages 102-118. Springer-Verlag, 1998.
13. L. Fribourg. Constraint logic programming applied to model checking. In A. Bossi, editor, Proceedings of LOPSTR'99, LNCS 1817, pages 31-42, Venice, Italy, September 1999.
14. R. Glück and M. Leuschel. Abstraction-based partial deduction for solving inverse problems - a transformational approach to software verification. In Proceedings of PSI'99, LNCS 1755, pages 93-100, Novosibirsk, Russia, 1999. Springer-Verlag.
15. T. A. Henzinger and P.-H. Ho. HYTECH: The Cornell HYbrid TECHnology tool. Hybrid Systems II, LNCS 999:265-293, 1995.
16. G. Higman. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society, 2:326-336, 1952.
17. N. D. Jones. An introduction to partial evaluation. ACM Computing Surveys, 28(3):480-503, September 1996.
18. J. Jørgensen and M. Leuschel. Efficiently generating efficient generating extensions in Prolog. In O. Danvy, R. Glück, and P. Thiemann, editors, Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, LNCS 1110, pages 238-262, Schloß Dagstuhl, 1996. Springer-Verlag.
19. R. M. Karp and R. E. Miller. Parallel program schemata. Journal of Computer and System Sciences, 3:147-195, 1969.
20. J. B. Kruskal. Well-quasi ordering, the tree theorem, and Vazsonyi's conjecture. Transactions of the American Mathematical Society, 95:210-225, 1960.
21. M. Leuschel. The ECCE partial deduction system and the DPPD library of benchmarks. Obtainable via http://www.cs.kuleuvon.ac.be/̃dtai, 1996.
22. M. Leuschel. Program specialisation and abstract interpretation reconciled. In J. Jaffar, editor, Proceedings of JICSLP'98, pages 220-234, Manchester, UK, June 1998. MIT Press.
23. M. Leuschel. Logic program specialisation. In J. Hatcliff, T. Æ. Mogensen, and P. Thiemann, editors, Partial Evaluation: Practice and Theory, LNCS 1706, pages 155-188, 1999. Springer-Verlag.
24. M. Leuschel and H. Lehmann. Coverability of reset Petri nets and other well-structured transition systems by partial deduction. In J. Lloyd, editor, Proceedings of CL'2000, LNCS, 2000. Springer-Verlag. to appear.
25. 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.
26. M. Leuschet and T. Massart. Infinite state model checking by abstract interpretation and program specialisation. In A. Bossi, editor, Proceedings of LOPSTR'99, LNCS 1817, pages 63-82, Venice, Italy, September 1999.
27. R. Lipton. The reachability problem and the boundedness problem for Petri nets are exponential-space hard. Conference on Petri Nets and Related Methods, M.I.T., July 1975.
28. J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. The Journal of Logic Programming, 11(3& 4):217-242, 1991.
29. K. Marriott, L. Naish, and J.-L. Lassez. Most specific logic programs. Annals of Mathematics and Artificial Intelligence, 1:303-338, 1990.
30. E. W. Mayr. An algorithm for the general Petri net reachability problem. Siam Journal on Computing, 13:441-460, 1984.
31. F. Moller. Infinite results. In Proceedings of CONCUR'96, LNCS 1119, pages 195-216. Springer-Verlag, 1996.
32. C. Rackoff. The covering and boundedness problems for vector addition systems. Theoretical Computer Science, 6(2):223-231, Apr. 1978.
33. 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 Proceedings of CAV'97, LNCS 1254, pages 143-154. Springer-Verlag, 1997.
34. W. Reisig. Petri Nets - An Introduction. Springer Verlag, 1982.
35. J. Rushby. Mechanized formal methods: Where next? In Proceedings of FM'99, LNCS 1708, pages 48-51, Toulouse, France, Sept. 1999. Springer-Verlag.
36. M. H. Sørensen. Convergence of program transformers in the metric space of trees. In Proceedings of MPC'93, LNCS 1422, pages 315-337. Springer-Verlag, 1998.
37. M. H. Sørensen and R. Glück. An algorithm of generalization in positive supercompilation. In J. W. Lloyd, editor, Proceedings of ILPS'95, pages 465-479, Portland, USA, December 1995. MIT Press.
38. R. Valk and G. Vidal-Naquet. Petri nets and regular languages. Journal of Computer and System Sciences, 23(3):299-325, Dec. 1981.
39. P. Wolper and B. Boigelot. Verifying systems with infinite but regular state spaces. In Proceedings of CAV'98, LNCS, pages 88-97. Springer-Verlag, 1998.