Sciweavers

189 search results - page 6 / 38
» The unfolding of general Petri nets
Sort
View
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...
ACSD
2004
IEEE
113views Hardware» more  ACSD 2004»
13 years 11 months ago
Logic Synthesis for Asynchronous Circuits Based on Petri Net Unfoldings and Incremental SAT
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 edges of...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
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...
AC
2003
Springer
14 years 23 days ago
Synthesis of Asynchronous Hardware from Petri Nets
Abstract. As semiconductor technology strides towards billions of transistors on a single die, problems concerned with deep sub-micron process features and design productivity call...
Josep Carmona, Jordi Cortadella, Victor Khomenko, ...
APN
1994
Springer
13 years 11 months ago
On the Model of Computation of Place/Transition Petri Nets
Abstract. In the last few years, the semantics of Petri nets has been investigated in several different ways. Apart from the classical "token game", one can model the beh...
José Meseguer, Ugo Montanari, Vladimiro Sas...