Trace nets and process automata

Trace nets are a variant of one-safe Petri nets, where input and output places may be filled as well as emptied by transitions. Those extended nets are introduced for modelling concurrency in a simple format of structural operational specifications, based on permutation of proved transitions. Trace nets are connected by an adjunction to a particular class of trace automata in the sense of Stark, namely the separated trace automata. The adjunction is based on a calculus of ‘regions’ that differ significantly from the ones devised by Ehrenfeucht and Rozenberg for elementary nets, although the axioms of separation are the same.

[1]  Irène Guessarian,et al.  Semantics of systems of concurrent processes : LITP Spring School on Theoretical Computer Science, La Roche Posay, France, April 23-27, 1990, proceedings , 1990 .

[2]  S. Lane.  Categories for the Working Mathematician , 1971 .

[3]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, Journal of Logic and Computation.

[4]  Madhavan Mukund.  Petri Nets and Step Transition Systems , 1992, Int. J. Found. Comput. Sci..

[5]  Glynn Winskel,et al.  Models for Concurrency , 1994 .

[6]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[7]  Eugene W. Stark.  Connections between a Concrete and an Abstract Model of Concurrent Systems , 1989, Mathematical Foundations of Programming Semantics.

[8]  Ilaria Castellani,et al.  Three Equivalent Semantics for CCS , 1990, Semantics of Systems of Concurrent Processes.

[9]  Ilaria Castellani,et al.  A non-interleaving semantics for CCS based on proved transitions , 1988 .

[10]  G. Rozenberg,et al.  Elementary transition systems , 1990 .

[11]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[12]  Andrzej Ehrenfeucht,et al.  Partial (set) 2-structures , 1990, Acta Informatica.

[13]  Pierre Leroux,et al.  Structure et Semantique Abstraites: Extension a des Categories de Morphismes d'une Paire de Foncteurs Adjoints , 1971 .

[14]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .

[15]  Grzegorz Rozenberg,et al.  Transition Systems, Event Structures and Unfoldings , 1991 .

[16]  S. Maclane,et al.  Categories for the Working Mathematician , 1971 .

[17]  Manfred Droste,et al.  Petri nets and automata with concurrency relations—an adjunction , 1993 .