Sciweavers

98 search results - page 4 / 20
» LTL Model Checking for Modular Petri Nets
Sort
View
ACTA
2007
96views more  ACTA 2007»
13 years 5 months ago
Recursive Petri nets
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
Serge Haddad, Denis Poitrenaud
TACS
1991
Springer
13 years 8 months ago
On Nets, Algebras and Modularity
We aim at a unified and coherent presentation of net models for concurrency like Petri nets and dataflow networks from the perspective of modularity and substitutivity. The major ...
Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
CAV
2004
Springer
104views Hardware» more  CAV 2004»
13 years 10 months ago
Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings
Abstract. We present an unfolding-based approach to LTL-X modelchecking of high-level Petri nets. It is based on the method proposed by Esparza and Heljanko for low-level nets [4, ...
Claus Schröter, Victor Khomenko
APN
2007
Springer
13 years 11 months ago
A Compositional Method for the Synthesis of Asynchronous Communication Mechanisms
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ...
Kyller Costa Gorgônio, Jordi Cortadella, Fei...
APN
2007
Springer
13 years 11 months ago
History-Dependent Petri Nets
Most information systems that are driven by process models (e.g., workflow management systems) record events in event logs, also known as transaction logs or audit trails. We cons...
Kees M. van Hee, Alexander Serebrenik, Natalia Sid...