6 search results - page 1 / 2 » Name Creation vs. Replication in Petri Net Systems |
APN
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the relationship between name creation and replication in a setting of infinitestate communicating automata. By name creation we mean the capacity of dynamicall...
APN
2009
Springer
14 years 2 months 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...
FUIN
2010
13 years 4 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...
21
Voted
CORR
2010
Springer
13 years 7 months ago
2010
Springer
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...
IADIS
2004
13 years 9 months ago
2004
With rapid development of the Internet, e-learning system has become more and more popular. Currently, to solve the issue of sharing and reusing of teaching materials in different...