99 search results - page 10 / 20 » Directed Unfolding of Petri Nets |
TACAS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Our main objective is to combine partial-order methods with verification techniques for infinite-state systems in order to obtain efficient verification algorithms fo...
ACSD
2003
IEEE
13 years 11 months ago
2003
IEEE
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
APN
2004
Springer
14 years 23 days ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Software systems are subject to ever increasing complexity and in need of efficient structuring. The concept of organization as an exand abstract real-world reference presents a pr...
BIRTHDAY
2005
Springer
14 years 27 days ago
2005
Springer
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...