Solving Coverability Problems of Petri Nets by Partial Deduction
Solving Coverability Problems of Petri Nets by Partial Deduction
In recent work it has been shown that infinite state model checking can be performed by a combination of partial deduction of logic programs and abstract interpretation. This paper focuses on one particular class of problem--coverability for (infinite state) Petri nets--and shows how existing techniques and tools for declarative programs can be successfully applied. In particular, we show that a restricted form of partial deduction is already powerful enough to decide all coverability properties of Petri Nets. We also prove that two particular instances of partial deduction exactly compute the Karp-Miller tree as well as Finkel's minimal coverability set. We thus establish an interesting link between algorithms for Petri nets and logic program specialisation.
Petri nets, verification, logic programming, model checking, infinite state model checking, partial evaluation, partial deduction, program specialisation
268-279
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Lehmann, Helko
4f3377c6-3d27-423d-8de9-dcb8feebf814
Gabbrielli, Maurizio
fae9c89e-bc06-401b-ada1-6e23cc5d8122
Pfenning, Frank
0da74bb9-457d-4f21-a83b-e6937294efbe
September 2000
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Lehmann, Helko
4f3377c6-3d27-423d-8de9-dcb8feebf814
Gabbrielli, Maurizio
fae9c89e-bc06-401b-ada1-6e23cc5d8122
Pfenning, Frank
0da74bb9-457d-4f21-a83b-e6937294efbe
Leuschel, Michael and Lehmann, Helko
(2000)
Solving Coverability Problems of Petri Nets by Partial Deduction.
Gabbrielli, Maurizio and Pfenning, Frank
(eds.)
Proceedings of the International Conference on Principles and Practice of Declarative Programming (PPDP'2000).
.
Record type:
Conference or Workshop Item
(Other)
Abstract
In recent work it has been shown that infinite state model checking can be performed by a combination of partial deduction of logic programs and abstract interpretation. This paper focuses on one particular class of problem--coverability for (infinite state) Petri nets--and shows how existing techniques and tools for declarative programs can be successfully applied. In particular, we show that a restricted form of partial deduction is already powerful enough to decide all coverability properties of Petri Nets. We also prove that two particular instances of partial deduction exactly compute the Karp-Miller tree as well as Finkel's minimal coverability set. We thus establish an interesting link between algorithms for Petri nets and logic program specialisation.
Other
PPDP2000.tex.ps
- Other
More information
Published date: September 2000
Additional Information:
Organisation: ACM
Venue - Dates:
Proceedings of the International Conference on Principles and Practice of Declarative Programming (PPDP'2000), 2000-09-01
Keywords:
Petri nets, verification, logic programming, model checking, infinite state model checking, partial evaluation, partial deduction, program specialisation
Identifiers
Local EPrints ID: 253309
URI: http://eprints.soton.ac.uk/id/eprint/253309
PURE UUID: 416f2fde-499a-4756-b417-942d70e75f16
Catalogue record
Date deposited: 18 Jun 2001
Last modified: 14 Mar 2024 05:25
Export record
Contributors
Author:
Michael Leuschel
Author:
Helko Lehmann
Editor:
Maurizio Gabbrielli
Editor:
Frank Pfenning
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics