941 search results - page 128 / 189 » History-Dependent Petri Nets |
BPM
2008
Springer
13 years 11 months ago
2008
Springer
We present a finite representation of all services M where the composition with a given service N is deadlock-free, and a given set of activities of N can be covered (i.e. is not d...
FOSSACS
2005
Springer
14 years 3 months ago
2005
Springer
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
ICCAD
2006
IEEE
14 years 6 months ago
2006
IEEE
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...
ECBS
2009
IEEE
14 years 4 months ago
2009
IEEE
With the pressing in-time-market towards customized services, software product lines (SPL) are increasingly characterizing most of software landscape. SPL are mainly structured th...
ACSD
2005
IEEE
14 years 3 months ago
2005
IEEE
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a...