101 search results - page 5 / 21 » On Reachability in Autonomous Continuous Petri Net Systems |
178
click to vote
FUIN
2010
15 years 3 months ago
2010
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...
207
click to vote
ICINCO
2009
15 years 3 months ago
2009
This paper serves as a support for the plenary address given by the second author during the conference. In this paper we present an approach to on-line diagnosis of discrete even...
175
click to vote
AUTOMATICA
2005
15 years 5 months ago
2005
The number of states in discrete event systems can increase exponentially with respect to the size of the system. A way to face this state explosion problem consists of relaxing t...
176
click to vote
APN
2009
Springer
16 years 15 days ago
2009
Springer
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...
138
click to vote
ACSD
2005
IEEE
15 years 7 months ago
2005
IEEE
An asynchronous wrapper of a fabricated GALS system is analyzed for hazards. For this purpose a Petri net based modelling approach of this GALS wrapper is presented. In our model ...