G. Boudol. Notes on algebraic calculi of processes. In K. Apt (ed), Logics and models of concurrent systems, Volume F13 of Nato ASI Series, 261--303. Springer-Verlag, 1984.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....expression of control in a cell, i.e. how to express control abilities of a cell membrane P in a cell a(P ) Q] There are at least two different ways one could consider for expressing that control: 1. One could make use of synchronization primitives similar to the ones used in the Meije calculus [3], e.g. using a combination of triggering and restriction to implement a form of regulative superimposition [15] 2. Alternatively, one could exploit reflection ideas, namely, by considering each cell membrane P as a form of meta object in the cell construct a(P ) Q] In this report, we adopt a ....

G. Boudol : "Notes on algebraic calculi of processes" -- in Logics and Models of Concurrent Systems, K. Apt (ed.), NATO ASI Series F vol. 13, Springer Verlag, 1985.

....systems together with their synchronized product define a simple and elegant theoretical framework for specification and verification of systems of communicating processes. This framework is known as the Arnold Nivat approach [2, 21] A number of equivalent approaches as e.g. CCS [19] or Meije [5] and decision procedures for various logics (see e.g. 10] and [15] have provided grounds for the model checking (see e.g. 16] or [18] In spite of encouraging time complexity results in this area, the approaches based on finite transition systems encounter space complexity problems. To ....

G. Boudol. Notes of algebraic calculi of processes. In Logics and Models of Concurrent Systems, volume F--13 of NATO ASI series, pages 261--303. 1985.

....a question heretofore left unanswered concerning the relative expressive power of Turing machines and transition systems. Till now, the emphasis has been on showing that various kinds of process algebras, with transition system semantics, are capable of simulating Turing machines in lock step [Bou85,dS85,BBK87,BIM88,Dar90,Vaa93]. The other direction namely: What extensions are required of Turing machines so that they can simulate transitions systems is answered by our result. We also de ne an in nite hierarchy of successively ner equivalences for PTMs over nite interaction stream pre xes and show that the limit of ....

G. Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logics and Models of Concurrent Systems, pages 261-303. LNCS, Springer-Verlag, 1985. 15 Goldin et al.

....in a cell, i.e. how to express control abilities of a cell membrane P in a cell a(P ) Q] There are at least two different ways one could consider for expressing that control: 1. The first one would consist in making use of synchronization primitives similar to the ones used in the Meije calculus [3]. One could use, for instance, a combination of triggering and restriction to implement a form of regulative superimposition [15] 2. The second one would consist in exploiting reflection ideas, namely, by considering each cell membrane P as a form of meta object in the cell construct a(P ) Q] ....

G. Boudol : "Notes on algebraic calculi of processes" -- in Logics and Models of Concurrent Systems, K. Apt (ed.), NATO ASI Series F vol. 13, Springer Verlag, 1985.

....that is used. Using Plotkin s structural operational semantics (SOS) one can prove theorems for whole classes of languages at the same time. This is a much more efficient way to develop process theory, which in addition provides more insight. Examples of contributions along these lines are [33, 34, 14, 12, 10, 18, 11, 32, 13, 35, 2, 4, 19]. Milner had the idea that for a proper understanding of the basic issues concerning the behavior of concurrent systems it could be helpful to look for a simple language, with as few operators or combinators as possible, each of which embodies some distinct and intuitive idea, and which together ....

....of an effective graph we use here is essentially the same as the one proposed earlier by Baeten, Bergstra and Klop [6] and by Bloom, Istrail and Meyer [12] A less restrictive definition has been put forward by Darondeau [15] who requires the transition relation, as a set, to be recursive. Boudol [14] and De Simone [34] employ an even less restrictive definition of effectiveness: they only require that the transition relation, as a set, is recursively enumerable. If the machines, whose behavior is described by means of process graphs, are not in control of all their transitions, then one can ....

[Article contains additional citation context not shown here]

G. Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logics and Models of Concurrent Systems, pages 261--303. Springer-Verlag, 1985. NATO ASI Series F13.

