The mathematics of Petri nets
Some computer science issues in ubiquitous computing
Communications of the ACM - Special issue on computer augmented environments: back to the real world
A calculus of mobile processes, I
Information and Computation
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Place or Transition Petri Nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
Name creation vs. replication in Petri net systems
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
| Hi-index | 0.00 |
In this paper we extend our basic model of Ubiquitous Nets, by adding a replication operator that creates new copies of the net firing the replicating transition. We prove that the location attribute and thus the mobility feature are not essential characteristics of the obtained model, since it is equivalent to the particular case of Centralized Systems, where all components are stationary and co-located in a single location. This allows us to restrict ourselves to Centralized Systems when studying the decidability of reachability and coverability properties. In this way, we prove that both reachability and coverability remain decidable. Finally, we introduce an alternative version that includes a garbage collection mechanism that allows us to remove empty nets from the state of the system. We show that in this case coverability remains decidable.