Academia.eduAcademia.edu

Outline

Title
Abstract
Heterogeneous Algebra and Abstract Data Types
References
All Topics
Computer Science
Theoretical Computer Science

Process Algebra as Abstract Data Types

Profile image of Yun ShangYun Shang

2010, arXiv (Cornell University)

Abstract

In this paper we introduced an algebraic semantics for process algebra in form of abstract data types. For that purpose, we developed a particular type of Σ algebra, the seed algebra, which describes exactly the behavior of a process within a labeled transition system. We have shown the possibility of characterizing the bisimulation of two processes with the isomorphism of their corresponding seed algebras. We pointed out that the traditional concept of isomorphism of algebra does not apply here, because there is even no one-one correspondence between the elements of two seed algebras. The lack of this one-one correspondence comes from the non-deterministic choice of transitions of a process. We introduce a technique of hidden operations to mask unwanted details of elements of a seed algebra, which only reflect non-determinism or other implicit control mechanism of process transition. Elements of a seed algebra are considered as indistinguishable if they show the same behavior after these unwanted details are masked. Each class of indistinguishable elements is called a non-hidden closure. We proved that bisimulation of two processes is equivalent to isomorphism of non-hidden closures of two seed algebras representing these two processes. We call this kind of isomorphism a deep isomorphism. We get different models of seed algebra by specifying different axiom systems for the same signature. Each model corresponds to a different kind of bisimulation. By proving the relations between these models we also established relations between 10 different bisimulations, which form a acyclic directed graph.

Related papers

A Graph Model for Basic Process Algebra
Uzma Khadim

2005

View PDFchevron_right
A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
Luca Aceto

Mathematical Structures in Computer Science, 1998

Fokkink and Zantema ((1994) Computer Journal 37:259-267) have shown that bisimulation equivalence has a finite equational axiomatization over the language of Basic Process Algebra with the binary Kleene star operation (BPA * ). In the light of this positive result on the mathematical tractability of bisimulation equivalence over BPA * , a natural question to ask is whether any other (pre)congruence relation in van Glabbeek's linear time/branching time spectrum is finitely (in)equationally axiomatizable over it. In this paper, we prove that, unlike bisimulation equivalence, none of the preorders and equivalences in van Glabbeek's linear time/branching time spectrum, whose discriminating power lies in between that of ready simulation and that of completed traces, has a finite equational axiomatization. This we achieve by exhibiting a family of (in)equivalences that holds in ready simulation semantics, the finest semantics that we consider, whose instances cannot all be proven by means of any finite set of (in)equations that is sound in completed trace semantics, which is the coarsest semantics that is appropriate for the language BPA * . To this end, for every finite collection of (in)equations that are sound in completed trace semantics, we build a model in which some of the (in)equivalences of the family under consideration fail. The construction of the model mimics the one used by Conway ((1971) Regular Algebra and Finite Machines, page 105) in his proof of a result, originally due to Redko, to the effect that infinitely many equations are needed to axiomatize equality of regular expressions.

View PDFchevron_right
Priority and abstraction in process algebra
Ivan Christoff Christoff

Foundation of Software …, 1994

More than 15 years ago, Cleaveland and Hennessy proposed an extension of the process algebra CCS in which some actions may take priority over others. The theory was equipped with a behavioral congruence based on strong bisimulation.

View PDFchevron_right
Some finite-graph models for process algebra
Jan Friso Groote

Lecture Notes in Computer Science, 1991

View PDFchevron_right
Process theory based on bisimulation semantics
Jan Klop

1989

In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics are covered: (i) specification of processes using finite systems of equations over the syntax of process algebra; (ii) inference systems which are complete for proving the equivalence of regular (finite state) processes; (iii) variations of the bisimulation model.

View PDFchevron_right
Towards Action-Refinement in Process Algebras
Luca Aceto

Information and Computation, 1993

ory of concurrency; the symbol ; represents We present a simple process algebra which supports a form of refinement of an action by a process and address the question of a n appropriate equivalence relation for it. The main result of the paper is that an adequate equivalence can be defined in a very intuitive manner and moreover can be axiomatized in much the same way as the standard behavioural equivalences.

