Algebrai Models for Contextual

[1]  C. Petri.  Kommunikation mit Automaten , 1962 .

[2]  José Meseguer,et al.  Axiomatizing the algebra of net computations and processes , 1996, Acta Informatica.

[3]  Wolfgang Reisig,et al.  The Non-sequential Behavior of Petri Nets , 1983, Inf. Control..

[4]  Walter Vogler.  Efficiency of Asynchronous Systems and Read Arcs in Petri Nets , 1997, ICALP.

[5]  José Meseguer,et al.  Petri Nets Are Monoids , 1990, Inf. Comput..

[6]  José Meseguer,et al.  Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report , 1996, CONCUR.

[7]  Ugo Montanari,et al.  On the semantics of place/transition Petri nets , 1997, Mathematical Structures in Computer Science.

[8]  Vladimiro Sassone,et al.  An axiomatization of the category of Petri net computations , 1998, Mathematical Structures in Computer Science.

[9]  Roberto Bruni,et al.  A Comparison of Petri Net Semantics under the Collective Token Philosophy , 1998 .

[10]  Vladimiro Sassone,et al.  An Axiomatization of the Algebra of Petri Net Concatenable Processes , 1996, Theor. Comput. Sci..

[11]  Søren Christensen,et al.  Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs , 1992, Application and Theory of Petri Nets.

[12]  Ugo Montanari,et al.  An Event Structure Semantics for P/T Contextual Nets: Asymmetric Event Structures , 1998, FoSSaCS.

[13]  Walter Vogler.  Partial order semantics and read arcs , 2002, Theor. Comput. Sci..

[14]  Raymond R. Devillers,et al.  Sequential and Concurrent Behaviour in Petri Net Theory , 1987, Theor. Comput. Sci..