66 search results - page 9 / 14 » Diagnosability of bounded Petri nets |
APN
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. Symbolic techniques based on BDDs (Binary Decision Diagrams) have emerged as an e cient strategy for the analysis of Petri nets. The existing techniques for the symbolic ...
APN
2009
Springer
14 years 2 months ago
2009
Springer
In [LJ06] Lorenz and Juh´as raised the question of whether there exists a suitable formalism for the representation of infinite families of partial orders generated by Petri nets...
INFORMATICALT
2010
13 years 4 months ago
2010
This paper analyses the possibilities of integrating different technological and knowledge representation techniques for the development of a framework for the remote control of mu...
ACSD
2006
IEEE
14 years 1 months ago
2006
IEEE
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterminis...
ACSD
2008
IEEE
14 years 2 months ago
2008
IEEE
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, two automati...