....we define joej = n Gamma 1. Moreover, if joej i Gamma 1 , we will denote by oe(i) the i th state in the sequence. ut 2.2 Process Algebrae Process algebrae are syntaxes for the description of parallel and communicating processes. Here we give a brief presentation of CCS Meije process algebra, [1, 7], which is used by the JACK system for the description of reactive systems. For simplicity, we describe the subset of Meije that corresponds to the CCS process algebra, following R. Milner [31] Moreover, we adopt the syntax used in the Auto Mauto tools (see section 5) and restrict it to their ....

G Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logic and Models of Concurrent Systems. NATO ASI Series F13, 1985.

....if the designers are willing to stay within the range for which the congruence is appropriate. The congruence we propose in this thesis is good for all languages which are definable by well structured rules in a sense defined in Chapter 3, including most languages in the style of CCS and CSP [Mil80, Hoa85, Bou85, BV89]. 1.4.1 CCS and Program Equivalence CCS [Mil80, Mil83, Mil84, Mil88] is a simple core language for parallelism. The theory of CCS is usually developed with a particular semantics in mind, the elegant strong bisimulation (or simply bisimulation) semantics of Milner [Mil88, Mil83] and Park [Par81] ....

....semantics and their advantages and disadvantages, together with some methods for choosing a good semantic notion for various tasks and some other methods for creating and evaluating new notions as necessary. 13 1. 6 Related Work The theory of CCS and bisimulation has been extensively studied in [Bou85, GS85, HM80, Mil80, Mil81, Mil83, Mil84, Tho89]. Mil88] is perhaps the most recent and detailed survey of the theory of CCS. The connections between logic and bisimulation, in particular Hennessy Milner logic, are discussed in [HM85, Mil88, GS86] Other research in the comparison of various kinds of semantics for CCS and related languages can ....

[Article contains additional citation context not shown here]

G'erard Boudol. Notes on algebraic calculi of processes. Technical Report 395, INRIA Sophia-Antipolis, France, 1985.

....with persistence is a nontrivial one, and that the class of PTMs is isomorphic to Interactive Transition Systems, a very general class of effective transition systems. 1 Introduction Numerous researchers have examined the relationship between Turing machines and transition systems, including [Bou85, dS85, BBK87, BIM88, Dar90, Vaa93]. For example, Vaandrager [Vaa93] introduces the notion of effective process graph, a transition system with a countable number of states such that in each state the outgoing transitions can be computed. He also notes that such graphs, and indeed most process calculi that have been proposed in the ....

G. Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logics and Models of Concurrent Systems, pages 261--303. LNCS, Springer-Verlag, 1985.

....are used to build complex specifications from more elementary ones. The behavioral equivalences are used to study the relationships between descriptions of the same system at different levels of abstraction (e.g. specification and implementation) The process algebra we use is CCS MEIJE [8]. In CCS MEIJE a system consists of a set of communicating processes. Each process executes input and output actions, and synchronizes with other processes to carry out its activities. The CCS MEIJE syntax is based on a set of labels Act of atomic action names. Such names represent output actions ....

Boudol, G., "Notes on Algebraic Calculi of Processes," Notes on Algebraic Calculi of Processes, NATO ASI Series F13, 1985. Formal Description and Verification for an Integrity Policy Supporting Multiple Levels of Criticality

....to the inaction without interacting with their environment, and failures those which would deadlock in the same conditions. Now, we define roles as partial abstractions of the observable behavior of components, following the notion of abstraction in process algebras, as first established in [Bou87]. Definition 2.3 below is based on a Hiding operator ( N ) similar to that described in [Mil89] for CCS, but adapted to the calculus: Definition 2.2 (Hiding) Let A be an agent and x fn(A) then A= x = x) A j Q x2 x Ever(x) where Ever(x) x(y) Ever(x)jEver(y) ....

G. Boudol. Notes on algebraic calculi of processes. In Logics and Models of Concurrent Systems, number 13 in NATO ASI series. K.Apt, 1987.

....new possibilities of fine synchronous control over asynchronous communication, and we give an application example. Section 4 presents the semantic model and shows that it conservatively extends those of Esterel and CSP. In Section 5, we give a translation of CRP into the Meije process calculus [6]; this translation gives an operational view of the semantics and makes it possible to automatically verify properties of CRP programs using a verification system such as Auto [7] Section 6 discusses implementation issues. An appendix presents the formal semantics of Esterel with exec. For ....

