Partial ordering models for concurrency can be defined operationally

Labelled rewriting systems are shown to be powerful enough for defining the semantics of concurrent systems in terms of partial orderings of events, even in the presence of non standard operators like N that is not expressible by means of concurrency and sequentialization. This contrasts with Pratt's claim.(1) The main operators proposed by Pratt are used here to construct terms denoting concurrent systems, the behavior of which consists of partially ordered multisets defined operationally.(2) Fully abstractness of the denotational semantics as defined in Ref. 1 with respect to the operational one is finally proved.

[1]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

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

[3]  C. A. Petri.  Introduction to General Net Theory , 1979, Advanced Course: Net Theory and Applications.

[4]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[5]  Philippe Darondeau,et al.  On the Observational Semantics of Fair Parallelism , 1983, ICALP.

[6]  Glynn Winskel,et al.  Petri Nets, Algebras, Morphisms, and Compositionality , 1987, Inf. Comput..

[7]  Rocco De Nicola,et al.  CCS is an (Augmented) Contact Free C/E System , 1986, Mathematical Models for the Semantics of Parallelism.

[8]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[9]  Józef Winkowski,et al.  Behaviours of Concurrent Systems , 1980, Theor. Comput. Sci..

[10]  Leslie Lamport,et al.  What Good is Temporal Logic? , 1983, IFIP Congress.

[11]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .

[12]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[13]  Ernst-Rüdiger Olderog,et al.  Operational Petri net semantics for CCSP , 1986, European Workshop on Applications and Theory of Petri Nets.

[14]  Gérard Boudol,et al.  Algèbre de Processus et Synchronisation , 1984, Theor. Comput. Sci..

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

[16]  Ilaria Castellani,et al.  On the Semantics of Concurrency: Partial Orders and Transition Systems , 1987, TAPSOFT, Vol.1.

[17]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[18]  Ugo Montanari,et al.  A model for distributed systems based on graph rewriting , 1987, JACM.

[19]  Maurice Nivat,et al.  Behaviors of Processes and Synchronized Systems of Processes , 1982 .

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

[21]  Ugo Montanari,et al.  Concurrent Histories: A Basis for Observing Distributed Systems , 1987, J. Comput. Syst. Sci..

[22]  Vaughan R. Pratt,et al.  Modeling concurrency with partial orders , 1986, International Journal of Parallel Programming.

[23]  Robin Milner,et al.  Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[24]  Manfred Broy,et al.  Views of Distributed Systems , 1986, Mathematical Models for the Semantics of Parallelism.

[25]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[26]  D. Simpson.  Theoretical foundations of programming methodology, manfred broy and gunther schmidt (eds.), D. Reidel Publishing Co, 1982. No. of pages: 658. Price $78.50 (hardback), $39.50 (paperback) , 1983 .

[27]  George J. Milne,et al.  CIRCAL and the representation of communication, concurrency, and time , 1985, TOPL.