An Extended Expansion Theorem

Closed CCS (CCCS) is a CCS-like algebra of processes with a generalized form of prefixing based on a full-fledged algebra of transitions rather than on basic actions only. The basic idea is that the generalized prefixing operator takes a transition t, or rather its observation ω, a process E and yields the process t.E. From an operational standpoint, the process t.E may evolve to E by performing a transition labelled by ω. By exploiting the algebra of transitions, we define a general form of expansion theorem which is the heart of a finite axiomatization of a strong observational equivalence for finite CCCS agents. By adding the axioms concerning the interpretation of the operations of the algebra of observations, we still obtain a sound and complete axiomatization of the corresponding bisimulation equivalence. For instance, it is possible to define the classical expansion theorem, or versions of it which handle partial ordering based observations.

[1]  J. Grabowski,et al.  On partial languages , 1981, Fundam. Informaticae.

[2]  Manfred Droste Event Structures and Domains , 1989, Theor. Comput. Sci..

[3]  Ursula Goltz On Representing CCS Programs by Finite Petri Nets , 1988, MFCS.

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

[5]  Rocco De Nicola,et al.  Universal Axioms for Bisimulations , 1993, Theor. Comput. Sci..

[6]  Ilaria Castellani,et al.  Permutation of transitions: An event structure semantics for CCS and SCCS , 1988, REX Workshop.

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

[8]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[9]  Ugo Montanari,et al.  Partial ordering derivations for CCS , 1985, FCT.

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

[11]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[12]  Philippe Darondeau,et al.  Causal Trees , 1989, ICALP.

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

[14]  Philippe Darondeau,et al.  Causal Trees: Interleaving + Causality , 1989, Semantics of Systems of Concurrent Processes.

[15]  Roberto Gorrieri,et al.  SCONE: A Simple Calculus of Nets , 1990, CONCUR.

[16]  Roberto Gorrieri,et al.  A2CCKS: Atomic Actions for CCS , 1990, Theor. Comput. Sci..

[17]  Wolfgang Reisig Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[18]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[19]  Rocco De Nicola,et al.  A Partial Ordering Semantics for CCS , 1990, Theor. Comput. Sci..

[20]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

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

[22]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[23]  Rocco De Nicola,et al.  Observational equivalences for concurrency models , 1987, Formal Description of Programming Concepts.

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

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

[26]  Faron Moller The Importance of the Left Merge Operator in Process Algebras , 1990, ICALP.

[27]  Faron Moller,et al.  The nonexistence of finite axiomatisations for CCS congruences , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[28]  Ugo Montanari,et al.  Axiomatizing net computations and processes , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[29]  Gian Luigi Ferrari,et al.  Towards the Unification of Models for Concurrency , 1990, CAAP.

[30]  Ugo Montanari,et al.  An Algebraic View of Interleaving and Distributed Operational Semantics for CCS , 1989, Category Theory and Computer Science.

[31]  Ugo Montanari,et al.  Causal Streams: Tracing Causality in Distributed Systems , 1991 .

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

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

[34]  Rocco De Nicola,et al.  On the consistency of 'truly concurrent' operational and denotational semantics , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[35]  Ursula Goltz,et al.  Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract) , 1989, MFCS.

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

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

[38]  Gian Luigi Ferrari,et al.  On Causality Observed Incrementally, Finally , 1991, TAPSOFT, Vol.1.

[39]  Roberto Gorrieri,et al.  Atomic Refinement in Process Description Languages , 1991, MFCS.

[40]  Joost N. Kok,et al.  Uniform Abstraction, Atomicity and Contractions in the Comparative Semantics of Concurrent Prolog , 1988, FGCS.

[41]  Rocco De Nicola,et al.  Partial orderings descriptions and observations of nondeterministic concurrent processes , 1988, REX Workshop.

[42]  Jay L. Gischer,et al.  The Equational Theory of Pomsets , 1988, Theor. Comput. Sci..

[43]  Ugo Montanari,et al.  On the operational semantics of distributed concurrent systems , 1988 .

[44]  Gian Luigi Ferrari,et al.  Unifying models of concurrency , 1990 .

[45]  Ilaria Castellani,et al.  Concurrency and Atomicity , 1988, Theor. Comput. Sci..