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
The computer for the 21st century
Human-computer interaction
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
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Security: for ubiquitous computing
Security: for ubiquitous computing
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
On Non-Decidability of Reachability for Timed-Arc Petri Nets
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
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
Depth boundedness in multiset rewriting systems with name binding
RP'10 Proceedings of the 4th international conference on Reachability problems
Multiset rewriting: a semantic framework for concurrency with name binding
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Dynamic soundness in resource-constrained workflow nets
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Forward analysis for petri nets with name creation
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
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
Language-based comparison of petri nets with black tokens, pure names and ordered data
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Accelerations for the Coverability Set of Petri Nets with Names
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Generation of Database Transactions with Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
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 |
In recent papers we have introduced Mobile Synchronizing Petri Nets, a new model for mobility based on coloured Petri Nets. It allows the description of systems composed of a collection of (possibly mobile) hardware devices and mobile agents, both modelled in a homogenous way and abstracting from middleware details. Our basic model introduced a colour to describe localities, but still lacked appropriate primitives to deal with security, and in fact it was equivalent to P/T nets. Then, we introduced the primitives to cope with security: a new colour for identifiers, basically corresponding to the natural numbers, that are created by means of a special transition. This mechanism allows us to deal with authentication issues. In this paper we discuss the expressiveness of the extended model with the authentication primitives. More specifically, we study several instances of the classical reachability and coverability problems. Finally, we also study a more abstract version of the mechanism to create identifiers, using abstract names, close to those in the @p-calculus or the Ambient Calculus. We have proved that both models are strictly in between P/T nets and Turing machines.