Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Interacting services: From specification to execution
Data & Knowledge Engineering
Depth boundedness in multiset rewriting systems with name binding
RP'10 Proceedings of the 4th international conference on Reachability problems
Forward analysis for petri nets with name creation
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
Accelerations for the Coverability Set of Petri Nets with Names
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
On the coverability and reachability languages of monotonic extensions of Petri nets
Theoretical Computer Science
| Hi-index | 0.01 |
When a service engages in multiple conversations concurrently, incoming messages must be correlated with messages previously sent or received. Languages such as BPEL incorporate correlation as first-class citizen. However, current verification and testing techniques for service implementations largely ignore possible correlation anomalies as they typically focus on isolated conversations. This paper defines the notion of instance isolation and shows how to check this property. For doing so it introduces v*-nets, a Petri net extension with name creation and name passing.