....proof will be given in an extended version of this paper. 5 Translation into the Meije Process Calculus The cooperation semantics is not really constructive, in the sense that it does not tell how to execute programs. We now give an implementation of Pure CRP into Boudol s process calculus Meije [6,8]. We choose this calculus because it is able to handle together synchrony and asynchrony, which is not possible in less powerful calculi such as CCS. In addition to an implementation of CRP in a classical process calculus, the Meije translation provides us with an automatic program verification ....

G. Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logic and Models of Concurrent Systems. NATO ASI Series F13, 1985.

....characterised by a (disjunctive) modal transition system. 4 Figure 1: An Auto session (corresponding to AutoGraph objects in figure 6) 4 Auto The system Auto [7, 9, 33, 9] has been developed by the meije project at INRIA. Auto takes input from finite closed terms of the Meije process algebra [6]. The finiteness property is imposed by restricting the syntax of terms. Meije terms can also be obtained through the graphical editor AutoGraph (see below) Auto provides functionalities for computing automata from Meije terms, for reducing automata along various bisimulation equivalences, for ....

G. Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logics and Models of Concurrent Systems, NATO-ISA series F13, 1985.

....automata is required. A number of verification tools based on automata analysis have been elaborated during the last decade [2,7,4,12] offering various verification approaches for various process algebras. Our tool Auto was first developed for a clone of Milner s Sccs calculus [17] called Meije [3]. It has been generalised recently [15] to a large class of operationally specified algebras, generating the functions building automata from terms directly from the operational semantics rules of the operators; this has been the basis of a BasicLotos version of Auto, that has been connected to ....

G. Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logics and Models for Concurrent Systems. Springer-Verlag, 1985.

....of Spec that bear the same gate name, but convey different values. All reachability and deadlock properties map directly from Spec to Proj. Bisimulation equivalences are not directly preserved, but they are strongly related: the equivalences on the projection are abstraction bisimulations (see [2]) relative to the abstraction criteria defined by the event mapping (an abstract action is the set of all concrete actions, having the same gate name) The verification tools integrated in lite require Basic Lotos inputs. If one starts with a behaviour oriented specification, we have seen that ....

G. Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logics and Models of Concurrent Systems, NATO-ISA series F13, 1985.

....Statecharts graphical formalism is based on weak preemption and it contains an enter by history mechanism that has 3 Triggers are written await s do p end in the language. 18 the same flavor as suspension; however, strong preemption is not directly available. The piloting operator of Meije [9], the when primitive of the data flow synchronous languages Lustre [20] and Signal [19] are akin to suspension. Abortion makes no sense in data flow languages where there is no notion of death of a flow. A precise comparison between all these preemption mechanisms remains to be established. So ....

G. Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logic and Models of Concurrent Systems. NATO ASI Series F13, 1985.

....properties of the equivalences that allow for reducing subterms of operators before building any global automaton. This approach cuts off partially the space explosion that causes the well known limitation of such techniques. The current Auto system is using a subset of the Meije calculus ([Bo85]) as input language. To ensure that terms have finite representations, we use a two layers structure for input terms. In the lower layer, one can write recursive definitions directly encoding automata: recursive variables correspond to states and transitions are specified through action prefixing ....

....in the conclusion we describe a prototype system that uses this generic technique and discuss current work. 2 Process Calculi Process calculi are now a well accepted generic notion for designing a class of formalisms which share the same definitional principles : CCS [Mi80] SCCS [Mi83] MEIJE [Bo85], TCSP [Bro83] ACP [BK86] BasicLOTOS [BB88] to name a few. We shall assume reader s acquaintance with at least one of these languages and its definitional mechanisms. Process calculi are based on two main types : actions and processes. Operators take actions and processes arguments into ....

[Article contains additional citation context not shown here]

G. Boudol, "Notes on Algebraic Calculi of Processes", Logics and Models of Concurrent Systems, NATO ASI series F13, K.Apt ed., 1985

