J. Baeten and R. van Glabbeek. Another look at abstraction in process algebra. In Proceedings of the 14th International Colloquium on Automata, Languages and Programming (ICALP'87), volume 267 of LNCS, pages 84--94. Springer-Verlag, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....we extend the results in [15] to a setting with the unobservable action . More precisely, we consider four versions of bisimulation equivalence that, to different degrees, abstract away from the internal evolution of processes (viz. delay equivalence [27] weak equivalence [28] j equivalence [5] and branching equivalence [19] and provide complete equational axiomatizations for each of the congruences they induce over the language (BCCS) A ) of open terms over the signature of T(BCCS) A ) The axiomatizations we present are obtained by extending the axiom system from [15] with ....

....P is finite. A fundamental semantic equivalence in the study of reactive systems is bisimulation equivalence [30, 28] In this study, we shall consider four versions of this notion which, to different degrees, abstract away from invisible actions, viz. branching equivalence [19] j equivalence [5], delay equivalence [27] and weak equivalence [28] These we now proceed to define for the sake of completeness. The interested reader is referred to the aforementioned references and to [20, 29, 18] for discussion and motivation. Definition 2.3 (Branching Equivalence) A binary relation B over ....

J. Baeten and R. v. Glabbeek, Another look at abstraction in process algebra, in Proceedings 14 ICALP, Karlsruhe, T. Ottmann, ed., vol. 267 of Lecture Notes in Computer Science, Springer-Verlag, July 1987, pp. 84--94.

....that the main concerns are the introduction and examination of various programming constructs. New constructs are introduced equationally, rather than operationally, and it is not always clear that there is an appropriate and straightforward operational semantics. Some work in this area includes [AB84, BB88, BV89, BvG87, BK82, BK84b, BK84a, BK85, BT86, vGR89, vGV87, dBBKM82, dMOZ86, dBZ83]. The field of true concurrency works from the hypothesis that there is an important difference between parallelism and interleaving. In CCS and related areas, if a and b are atomic actions, then there is no significant differ14 ence between running a and b in parallel and nondeterministically ....

J. C. M. Baeten and Rob van Glabbeek. Another look at abstraction in process algebra. In Ottmann [Ott87], pages 84--94.

.... that deals with abstraction, proposed by van Glabbeek and Weijland in [18] is branching bisimulation equivalence (see also [19] Branching bisimulation equivalence is a refinement of semantics such as observation equivalence, delay bisimulation equivalence [21] and # bisimulation equivalence [3], and can be considered an improvement of these because it fully respects the branching structure of processes. In the words of [19] in two [branching] bisimilar processes every computation [sequence of steps] 2 J.A. Bergstra, A. Ponse, and M.B. van der Zwaag in the one process corresponds to ....

J.C.M. Baeten and R.J. van Glabbeek. Another look at abstraction in process algebra (extended abstract). In Th. Ottmann, editor, Proceedings 14 th International Colloquium on Automata, Languages and Programming (ICALP'87), Karlsruhe, volume 267 of Lecture Notes in Computer Science, pages 84--94. Springer-Verlag, 1987.

....fact, they are equivalent for finite processes, The two models are different in the notion of divergence when infinite processes are considered. In [BR84] an improved failures model was given which is isomorphic to the AT S of Hennessy s. 16 with two party rendezvous. Baeten and Glabeek s ACP j [BvG87] is a variation of ACP that further simplifies the process composition operation and makes hiding internal details of a sub system particularly convenient. Communication actions can be abstracted into the internal action j, which can be further abstracted according rules such as a; j; x = a; x. ....

....rooted directed graph with edges labeled by event names. Parallel composition of process expressions is modeled by a function taking graphs to graphs, and equivalence among process expressions (equality in the algebra) can be checked by a constructing a bisimulation equivalence relation on graphs [BvG87] This bisimulation equivalence can be checked in polynomial time [KS90] Equivalence and preorder checking. The equivalence and preorder relations described previously are often used to verify that the behavior of an implementation of a system is equivalent to (or more limited than) the ....

[Article contains additional citation context not shown here]

J. C. M. Baeten and R. J. van Glabeek. Another look at abstraction in process algebra. In Proceedings of the 14th International Colloquium on Automata, Languages, and Programming (ICALP), pages 84--94, Karlsruhe, Germany, July 1987. Published as Springer-Verlag Lecture Notes in Computer Science 267.

.... equivalences [17, 18] In the field of process algebra, four so called weak equivalences Supported by a grant from The Nuffield Foundation 1 have been developed to abstract away from internal machine behavior, represented by a silent step : observation [27] branching [22] delay [26] and j [3]. This article focuses on branching bisimulation equivalence, in which one can abstract away from an action if its execution does not implicate the loss of possible behavior. In recent years, this equivalence has been used in a sizable number of verifications in process algebra. See [20] for a ....

J.C.M. Baeten and R.J. van Glabbeek. Another look at abstraction in process algebra. In T. Ottmann, ed., Proceedings 14th Colloquium on Automata, Languages and Programming (ICALP'87), Karlsruhe, LNCS 267, pp. 84--94. Springer, 1987.

....we extend the results in [15] to a setting with the unobservable action . More precisely, we consider four versions of bisimulation equivalence that, to different degrees, abstract away from the internal evolution of processes (viz. delay equivalence [27] weak equivalence [28] j equivalence [5] and branching equivalence [19] and provide complete equational axiomatizations for each of the congruences they induce over the language (BCCS) p (A ) of open terms over the signature of T(BCCS) p (A ) The axiomatizations we present are obtained by extending the axiom system from [15] ....

....P is finite. A fundamental semantic equivalence in the study of reactive systems is bisimulation equivalence [30, 28] In this study, we shall consider four versions of this notion which, to different degrees, abstract away from invisible actions, viz. branching equivalence [19] j equivalence [5], delay equivalence [27] and weak equivalence [28] These we now proceed to define for the sake of completeness. The interested reader is referred to the aforementioned references and to [20, 29, 18] for discussion and motivation. Definition 2.3 (Branching Equivalence) A binary relation B over ....

J. Baeten and R. v. Glabbeek, Another look at abstraction in process algebra, in Proceedings 14 th ICALP, Karlsruhe, T. Ottmann, ed., vol. 267 of Lecture Notes in Computer Science, Springer-Verlag, July 1987, pp. 84--94.

.... can be distinguished by a wide range of behavioral equivalences [17, 18] In the field of process algebra, four so called weak equivalences have been developed to abstract away from internal machine behavior, represented by a silent step : observation [27] branching [22] delay [26] and j [3]. This article focuses on branching bisimulation equivalence, in which one can abstract away from an action if its execution does not implicate the loss of possible behavior. In recent years, this equivalence has been used in a sizable number of verifications in process algebra. See [20] for a ....

J.C.M. Baeten and R.J. van Glabbeek. Another look at abstraction in process algebra. In T. Ottmann, ed., Proceedings 14th Colloquium on Automata, Languages and Programming (ICALP'87), Karlsruhe, LNCS 267, pp. 84--94. Springer, 1987.

....example using this feature can be seen in Section 3.2. Pal can perform process graph simplifications based on any of several equivalence relations, including observation equivalence [Mil80] Hennessy s testing equivalence and may must equivalence [Hen88] ACP or ACP j bisimulation equivalence [BvG87]. The behavior analysis package can perform comparisons of process graphs according to different equivalence preorder relations. It also includes a general hierarchical tracing facility that can be used to trace a set of processes which exhibit a sequence of observed actions, or it can be used to ....

J. C. M. Baeten and R. J. van Glabeek. Another look at abstraction in process algebra. In Proceedings of the 14th International Colloquium on Automata, Languages, and Programming (ICALP), pages 84-- 94, Karlsruhe, Germany, July 1987. Published as Springer-Verlag Lecture Notes in Computer Science 267.

.... are sufficient in order to describe the relation between prefix iteration and the silent step in this context: x = x x a Delta a ( Delta a (x y) x) a Delta a (x y) The first axiom is based on Koomen s Fair Abstraction Rule as formulated in Baeten and Van Glabbeek [5]. The second axiom is, to our knowledge, new. We prove that these two axioms, together with the standard axioms for BPA ffiffl , make a complete finite equational axiomatization for BPA ffiffl extended with prefix iteration, with respect to rooted branching bisimulation equivalence. Van Glabbeek ....

J.C.M. Baeten and R.J. van Glabbeek. Another look at abstraction in process algebra. In Proceedings 14th International Colloquium on Automata, Languages and Programming (ICALP'87), Karlsruhe (1987), Th. Ottmann, ed., Lecture Notes in Computer Science 267, Springer, pp. 84--94.

....we extend the results in [14] to a setting with the unobservable action . More precisely, we consider four versions of bisimulation equivalence that, to different degrees, abstract away from the internal evolution of processes (viz. delay equivalence [28] weak equivalence [29] j equivalence [5] and branching equivalence [20] and provide complete equational axiomatizations for each of the congruences they induce over the language (BCCS) p (A ) of open terms over the signature of T(BCCS) p (A ) The axiomatizations we present are obtained by extending the axiom system from ....

....of P is finite. A fundamental semantic equivalence in the study of reactive systems is bisimulation equivalence [31, 29] In this study, we shall consider four versions of this notion which, to different degrees, abstract away from invisible actions, viz. branching equivalence [20] j equivalence [5], delay equivalence [28] and weak equivalence [29] These we now proceed to define for the sake of completeness. The interested reader is referred to the aforementioned references and to [21, 30, 18] for discussion and motivation. Definition 2.3 (Branching Equivalence) A binary relation B over ....

J. Baeten and R. v. Glabbeek, Another look at abstraction in process algebra, in Proceedings 14 th ICALP, Karlsruhe, T. Ottmann, ed., LNCS 267, Springer, 1987, pp. 84--94.

....what we will mean when we say that a reachability analysis employs algebraic structure. ACP j. Bergstra and Klop s Algebra of Communicating Processes (ACP) BK84] is a simple and general representation for finite state asynchronous systems with two party rendezvous. Baeten and Glabeek s ACP j [BvG87] is a variation on ACP that further simplifies the process composition operation and makes hiding internal details of a subsystem particularly convenient. These considerations led us to choose ACP j as an appropriate process algebra for investigation of compositional reachability analysis. Space ....

....internal details of a subsystem particularly convenient. These considerations led us to choose ACP j as an appropriate process algebra for investigation of compositional reachability analysis. Space permits only a superficial description of ACP j here; the interested reader should refer to [BvG87] and [BK84] In ACP j, a description of a single process is formed by connecting event symbols together with the sequencing operator ; and the choice operator . Processes interact in rendezvous fashion by matching events. We adopt the notational convention that an uncomplemented symbol a ....

[Article contains additional citation context not shown here]

J. C. M. Baeten and R. J. van Glabeek. Another look at abstraction in process algebra. In Proceedings of the 14th InternationalColloqium on Automata, Languages, and Programming (ICALP), pages 84--94, Karlsruhe, Germany, July 1987.

.... Complete Axiomatization for Prefix Iteration in Branching Bisimulation Wan Fokkink Utrecht University, Department of Philosophy Heidelberglaan 8, 3584 CS Utrecht, The Netherlands fokkink phil.ruu.nl Abstract This paper studies the interaction of prefix iteration x with the silent step in the setting of branching bisimulation. That is, we present a finite equational axiomatization for Basic Process Algebra with deadlock, empty ....

.... It turns out that two axioms are sufficient in order to describe the relation between prefix iteration and the silent step: x = x x a Delta a ( Delta a (x y) x) a Delta a (x y) The first axiom is based on Koomen s Fair Abstraction Rule as formulated in Baeten and van Glabbeek (1987). The second axiom is, to our knowledge, new. Acknowledgements. This research was initiated by discussions with Luca Aceto. 2 Preliminaries 2.1 The syntax and semantics Assume an alphabet A of atomic actions, and three special constants ffi and ffl and , which represent deadlock and empty ....

[Article contains additional citation context not shown here]

Baeten, J. C. M., and van Glabbeek, R. J. (1987), Another look at abstraction in process algebra, in "Proceedings, 14th International Colloquium on Automata, Languages and Programming (ICALP'87), Karlsruhe," (Th. Ottmann, ed.), pp. 84--94, Lecture Notes in Computer Science, Vol. 267, Springer-Verlag.

....the fact that no time elapses between pressing the replication button and observing the action) The observer is then in the possession of a copy, known to be in the state where the visible action originated from. If this is possible I speak of j replication, in the spirit of Baeten Van Glabbeek [5]. The last answer on the third question is that the observer may hold his thumb on the replication button during an extended period of time. This will create an ordered series of copies with the property that from each state the system has passed through, at least one copy is available. This ....

....[15] with with the stuttering equivalence of Browne, Clarke Gr umberg [11] that is characterized by the temporal logics CTL and CTL , each without next time operator. Other bisimulation equivalences (Weak) j bisimulation equivalence ( WB j ) originates from Baeten Van Glabbeek [5], the preorders v WB j# and v BB # are mentioned in [20] and the equivalence =DB j is introduced independently as quasi branching bisimulation equivalence in Cherief [12] and as simple branching bisimulation by Jan van Eijck [personal communication] Coupled simulation and stable ....

J.C.M. Baeten & R.J. van Glabbeek (1987): Another look at abstraction in process algebra. In Th. Ottmann, editor: Proceedings 14 th ICALP, Karlsruhe, Lecture Notes in Computer Science 267, Springer-Verlag, pp. 84--94.

....As before. The derivations used in Proposition 2 only employ the axioms listed above. 2 This axiomatization is also sound, as follows from inspection of the axioms. Using the other saturation property of Definition 4, one can easily find a complete axiomatization for the notion of j bisimulation [4, 16]. ....

J.C.M. Baeten & R.J. van Glabbeek (1987): Another look at abstraction in process algebra. In Th. Ottmann, editor: Proceedings 14 th ICALP, Karlsruhe, LNCS 267, SpringerVerlag, pp. 84--94.

No context found.

J. Baeten and R. van Glabbeek. Another look at abstraction in process algebra. In Proceedings of the 14th International Colloquium on Automata, Languages and Programming (ICALP'87), volume 267 of LNCS, pages 84--94. Springer-Verlag, 1987.

No context found.

J.C.M. Baeten and R.J. van Glabbeek. Another look at abstraction in process algebra. In Proceedings of ICALP'87, volume 267 of Lecture Notes in Computer Science, pages 84--94. Springer, 1987.

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