Solving coverability problems of petri nets by partial deduction

Leuschel, Michaël; Lehmann, Helko

doi:10.1145/351268.351298

Cited by 17 publications

(22 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed, in partial evaluation one faces a very similar (and extensively studied) problem: To be able to produce efficient specialised programs, infinite computation trees have to be abstracted in a finite but also as precise as possible way. [15] showed that when we encode Petri nets as logic programs, the specialised programs can be viewed as a finite abstraction of state space covering all (possibly infinite) reachable markings of the Petri net. This allowed one to decide coverability problems (which encompass quasi-liveness, boundedness, determinism, regularity,...) for any Petri net using the specialiser ecce [18].…”

Section: Infinite State Model Checking Using Eccementioning

confidence: 99%

Model checking object petri nets in prolog

Farwer

Leuschel

2004

Proceedings of the 6th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

Object Petri nets (OPNs) provide a natural and modular method for the modelling of many real-world systems. We give a structure-preserving translation of OPNs to Prolog, avoiding the need for an unfolding to a flat Petri net. The translation provides support for reference and value semantics, and even allows different objects to be treated as copyable or non-copyable, respectively. The method is developed for OPNs with arbitrary nesting. We then apply logic programming tools to animate, compile and model check OPNs. In particular, we use the partial evaluation system logen to produce an OPN compiler, and we use the model checker xtl to verify CTL formulas. We also use logen to produce special purpose model checkers. We present two case studies, along with experimental results. A comparison to OPN translations to Maude specifications and model checking is given, showing that our approach is roughly twice as fast for larger systems. We also tackle infinite state model checking using the ecce system.

show abstract

Section: Infinite State Model Checking Using Eccementioning

confidence: 99%

Model checking object petri nets in prolog

Farwer

Leuschel

2004

Proceedings of the 6th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…If this transformation is successful, the infinite state system is safe. This approach can successfully handle [35] various versions and extensions of Petri nets. However, the state expressions of process algebras are more involved and existing partial deduction techniques will not be able to deduce that unsafe(agent(p)) must fail.…”

Section: Limitation Of Classical Partial Deductionmentioning

confidence: 99%

“…This precision problem did not arise in the context of Petri nets in [35,34]. Indeed, Petri nets have a "fixed structure", which can be captured within the PDdomain.…”

Section: Limitation Of Classical Partial Deductionmentioning

confidence: 99%

“…For example, take a Petri net with three places and where markings are encoded as lists of natural numbers. Then the msg of, e.g., unsafe([0,s(0),0]) and unsafe([s(0),s(0),s(0)]) is unsafe([X,s(0),X]) and in this case the msg is actually quite precise, and the PD-domain is sufficient to decide several interesting problems [35,34].…”

Section: Limitation Of Classical Partial Deductionmentioning

confidence: 99%

“…The advantage of this approach is its generality. For example, one can change the specification formalism by providing a different interpreter (e.g, for CSP or the B-method or variations thereof, see [31]), one can tune the verification algorithm by tuning the settings of the specialisation algorithm (see [35,34]), and one can also try to apply the verification approach for systems and properties which are in principle undecidable.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking

Leuschel

Grüner

2002

Logic Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

Abstract. We present an abstract partial deduction technique which uses regular types as its domain and which can handle conjunctions, and thus perform deforestation and tupling. We provide a detailed description of all the required operations and present an implementation within the ecce system. We discuss the power of this new specialisation algorithm, especially in the light of verifying and specialising infinite state process algebras. Here, our new algorithm can provide a more precise treatment of synchronisation and can be used for refinement checking.

show abstract

Partial Deduction for Linear Logic—The Symbolic Negotiation Perspective

Küngas

Matskin

2005

Declarative Agent Languages and Technologies II

View full text Add to dashboard Cite

Solving coverability problems of petri nets by partial deduction

Cited by 17 publications

References 14 publications

Model checking object petri nets in prolog

Model checking object petri nets in prolog

Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking

Partial Deduction for Linear Logic—The Symbolic Negotiation Perspective

Contact Info

Product

Resources

About