Petri Nets With Persistence

Authors:
Federico Crazzolara;Glynn Winskel
Affiliations:
C&C Research Laboratories, NEC Europe, ltd., Sankt Augustin, Germany;Computer Laboratory, University of Cambridge, Cambridge, England
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 6
Cited 0

Petri nets: an introduction

Petri nets: an introduction
Petr nets, algebras, morphisms, and compositionality

Information and Computation
The inductive approach to verifying cryptographic protocols

Journal of Computer Security
Events in security protocols

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs

Proceedings of the 14th International Conference on Application and Theory of Petri Nets
A General Systematic Approach to Arc Extensions for Coloured Petri Nets

Proceedings of the 15th International Conference on Application and Theory of Petri Nets

Quantified Score

Hi-index	0.01

Visualization

Abstract

Persistence of information is common in modern computer systems. This paper describes how to extend Petri nets, a traditional model of concurrent and distributed computations, to take account of conditions that are persistent. We found use for this kind of nets in modelling untrustworthy networks on which messages are exchanged according to a security protocol. The paper explains a construction where persistent conditions are unfolded and a basic net is recovered. Conditions are given under which the unfolded net exhibits the same finite behaviours as the original net with persistence.