Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Rewriting Logic as a Unifying Framework for Petri Nets
Unifying Petri Nets, Advances in Petri Nets
Mobile Petri Nets
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Formal Methods in System Design
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
CPN tools for editing, simulating, and analysing coloured Petri nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Modelling mobility with petri hypernets
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
Nested Petri Nets: Multi-level and Recursive Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Code mobility modeling: a temporal labeled reconfigurable nets
Proceedings of the 1st international conference on MOBILe Wireless MiddleWARE, Operating Systems, 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
Symbolic semantics for the verification of security properties of mobile petri nets
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Modeling and analysis of the business process of the supply chain of virtual enterprises
Transactions on Edutainment VIII
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
Petri nets for the verification of ubiquitous systems with transient secure association
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
| Hi-index | 0.00 |
Mobile Synchronizing Petri Nets (MSPN's) are a model for mobility and coordination based on coloured Petri Nets, in which systems are composed of a collection of (possibly mobile) hardware devices and mobile agents, both modelled homogenously. In this paper we approach their verification, for which we have chosen to code MSPN's into rewriting logic. In order to obtain a representation of MSPN systems by means of a rewrite theory, we develop a class of them, that we call @n-Abstract Petri nets (@n-APN's), which are easily representable in that framework. Moreover, the obtained representation provides a local mechanism for fresh name generation. Then we prove that, even if @n-APN's are a particular class of MSPN systems, they are strong enough to capture the behaviour of any MSPN system. We have chosen Maude to implement @n-APN's, as well as the translation from MSPN's to @n-APN's, for which we make intensive use of its reflective features.