Sciweavers

49 search results - page 5 / 10
» A Compact Petri Net Representation for Concurrent Programs
Sort
View
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
14 years 4 months ago
Performance analysis of concurrent systems with early evaluation
Early evaluation allows to execute operations when enough information at the inputs has been received to determine the value at the outputs. Systems that can tolerate variable-lat...
Jorge Júlvez, Jordi Cortadella, Michael Kis...
ACSD
1998
IEEE
121views Hardware» more  ACSD 1998»
13 years 11 months ago
Identifying State Coding Conflicts in Asynchronous System Specifications Using Petri Net Unfoldings
State coding conflict detection is a fundamental part of synthesis of asynchronous concurrent systems from their specifications as Signal Transition Graphs (STGs), which are a spe...
Alex Kondratyev, Jordi Cortadella, Michael Kishine...
CONCUR
2000
Springer
13 years 11 months 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
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
APN
1993
Springer
13 years 11 months ago
Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs
In this paper we show how to extend Coloured Petri Nets (CP-nets), with three new modelling primitives—place capacities, test arcs and inhibitor arcs. The new modelling primitiv...
Søren Christensen, Niels Damgaard Hansen