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...
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...
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...
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, ...
— 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, ...