Sciweavers

189 search results - page 9 / 38
» The unfolding of general Petri nets
Sort
View
FUIN
2007
108views more  FUIN 2007»
13 years 8 months ago
An Axiomatization of the Token Game Based on Petri Algebras
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri ...
Eric Badouel, Jules Chenou, Goulven Guillou
APN
1999
Springer
14 years 1 months ago
Detection of Illegal Behaviors Based on Unfoldings
We show how the branching process approach can be used for the detection of illegal behaviors. Our study is based on the specification of properties in terms of testers that cover...
Jean-Michel Couvreur, Denis Poitrenaud
CONCUR
2004
Springer
14 years 2 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König
PPDP
2004
Springer
14 years 2 months ago
Model checking object petri nets in prolog
Object Petri nets (OPNs) provide a natural and modular method for modelling many real-world systems. We give a structure-preserving translation of OPNs to Prolog by encoding the O...
Berndt Farwer, Michael Leuschel
CONCUR
2000
Springer
14 years 9 days ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko