Coverability of reset petri nets and other well-structured transition systems by partial deduction

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 101-115

  Leuschel, Michael ^a   Lehmann, Helko ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT INTERPRETATIONS; ALGORITHM SCHEMES; COMPLICATED SYSTEMS; COVERABILITY; COVERABILITY PROBLEM; FORWARD ALGORITHMS; INFINITE STATE MODEL CHECKING; LOGIC PROGRAMS; PARTIAL DEDUCTION; SCALE-UP; WELL-STRUCTURED TRANSITION SYSTEMS;

ALGORITHMS; LOGIC PROGRAMMING;

PETRI NETS;

EID: 84867788384     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_7     Document Type: Conference Paper

References (35)

1. P. A. Abdulla, K.-Cer-Ans, B. Jonsson, and Y.-K. Tsay. General decidability theorems for infinite-state systems. In Proceedings LICS'96, pages 313-321, July 1996. IEEE Computer Society Press.
2. T. Araki and T. Kasami. Some decision problems related to the reachability problem for Petri nets. Theoretical Computer Science, 3:85-104, 1977.
3. B. Berard and L. Fribourg. Reachability analysis of (timed) petri nets using real arithmetic. In Proceedings 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. Ste-en, editor, Proceedings TACAS'98, 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: Founda tions, control, algorithms and experiments. J. Logic Progam., 41(2 & 3):231-277, November 1999.
6. C. Dufourd, A. Finkel, and P. Schnoebelen. Reset nets between decidability and undecidability. In Proceedings ICALP'98, LNCS 1443, pages 103-115. Springer-Verlag, 1998.
7. J. Ezparza. Decidability of model-checking for infinite-state concurrent systems. Acta Informatica, 34:85-107, 1997.
8. A. Finkel. The minimal coverability graph for Petri nets. Advances in Petri Nets 1993, LNCS 674, pages 210-243, 1993.
9. A. Finkel and P. Schnoebelen. Fundamental structures in well-structured infinite transition systems. In Proceedings LATIN'98, LNCS 1380, pages 102-118. Springer-Verlag, 1998.
10. A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere ! Theoretical Computer Science, 2000. To appear.
11. L. Fribourg and H. Olsen. Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmtic. In Proceedings Concur'97, LNCS 1243, pages 213-227. Springer-Verlag, 1997.
12. R. Glück,M. Leuschel Abstraction-based partial deduction for solving inverse problems-A transformational approa ch to software verification In Proceedings PSI'99, LNCS 1755 93-100, 1999, Springer-Verlag
13. B. Heinemann. Subclasses of self-modifying nets. In Applications and Theory of Petri Nets, pages 187-192. Springer-Verlag, 1982.
14. T. A. Henzinger and P.-H. Ho. HYTECH: The Cornell HYbrid TECHnology tool. Hybrid Systems II, LNCS 999:265-293, 1995.
15. R. M. Kar p and R. E. Miller. Parallel program schemata. Journal of Computer and System Sciences, 3:147-195, 1969.
16. L. Lafave and J. Gallagher. Constraint-based partial evaluation of rewriting-based functional logic programs. In N. Fuchs, editor, Proceedings LOPSTR'97, LNCS 1463, pages 168-188, July 1997.
17. J.-L. Lassez, M. Maher, and K. Marriott. Uni-cation revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587-625. Morgan-Kaufmann, 1988.
18. M. Leusc hel. Program specialisation and abstract interpretation reconciled. In J. Jaar, editor, Proceedings JICSLP'98, pages 220-234, Manchester, UK, June 1998. MIT Press.
19. M. Leuschel. Logic program s pecialisation. In J. Hatcli-, T.-. Mogensen, and P. Thiemann, editors, Partial Evaluation: Practice and Theory, LNCS 1706, pages 155-188 and 271-292, 1999. Springer-Verlag.
20. M. Leuschel and D. De Schreye. Logic program specialisation: How to be more speci-c. In H. Kuchen and S. Swierstra, editors, Proceedings PLILP'96, LNCS 1140, pages 137-151, September 1996. Springer-Verlag.
21. M. Leuschel and D. De Schreye. Constrained partial deduction and the preservation of characteristic trees. New Gen. Comput. , 16:283-342, 1998.
22. M. Leuschel and H. Lehmann. Solving Coverability Problems of Petri Nets by Partial Deduction. Submitted.
23. 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.
24. M. Leuschel and T. Massart. Infinite state model checking by abstract interpre tation and program specialisation. In A. Bossi, editor, Proceedings LOPSTR'99, LNCS 1817, pages 63-82, Venice, Italy, September 1999.
25. J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic program ming. J. Logic Progam., 11(3& 4):217-242, 1991.
26. K. Marriott, L. Naish, and J.-L. Lassez. Most speci-c logic programs. Annals of Mathematics and Artificial Intelligence, 1:303-338, 1990.
27. B. Martens and J. Gallagher. Ensuring global termination of partial deduction while allowing flexible polyvariance. In L. Sterling, editor, Proceedings ICLP'95, pages 597-613, June 199 5. MIT Press.
28. E. W. Mayr. An algorithm for the general Petri net reachability problem. Siam Journal on Computing, 13:441-460, 1984.
29. Y. S. Ramakrishna, C. R. Ramak rishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In Proceedings CAV'97, LNCS 1254, pages 143-154. Springer-Verlag, 1997.
30. W. Reisig. Petri Nets-An Introduction. Springer Verlag, 1982.
31. J. Rushby. Mechanized formal methods: Where next? In Proceedings of FM'99, LNCS 1708, pages 48-51, Sept. 1999. Springer-Verlag.
32. M. H. S-rensen. Convergence of program transformers in the metric space of trees. In Proceedings MPC'98, LNCS 1422, pages 315-337. Springer-Verlag, 1998.
33. M. H. S-rensen,R. Glück An algorithm of generalization in positive supercompilation In J. W. Lloyd, editor, Proceedings ILPS'95 465-479 December 1995. MIT Press.
34. R. Valk. Self-mod ifying nets, a natural extension of Petri neets. In Proceedings ICALP'78, LNCS 62, pages 464-476. Springer-Verlag, 1978.
35. R. Valk and G. Vidal-Naquet. Petri nets and regular languages. Journal of Com-puter and System Sciences, 23(3):299-325, Dec. 1981.