Sciweavers

26 search results - page 1 / 6
» Decision Problems for Petri Nets with Names
Sort
View
83
Voted
CORR
2010
Springer
140views Education» more  CORR 2010»
14 years 10 months ago
Decision Problems for Petri Nets with Names
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
Fernando Rosa Velardo, David de Frutos-Escrig
FUIN
2010
141views more  FUIN 2010»
14 years 7 months ago
Decidability Problems in Petri Nets with Names and Replication
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T n...
Fernando Rosa Velardo, David de Frutos-Escrig
IJFCS
2008
166views more  IJFCS 2008»
14 years 10 months ago
Decidability and Complexity Analysis of Forbidden State Problems for Discrete Event Systems
The conventional forbidden state problem for discrete event systems is concerned with the issue of synthesizing a maximally permissive control policy to prevent a discrete event s...
Hsu-Chun Yen
104
Voted
IEEEARES
2006
IEEE
15 years 4 months ago
Diagnosis of Complex Systems Using Ant Colony Decision Petri Nets
Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A classic...
Calin Ciufudean, Adrian Graur, Constantin Filote, ...
87
Voted
JSW
2007
118views more  JSW 2007»
14 years 10 months ago
A New Formalism for Failure Diagnosis: Ant Colony Decision Petri Nets
— Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A clas...
Calin Ciufudean, Adrian Graur, Constantin Filote, ...