Sciweavers

1099 search results - page 44 / 220
» Petri net ontology
Sort
View
CONCUR
2001
Springer
14 years 3 months ago
Compositional Modeling of Reactive Systems Using Open Nets
In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalization of the ordinary model where some places, designate...
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Rei...
CAV
2010
Springer
207views Hardware» more  CAV 2010»
14 years 2 months ago
Petruchio: From Dynamic Networks to Nets
We introduce Petruchio, a tool for computing Petri net translations of dynamic networks. To cater for unbounded architectures beyond the capabilities of existing implementations, t...
Roland Meyer, Tim Strazny
CONCUR
2000
Springer
14 years 3 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
TOPNOC
2008
13 years 11 months ago
McMillan's Complete Prefix for Contextual Nets
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
Paolo Baldan, Andrea Corradini, Barbara König...
CONCUR
1999
Springer
14 years 3 months ago
An Unfolding Algorithm for Synchronous Products of Transition Systems
Abstract. The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]....
Javier Esparza, Stefan Römer