Results 241 to 250 of about 20,891 (263)
Some of the next articles are maybe not open access.
Fundam. Informaticae, 2005
Summary: It is demonstrated that the introduction of probability into Petri nets increases their power, in particular for their reachability sets. To achieve this the definition of accepted languages by probabilistic finite automata or probabilistic Turing machines with complexity restriction has to be modified.
openaire +2 more sources
Summary: It is demonstrated that the introduction of probability into Petri nets increases their power, in particular for their reachability sets. To achieve this the definition of accepted languages by probabilistic finite automata or probabilistic Turing machines with complexity restriction has to be modified.
openaire +2 more sources
Feedback control of petri nets based on place invariants
Automatica, 1996Panos Antsaklis +2 more
exaly
Putting high-level Petri nets to work in industry
Computers in Industry, 1994W M P Van Der Aalst
exaly
Petri nets and industrial applications: A tutorial
IEEE Transactions on Industrial Electronics, 1994Mengchu Zhou, R Zurawski
exaly
Blocking and controllability of Petri nets in supervisory control
IEEE Transactions on Automatic Control, 1994Alessandro Giua, F Dicesare
exaly
New Petri Net Structure and Its Application to Optimal Supervisory Control: Interval Inhibitor Arcs
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2014Kamel Barkaoui +2 more
exaly
On the Decidability and Complexity of Diagnosability for Labeled Petri Nets
IEEE Transactions on Automatic Control, 2017Stéphane Lafortune, Xiang Yin
exaly