View PDFchevron_right
Interpreted Systems Semantics for Process Algebra with Identity Annotations
Mohammadreza Mousavi

Process algebras have been developed as formalisms for specifying the behavioral aspects of protocols. Interpreted systems have been proposed as a semantic model for multi-agent communication. In this paper, we connect these two formalisms by defining an interpreted systems semantics for a generic process algebraic formalism. This allows us to translate and compare the vast body of knowledge and results for each of the two formalisms to the other and perform epistemic reasoning, e.g., using model-checking tools for interpreted systems, on process algebraic specifications. Based on our translation we formulate and prove some results about the interpreted systems generated by process algebraic specifications.

View PDFchevron_right
Generic process algebra: A programming challenge
Luis Barbosa

2006

Emerging interaction paradigms, such as service-oriented computing, and new technological challenges, such as exogenous component coordination, suggest new roles and application areas for process algebras. This, however, entails the need for more generic and adaptable approaches to their design. For example, some applications may require similar programming constructs coexisting with different interaction disciplines. In such a context, this paper pursues a research programme on a coinductive rephrasal of classic process algebra, proposing a clear separation between structural aspects and interaction disciplines. A particular emphasis is put on the study of interruption combinators defined by natural co-recursion. The paper also illustrates the verification of their properties in an equational and pointfree reasoning style as well as their direct encoding in Haskell.

View PDFchevron_right
Finite equational bases in process algebra: Results and open questions
Wan Fokkink

Processes, Terms and Cycles: Steps on the Road to Infinity, 2005

Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these semantics in the setting of the basic process algebra BCCSP, and tried to give finite complete axiomatizations for them. Obtaining such axiomatizations in concurrency theory often turns out to be difficult, even in the setting of simple languages like BCCSP. This has raised a host of open questions that have been the subject of intensive research in recent years. Most of these questions have been settled over BCCSP, either positively by giving a finite complete axiomatization, or negatively by proving that such an axiomatization does not exist. Still some open questions remain. This paper reports on these results, and on the state-of-the-art in axiomatizations for richer process algebras with constructs like sequential and parallel composition.

View PDFchevron_right
On the Formalization of Architectural Types With Process Algebras
Paolo Ciancarini

Proceedings of the 8th …, 2000

View PDFchevron_right

