Exploració per tema "Boolean function"
Ara es mostren els items 1-3 de 3
-
A symbolic algorithm for the synthesis of bounded Petri nets
(Springer, 2008)
Text en actes de congrés
Accés obertThis paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A bounded Petri net is always provided in case it exists. Otherwise, the events are split into several transitions to guarantee ... -
Petri net analysis using boolean manipulation
(Springer, 1994)
Capítol de llibre
Accés obertThis paper presents a novel analysis approach for bounded Petri nets. The net behavior is modeled by boolean functions, thus reducing reasoning about Petri nets to boolean calculation. The state explosion problem is managed ... -
Verification of asynchronous circuits by BDD-based model checking of Petri nets
(Springer, 1995)
Text en actes de congrés
Accés obertThis paper presents a methodology for the verification of speed-independent asynchronous circuits against a Petri net specification. The technique is based on symbolic reachability analysis, modeling both the specification ...