Petri nets and step transition systems

Mukund, Madhavan (1992) Petri nets and step transition systems International Journal of Foundations of Computer Science, 03 (04). pp. 443-478. ISSN 0129-0541

Full text not available from this repository.

Official URL:

Related URL:


Labelled transition systems are a simple yet powerful formalism for describing the operational behaviour of computing systems. They can be extended to model concurrency faithfully by permitting transitions between states to be labelled by a collection of actions, denoting a concurrent step. Petri nets (or Place/Transition nets) give rise to such step transition systems in a natural way—the marking diagram of a Petri net is the canonical transition system associated with it. In this paper, we characterize the class of PN-transition systems, which are precisely those step transition systems generated by Petri nets. We express the correspondence between PN-transition systems and Petri nets in terms of an adjunction between a category of PN-transition systems and a category of Petri nets in which the associated morphisms are behaviour-preserving in a strong and natural sense.

Item Type:Article
Source:Copyright of this article belongs to World Scientific Publishing Company.
Keywords:Petri Nets; Models for Concurrency; Category Theory
ID Code:114253
Deposited On:25 May 2018 04:56
Last Modified:25 May 2018 04:56

Repository Staff Only: item control page