....is, they satisfy the identity SC(Q) Q. For example, the CCS like processes considered by Aceto Hennessy in [1] and Hennessy in [8] are all self synchronized in this way. For such processes, we then have Q 1 j Q 2 = SC(Q 1 jj Q 2 ) Similar identities hold for SCCS style [11] and Meijestyle [3] synchronized parallel composition. The intuitive simplicity of self synchronization is reflected in various algebraic identities such as SS ha;bi c (P Q) SS ha;bi c (P ) SS ha;bi c (Q) SS ha;bi c (a:P ) a: SS ha;bi c (P ) SS ha;bi c (Pna) Pna Here a: is the prefixing operator and ....

G. Boudol. Notes on algebraic calculi of processes. Technical report, INRIA, Sophia-Antipolis, 1985.

....However, thanks to the possibility of other communication functions, aprACPF is more flexible, and potentially more expressive. In Section 2 I propose a definition of what it means for one language to be expressible in another. This definition agrees with the notion of a translation from Boudol [4]. I also introduce (annotated) signatures to determine the syntax of a language and review the method of structural operational semantics for interpreting the closed expressions in a language as (equivalence classes of) process graphs. In Section 3 I introduce the language aprACPF , and indicate ....

....in the other operators of aprACPF , as I will show in Section 3.5. The resulting language extends CCS in only one essential way, namely through the general communication format. This generality greatly enhances the expressiveness of the language. 3. 3 Meije Like CCS, also Boudol s language Meije [1, 4, 13] can be regarded as (a sublanguage of) an instantiation of aprACP with functional renaming. Meije is parametrised with a set A of atomic actions and a set S of signals. The set Act of actions is a commutative monoid, namely the free commutative product of the free commutative moniod generated by ....

G. Boudol (1985): Notes on algebraic calculi of processes. In K. Apt, editor: Logics and Models of Concurrent Systems, Springer-Verlag, pp. 261--303. NATO ASI Series F13.

....related to the states: there are passive entities (i.e. state variables) and active entities (i. e, those entities activated by state changes and which execute operations) Variables in the original specification are mapped onto processes in the process algebra specification language CCS Meije [4, 20]. In CCS Meije a system consists of a set of communicating processes; each process executes input or output actions (denoted by the suffix or the suffix respectively) and synchronizes with other processes to execute its activities. A process corresponding to a variable has a different ....

Boudol, G Notes on Algebraic Calculi of Processes. Notes on Algebraic Calculi of Processes, NATO ASI Series F13, 1985.

....build complex specifications from more elementary ones. The behavioral equivalences are used to study the relationships between descriptions of the same system at different levels of abstraction (e.g. specification and implementation) The process algebra used in the pilot project was CCS MEIJE [9]. In CCS MEIJE a system consists of a set of communicating processes. Each process executes input and output actions, and synchronizes with other processes to execute its activities. The CCS MEIJE syntax is based on a set of labels Act as atomic action names. Such names represent output actions if ....

Boudol, G., "Notes on Algebraic Calculi of Processes," Notes on Algebraic Calculi of Processes, NATO ASI Series F13, 1985.

....: 80 B.2. 5 Miscellaneous Commands : 81 C Studying Peterson s Mutual Exclusion Algorithm Using TPWB 1 Introduction Since their introduction in the early 1980 s process algebra formalisms [Mil80, BK84, Bou85, Hoa85] have become increasingly popular within the theoretical computer science community. Perhaps the chief reason for this is that the algebras enable elegant specifications of concurrent systems that abstract from much of the apparent complexity: a specification of a system of concurrently ....

G. Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logics and Models of Concurrent Systems, pages 261--303. Springer Verlag, 1985.

No context found.

G. Boudol. Notes on algebraic calculi of processes. In K. Apt (ed), Logics and models of concurrent systems, Volume F13 of Nato ASI Series, 261--303. Springer-Verlag, 1984.

No context found.

G. Boudol. Notes on algebraic calculi of processes. In Apt [Apt84], 261--303.

No context found.

G. Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logics and Models of Concurrent Systems, pages 261-303. LNCS, Springer-Verlag, 1985.

No context found.

Boudol, G. (1985). Notes on algebraic calculi of processes, in Logics and Models of Concurrent Systems, Springer.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC