F.W. Vaandrager. Algebraic techniques for concurrency and their applications. PhD thesis, Universiteit van Amsterdam, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Discrete-time Process Algebra and the Semantics of SDL - Bergstra, Middelburg, Usenko (1998) (5 citations) (Correct)
....X jEi for a fixed E express that the constants hX jEi make up a solution of E, i.e. RDP holds for any model of PA psc drt rec. The conditional equations E ) X = hX jEi express that this solution is the only one. So RSP can be described by means of conditional equations as already mentioned in [26]. Semantics of PA psc drt rec A structured operational semantics of PA psc drt rec is described by the rules for PA psc drt and the rules given in Table 15. hs X jEi v;a Gamma Gamma p hX jEi v;a Gamma Gamma p hs X jEi v;a Gamma Gamma y hX jEi v;a Gamma Gamma y hs X jEi v;oe ....
F.W. Vaandrager. Algebraic Techniques for Concurrency and their Applications. PhD thesis, Centre for Mathematics and Computer Science, Amsterdam, 1989.
Discrete Time Process Algebra and the Semantics of SDL - Bergstra, Middelburg, Usenko (1998) (5 citations) (Correct)
....hs X jEi for a xed E express that the constants hXjEi make up a solution of E, i.e. RDP holds for any model of PA psc drt rec. The conditional equations E ) X = hXjEi express that this solution is the only one. So RSP can be described by means of conditional equations as already mentioned in [28]. 15 hs X jEi v;a p hXjEi v;a p hs X jEi v;a y hXjEi v;a y hs X jEi v; y hXjEi v; y v 2 [s (hs X jEi) v 2 [s (hXjEi) Table 15: Rules for recursion (a 2 A) Semantics of PA psc drt rec A structural operational semantics of PA psc drt rec is described ....
F.W. Vaandrager. Algebraic Techniques for Concurrency and their Applications. PhD thesis, Centre for Mathematics and Computer Science, Amsterdam, 1989.
The Semantics of the Combination of Atomized Statements and.. - Knijnenburg, Kok (1998) (Correct)
....Logic Languages in the present language in such a way that the operational semantics of programs written in these languages coincides with the induced semantics of the embedded program. We consider a uniform language L for which we study the meaning of the program connectives only (c.f. [dB91, Vaa89]) In order to study the parallel choice connective, we have included an always deadlocking failing action ffi in the language. Both an operational and a denotational semantics for the language are defined, in sections 3 and 5, respectively. The operational semantics only yields the finite ....
F.W. Vaandrager. Algebraic techniques for concurrency and their applications. PhD thesis, Universiteit van Amsterdam, 1989.
A Complete Order-theoretic Model for the Algebra of.. - Knijnenburg (1994) (Correct)
....we say that a and b can synchronize. The synchronous execution of a and b is then regarded as the execution of c. If fl(a; b) ffi then a and b cannot synchronize and any attempt to synchronize them results in deadlock. The axioms of the equational theory of ACP are given in Table 1 (see also [BK84, Vaa89]) In Table 1, axioms A1 Gamma 7 are the axioms of Basic Process Algebra with Deadlock. Axiom CF relates the communication between elementary actions a and b to the given function fl. Axioms CM1 Gamma 9 are the axioms dealing with parallel composition. In particular, they state that the parallel ....
F.W. Vaandrager. Algebraic techniques for concurrency and their applications. PhD thesis, Universiteit van Amsterdam, 1989.
Towards a Meta-Theory of Operational Semantics - Wilson (1992) (Correct)
....the proposed research. 3 Programming language for Computable Functions 1.2 Process algebra meta theories of operational semantics I am not the first person to try to find a meta theory of operational semantics. The process algebraicists De Simone [DS85] Bloom et al. [BIM88] Vaandrager [Vaa89], Groote [GVar, Gro91, Gro90, BG91] and van Glabbeek [vGV88] have investigated meta theories for restricted classes of inductive rules that define process algebras. The approach they have taken is to define and then investigate a class of transition systems using rules that conform to some fixed ....
Frits W. Vaandrager. Algebraic Techniques for Concurrency and their Application. PhD thesis, Centrum voor Wiskunde en Informatica, University of Amsterdam, 1989.
Relating Distributed, Temporal and Causal Observations of Simple.. - Aceto (Correct)
....three equivalences have the same axiomatization over the language under consideration. The crux of the proof will be to provide a finite, complete axiomatization for causal bisimulation over our simple language, without resorting to the auxiliary prefixing operators used in [DD88] As argued in [Vaa90], the use of algebraic and axiomatic techniques proves its worth, among other things, in comparing process semantics based on very different notions of observable behaviour of processes. The paper is organized as follows. Section 2 is devoted to a brief review of background material, to the ....
F.W. Vaandrager. Algebraic Techniques for Concurrency and Their Application. PhD thesis, University of Amsterdam, 1990.
A Complete Order-theoretic Model for the Algebra of.. - Knijnenburg (Correct)
No context found.
F.W. Vaandrager. Algebraic techniques for concurrency and their applications. PhD thesis, Universiteit van Amsterdam, 1989.
Rooted Branching Bisimulation as a Congruence - Fokkink (2000) (3 citations) (Correct)
No context found.
F.W. Vaandrager. Algebraic Techniques for Concurrency and their Application. PhD thesis, University of Amsterdam, 1990.
Rooted Branching Bisimulation as a Congruence - Wan Fokkink (2000) (3 citations) (Correct)
No context found.
F.W. Vaandrager. Algebraic Techniques for Concurrency and their Application. PhD thesis, University of Amsterdam, 1990.
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