Model Checking of Object Petri Nets in Prolog
Model Checking of Object Petri Nets in Prolog
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.
Object Petri nets, Model checking, Prolog, Animation, Compilation
Farwer, Berndt
fa53e8f3-4281-41dc-891b-4bf6acdd4e3e
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
November 2003
Farwer, Berndt
fa53e8f3-4281-41dc-891b-4bf6acdd4e3e
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Farwer, Berndt and Leuschel, Michael
(2003)
Model Checking of Object Petri Nets in Prolog
Record type:
Monograph
(Project Report)
Abstract
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.
Text
DSSE_TR_2003_4.pdf
- Other
More information
Published date: November 2003
Additional Information:
To appear in the Proceedings of PPDP'04, ACM Press.
Keywords:
Object Petri nets, Model checking, Prolog, Animation, Compilation
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 258562
URI: http://eprints.soton.ac.uk/id/eprint/258562
PURE UUID: f37fb042-d41d-4087-b2bf-7933b313d545
Catalogue record
Date deposited: 17 Nov 2003
Last modified: 14 Mar 2024 06:10
Export record
Contributors
Author:
Berndt Farwer
Author:
Michael Leuschel
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