Sciweavers

184 search results - page 12 / 37
» Distributed Unfolding of Petri Nets
Sort
View
BIRTHDAY
2008
Springer
13 years 9 months ago
The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed
The Scholten/Dijkstra "Pebble Game" is re-examined. We show that the algorithm lends itself to a distributed as well as an online version, and even to a reversed variant....
Wolfgang Reisig
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
13 years 11 months ago
Timed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
14 years 1 months ago
Unfolding Concurrent Well-Structured Transition Systems
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...
Frédéric Herbreteau, Grégoire...
ACSD
2003
IEEE
105views Hardware» more  ACSD 2003»
13 years 11 months ago
Detecting State Coding Conflicts in STG Unfoldings Using SAT
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...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
JCSC
1998
159views more  JCSC 1998»
13 years 7 months ago
An Approach to Object System Modeling by State-Based Object Petri Nets
For many years, Petri nets have been used for modeling the behavior of various types of concurrent systems. While these net models are especially well suited to capture the behavi...
A. Newman, Sol M. Shatz, X. Xie