Sciweavers

Share
47 search results - page 1 / 10
» Decidability Problems in Petri Nets with Names and Replicati...
Sort
View
FUIN
2010
141views more  FUIN 2010»
11 years 11 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
APN
2009
Springer
12 years 8 months ago
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
In previous works we defined ν-APNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverab...
Fernando Rosa Velardo, David de Frutos-Escrig
CORR
2010
Springer
140views Education» more  CORR 2010»
12 years 2 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
IJFCS
2008
166views more  IJFCS 2008»
12 years 2 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
ATVA
2007
Springer
153views Hardware» more  ATVA 2007»
12 years 8 months ago
Continuous Petri Nets: Expressive Power and Decidability Issues
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models. The expected...
Laura Recalde, Serge Haddad, Manuel Silva
books