References (56)

  1. E. Astesiano, M. Bidoit, H. Kirchner, B. Krieg-Brückner, P. Mosses, D. Sanella, A.Tarlecki, CASL: The Common Algebraic Specification Language, TCS 286(2)(2002) 153-196.
  2. E.Astesiano, M. Broy, G..Reggio, Algebraic Specification of Concurrent Systems, In IFIP WG 1.3 Book on Algebraic Foundations of System Specification. (E. Astesiano, B. Krieg-Brückner and H.-J. Kreowski editors), Berlin, Springer Verlag, 1999.
  3. K.R. Apt, N. Frances, W.P. de Roever, A Proof System for Communicating Sequential Processes, ACM TOPLAS 2(3)(1980) 350-385.
  4. M. Abadi, A. Gordon, A Calculus for Cryptographic Protocols: The Spi Calculas, Information and Computation 148(1999) 1-70.
  5. E. Astesiano, A.Giovini, G. Reggio, Processes as Data Types: Observational Semantics and Logic (Extended Abstract), LNCS vol. 469, 1990, pp. 1-20.
  6. E.Astesiano, G.F.Mascari, G..Reggio, M.Wirsing, On the parametrized Specification of Concurrent Systems, Proc. TAPSOFT'85, LNCS vol. 185, 1985, pp.343-358.
  7. K.R. Apt, Formal Justification of a Proof System for Communicating Sequential Processes, JACM 30(1)(1983) 197-216.
  8. E. Astesiano, G. Reggio, Algebraic Specification of Concurrency, In M.Bidoit and C. Choppy, editors, Recent Trends in Data Type Specification, LNCS vol. 655, 1992, pp.1-39.
  9. H. Bekic, Towards a Mathematical Theory of Processes, in C.B.Jones (Ed.) Programming Languages and their Definition -Hans Bekic (1936-1982), 1984, pp. 168-206.
  10. S.D.Brookes, C.A.R., Hoare, A.W.Roscoe, A Theory of Communicating Sequential Processes, JACM 31(3)(1984) 560-599.
  11. J.Bergstra, J.W. Klop, The Algebra of Recursively Defined Processes and the Algebra of Regular Processes, ICALP'84, LNCS vol. 172, 1984, pp.82-94.
  12. J.Bergstra, J.W. Klop, Process Algebra for Synchronous Communication, Information and Control 60(1-3)(1984) 109-137.
  13. S.D.Brookes, A.W.Roscoe, An Improved Failures Model for CSP, Seminar on Concurrency, LNCS vol. 197, 1985.
  14. S.D.Brookes, Communicating Parallel Processes, Symposium in Celebration of the Work of C.A.R. Hoare, Oxford University, MacMillan, 2000.
  15. M.Broy, P.Pepper, M.Wirsing, On the Algebraic Definition of Programming Languages, TUM-I8204, 1982.
  16. M.Broy, M.Wirsing, Programming Languages as Abstract Data Types, In M.Dauchet (Ed.), 5 me Coll. Sur les Arbres en Algebre et Programmation, 1980, pp.160-177.
  17. M.Broy, M.Wirsing, Partial Recursive Functions and Abstract Data Types, EATCS Bull. 11, 1980, pp.34-41.
  18. M.Broy, M.Wirsing, On the Algebraic Specification of nondeterministic programming languages, E. Astesiano, C.Boehm (eds.), 6 th CAAP, LNCS vol. 112, 1981, pp.162-179.
  19. M.Broy, M.Wirsing, Partial Abstract Data Types, Acta Informatica 18 (1)(1982) 47-64.
  20. L.Cardelli, A.D.Gordon, Mobile Ambients, Electronic Notes Theoretical Computer Science, 10, 1997.
  21. J.C.Cleaveland, Programming Languages Considered as Abstract Data Types. ACM, 1980.
  22. W. Dosch, G. Mascari and M. Wirsing. On the algebraic specification of databases. Proceedings of the 8th international conference on very large data bases, 1982.
  23. J. Fiadeiro, A.Lopes, L.Bocchi, Algebraic Semantics of Service Component Modules, J. Fiadeiro and P. Schobbens(Eds.), WADT 2006, LNCS vol. 4409, 2007, pp. 37-55.
  24. J. Guttag, J Horning, The Algebraic Specification of Abstract Data Types, Acta Information. 10(1978)27-52.
  25. S.Gilmore, J.Hillston, The PEPA Workbench, A Tool to Support a Process Algebra-based Approach to Performance Modelling, Computer Performance Modelling 1994, 353-368.
  26. A. Gimblett, M. Roggenbach, B. Schlingloff, Towards a Formal Specification of an Electronic Payment System in CSP-CASL, In J. Fiadeiro, P. Mosses and F. Orejas(Eds.) WADT 2004, LNCS, vol. 3423, 2005, pp. 61-78.
  27. J.Goguen, J. Thatcher, E. Wagner, J. Wright, Abstract Data Types as Initial Algebras and the Correctness of Data Representation, In Proceedings of Conference on Computer Graphics, Pattern Recognition and Data Structures, 1975, pp. 89-93.
  28. J. Goguen, J. Thatcher, E. Wagner, An Initial Algebraic Approach to the Specification, Correctness and Implementation of Abstract Data Types, Currend Trends in Progr. Meth. 4(1978) 80-149.
  29. J.V.Guttag, The Specification and Application to Programming of Abstract Data Types, Ph.D. Thesis, Univ. Toronto, 1975.
  30. C.A.R., Hoare, Communicating Sequential Processes, CACM 21(8)(1978) 666-677.
  31. C.A.R., Hoare, A Model for Communicating Sequential Processes, in McKeag and McNaughton (Eds.): On the Construction of Programs, Cambridge Univ. Press, 1980, pp.229-254.
  32. C.A.R. Hoare, A Calculus of total Correctness of Communicating Sequential Processes, Science of Computer Programming, 1(1)(1981) 49-72.
  33. Y. Isobe, A complete axiomatic semantics for the CSP stable-failures model, CONCUR, 2006.
  34. P.Lescanne, Modèls non-deterministe de Types Abstraits, RAIRO Informatique Theorique 16, 1982, pp.225-244.
  35. A. Lopes, J. Fiadeiro, Algebraic Semantics of Design Abstractions for Context-Awareness. In J. Fiadeiro, P. Mosses and F. Orejas(Eds.) WADT 2004, LNCS, vol. 3423, 2005, pp. 79-83.
  36. H.Lin, Symbolic Transition Graph with Assignment, Concur 1996, pp.50-65.
  37. R. Lu, L. Li, Y. Shang, X. Li, On Classical and Quantum Process Algebra as Abstract Data Types, Festschrift Dedicated to Bernd Krieg-Brückner on the Occasion of his 60th Birthday, Feb. 2009, DFKI Bremen.
  38. R. Lu, Algebraic Semantics of Programs with Dynamic Structure, Science in China, A, 30 (1)(1987) 32-44.
  39. R.Milner, A Calculus of Communicating Systems, LNCS, vol. 92, 1980.
  40. R.Milner, Communication and Concurrency, Prentice Hall, 1989.
  41. R.Milner, J.Parrow, D.Walker, A Calculus of Mobile Processes, Parts I and II, Information and Computation, 100(1992) 1-77. π
  42. J.Parrow, An Introduction to the -Calculus, Bergstra, Ponse and Smolka (Eds.), Handbook of Process Algebra, 1999.
  43. G. Plotkin, A structural approach to operational semantics, Technical Report DAIMI, FN-19, Aarhus University, Dept. of Computer Science, 1981.
  44. D.T.Sanella, A.Tarlecki, On Observational Equivalence and Algebraic Specifications, J.of Comp. Sys. and Sciences, 34(1987) 150-178.
  45. D.T.Sanella, M.Wirsing, A Kernel Language for Algebraic Specification and Implementation, LNCS, vol. 158, 1983, pp. 413-427.
  46. D.Sangiorgi, D. Walker, The pi-calculus: a theory of mobile processes, Cambrige University Press. 2003.
  47. M.Wirsing, Algebraic Specification, MIP-8914, 1989.
  48. M.Wirsing, Algebraic Specification, Handbook of Theoretical Computer Science (II), 1990, pp. 675-788.
  49. M.Wirsing, M. Wirsing, P.Pepper, H.Partsch, W.Dosch, M.Broy, On Heirarchies of Abstract Data Type, Acta Informatica 20(1983) 1-33.
  50. M. Ying, Topology in Process Calculus, Approximate Correctness and Infinite Evolution of Concurrent Programs, Springer, 2001.
  51. M. Ying, Bisimulation indexes and their applications, Theoretical Computer Science 275(1)(2002) 1-68.
  52. M. Ying, Pi-calculus with noisy channels, Acta Informatica 41(9)(2005) 525-593.
  53. C. Zhou, C.A.R. Hoare, Partial Correctness of Communicating Sequential Processes, Proc.
  54. nd Int. Conf. Distributed Computing Systems, 1981.
  55. S. Zilles. Algebraic Specification of data types. Computation Structures Group Memo 119, Lab for Computer Science, MIT, 1974. call (compor (x, y), tp) = compor (x, call (y, tp)) call (rp, tp) = tp input (i-proc (c, u, p), c, x) = subst (p, u, x) output (o-proc (c, x, p), c, x) = p input (compol(p, q), c, x) = compol(input(p, c, x), q) input (compor(p, q), c, x) = compor(p, input(q, c, x)) output (compol(p, q), c, x) = compol(output(p, c, x), q) output (compor(p, q), c, x) = compor(p, output(q, c, x)) h-act (tau (p)) = p h-act (compo (i-proc (x, u, p), o-proc (x, v, q
  56. = compo (subst (p, u, v), q) h-act (compol (p, q)) = compol (h-act (p), q) h-act (compor (p, q)) = compor (p, h-act (q)) tleft (tconf (sum (p, q), tr)) = tconf (p, tr) tright (tconf (sum (p, q), tr)) = tconf (q, tr) tleft (tconf (compo (p, q), tr)) = tconf (compol (p, q), tr) tright (tconf (compo (p, q), tr)) = tconf (compor (p, q), tr) tleft (tconf (compol (p, q), tr)) = tconf (compol (left (p), q), tr) tright (tconf (compol (p, q), tr)) = tconf (compol (right (p), q), tr) tleft (tconf (compor (p, q), tr)) = tconf (compor (p, left (q)), tr) tright (tconf (compor (p, q), tr)) = tconf (compor (p, right (q)), tr) tback (tconf (p, tr)) = tconf (back (p), tr) left (compo (p, q)) = compol (p, q) right (compo (p, q)) = compor (p, q) left (compol (p, q)) = compol (left (p), q) right (compol (p, q)) = compol (right (p), q) left (compor (p, q)) = compor (p, left (q)) right (compor (p, q)) = compor (p, right (q)) back (i-proc (x, u, p)) = i-proc (x, u, p) back (o-proc (x, u, p)) = o-proc (x, u, p) back (tau (p)) = tau (p) back (nil) = nil back (sum (p, q)) = sum (p, q) back (compo (p, q)) = compo (p, q) back (compol (p, q)) = compo (back (p), back (q)) back (compor (p, q)) = compo (back (p), back (q))

Related papers

A complete axiomatisation of branching bisimulation for process algebras with alternative quantification over data
Jan Friso Groote

1998

We define a class of process algebras with silent step and a generalised operation $\gsum{}$ that allows explicit treatment of \emph{alternative quantification} over data, and we investigate the specific subclass formed by the algebras of finite processes modulo rooted branching bisimulation. We give a ground complete axiomatisation for those branching bisimulation algebras of which the data part has built-in equality and Skolem functions.

View PDFchevron_right
Algebra of communicating processes with abstraction
Jan Klop

Theoretical Computer Science, 1985

We present an axiom system ACP, for communicating processes with silent actions ('z-steps'). The system is an extension of ACP, Algebra of Communicating Processes, with Milner's z-laws and an explicit abstraction operator. By means of a model of finite acyclic process graphs for ACP, syntactic properties such as consistency and conservativity over ACP are proved. Furthermore, the Expansion Theorem for ACP is shown to carry over to ACP~. Finally, termination of rewriting terms according to the ACP~ axioms is proved using the method of recursive path orderings.

View PDFchevron_right
Undecidability and completeness results for process algebras with alternative quantification over data
Jan Friso Groote

1998

We define a class of process algebras with a generalised operation $\sum$ that allows explicit treatment of \emph{alternative quantification} over data, and investigate the specific subclass formed by the algebras of finite processes modulo strong bisimulation.

View PDFchevron_right
Weak sequential composition in process algebras
Arend Rensink

CONCUR'94: Concurrency Theory, 1994

In this paper we study a special operator for sequential composition, which is de ned relative to a dependency relation over the actions of a given system. The idea is that actions which are not dependent (intuitively because they share no common resources) do not have to wait for one another to proceed, even if they are composed sequentially. Such a notion has been studied before in a linear-time setting, but until recently there has been no systematic investigation in the context of process algebras. We give a structural operational semantics for a process algebraic language containing such a sequential composition operator, which shows some interesting interplay with choice. We give a complete axiomatisation of strong bisimilarity and we show consistency of the operational semantics with an event-based denotational semantics developed recently by the second author. The axiom system allows to derive the communication closed layers law, which in the linear time setting has been shown to be a very useful instrument in correctness preserving transformations. We conclude with a couple of examples.

View PDFchevron_right
A Non-SOS Operational Semantics for a Process Algebra
Marek Zaremba

Information Processing Letters, 1998

This paper proposes an operational semantics for MAPA (Multi-Action Process Algebra). This semantics has been designed to support the run-time distribution of programs described by MAPA terms. The main contribution of this paper is the proof of equivalence by weak bisimulation of this semantics with the SOS semantics.

View PDFchevron_right

Related topics

  • Mathematics
  • Computer Science
  • Process Algebra
  • Abstract Data Type
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved