Formal framework for a generic combination of a process algebra with an algebraic specification language: an overview

A method to combine any process algebra with an algebraic specification language: the π-calculus example

“…In [10], we introduced a formal framework as a basis for a generic combination. Algebraic specification languages are used to express data types, whereas process algebras specify dynamic aspects such as concurrency.…”

“…The four constructions are respectively called mob-par-compo, mob-pre, restriction, and MOB-CALL. The next step (3.b) is to extend the abstract grammar detailed in [10]. The additional syntactic rules enrich the BE-HAVIOUR part.…”

“…The initial work is presented in [10] as a framework, based on a formal kernel, for a generic combination of two languages (one process algebra and one algebraic specification language). The framework enables us to use algebraic terms as value passing for a given process algebra.…”

“…Furthermore, to strengthen the contribution of this work, a concrete illustration about an orders invoicing case study is detailed in [9]. In this paper, we especially focus on the addition of other languages; indeed in the initial work, we only consider a restricted number of process algebras: CCS, CSP, ACP, basic LOTOS.…”

“…

We introduce in [10] the formal foundations to make a generic combination of one process algebra and one algebraic specification language possible. Furthermore, to strengthen the contribution of this work, a concrete illustration about an orders invoicing case study is detailed in [9].

…”