Sassone, Vladimiro (1996) An Axiomatization of the Algebra of Petri Net Concatenable Processes. Theoretical Computer Science, 170 (1-2). pp. 277-296. ISSN 03043975

Full text not available from this repository.

Abstract

The concatenable processes of a Petri net N can be characterized abstractly as the arrows of a symmetric monoidal category View the MathML source(N). However, this is only a partial axiomatization, since it is based on a concrete, ad hoc chosen, category of symmetries SymN. In this paper we give a completely abstract characterization of the category of concatenable processes of N, thus yielding an axiomatic theory of the noninterleaving behaviour of Petri nets.

Item Type:	Article
Schools and Departments:	School of Engineering and Informatics > Informatics
Depositing User:	EPrints Services
Date Deposited:	06 Feb 2012 19:11
Last Modified:	06 Jun 2012 16:29
URI:	http://sro.sussex.ac.uk/id/eprint/19528

📧 Request an update