Sciweavers

189 search results - page 4 / 38
» The unfolding of general Petri nets
Sort
View
GG
2010
Springer
13 years 8 months ago
On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
Paolo Baldan, Alessandro Bruni, Andrea Corradini, ...
DAC
1994
ACM
13 years 11 months ago
A Communicating Petri Net Model for the Design of Concurrent Asynchronous Modules
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...
Gjalt G. de Jong, Bill Lin
APN
2006
Springer
13 years 9 months ago
How Expressive Are Petri Net Schemata?
Petri net schemata are an intuitive and expressive approach to describe high-level Petri nets. A Petri net schema is a Petri net with edges and transitions inscribed by terms and B...
Andreas Glausch, Wolfgang Reisig
ACSD
2008
IEEE
108views Hardware» more  ACSD 2008»
13 years 9 months ago
Modular construction of finite and complete prefixes of Petri net unfoldings
This paper considers distributed systems, defined as a collection of components interacting through interfaces. Components, interfaces and distributed systems are modeled as Petri...
Agnes Madalinski, Eric Fabre
CONCUR
2000
Springer
13 years 12 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