E.R. Olderog and C.A.R. Hoare. Speci cation- oriented semantics for communicating processes. Acta Informatica, 23:9-66, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Further Results on Partial Order Equivalences on Infinite Systems - Sunesen (1998) (Correct)
....pomset and location equivalence are de ned in Section 5. In Section 6, 7 and 8, we investigate BPP M , respectively. We conclude with discussions on some loose ends and suggestions for future work. 2 TCSP=CCS style languages We start by de ning the abstract syntax and semantics of TCSP [12, 21] and CCS [19] style a languages. The de nitions are fairly standard. As usual, we x a countably in nite set of actions = f ; g. Then, f ; g is the set of complement actions such that is a bijection between and , mapping to . Let Act = and let Act = ....
E.R. Olderog and C.A.R. Hoare. Speci cation- oriented semantics for communicating processes. Acta Informatica, 23:9-66, 1986.
An Approach to Process Algebra using IMPS - Thayer (1995) (2 citations) (Correct)
....processes are related to each other by event traces; the event traces themselves are modeled by a monoid. This extends the concept of a labelled transition system if we regard the set of event sequences as being a monoid under concatenation. For other di erent approaches to process algebra, see [3, 4, 11]. Language 3.1 (language for monoid transition system) Embedded language: monoid theory Base type: state Constant: act : state U state ] 6 Component theory: directed monoid theory Top level axioms: monoid operation behaves as composition 8s; t : U; p; r : state ( p s t r 9q : ....
E.-R. Olderog and C. A. R. Hoare. Specication-oriented semantics for communicating processes. Acta Informatica, 23, 1986. 31
Precongruence Formats for Decorated Trace Preorders - Bloom, Fokkink, van Glabbeek (2000) (Correct)
....has been de ned on 2 valued transition relations. These preorders are based on the branching structure of processes (ready simulation [7] bisimulation [21] on execution sequences (partial traces, completed traces, accepting traces) or on decorated versions of execution sequences (ready pairs [22], failure pairs [9, 11] ready traces [2, 25] failure traces [23] In [15] van Glabbeek classi ed most equivalences and preorders for concrete, sequential processes 1 that occur in the literature, and motivated them by means of testing scenarios, phrased in terms of button pushing ....
E.-R. Olderog & C.A.R. Hoare (1986): Specication -oriented semantics for communicating processes. Acta Informatica 23, pp. 9-66.
Modular Formal Specification of Data and Behaviour - Pol, Hooman, de Jong (1999) (Correct)
....during the design of the system, where operational descriptions emerge. Future work. We have chosen a very simple model, viz. sets of runs. Extensions with real time will be considered, and also ready failure trace semantics, in order to express that certain input events should be enabled (cf. [11]) The analysis can then be extended by proving other interesting properties of a speci cation, for instance robustness, meaning that the speci ed system accepts all possible input. Research on the smooth integration of requirements speci cation and design is needed. In design, data and behaviour ....
E.R. Olderog and C.A.R. Hoare. Specication-oriented semantics for communicating processes. Acta Informatica, 23(1):9-66, 1986.
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