L. Pomello. Some equivalence notions for concurrent systems---an overview. In Rozenberg [Roz85], 381--400. (p 7) Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Observing "True" Concurrency - Jategaonkar (1993) (Correct)
....every v 2 Act for some states s 1 ; s 2 and some i; j 0 for some k 0 . by performing the sequence of actions v, possibly interspersed with actions. We also write s = to mean that there exists a s . The following definition is essentially standard (cf. [33]) Definition 2.1.5 The labeled transition system of a WT Net hN; Acti, written lts(hN; Acti) is the labeled transition system over Act [ fg whose states are the reachable markings of N and whose labeled transitions correspond to firings of single transitions of N . In particular, state M goes ....
L. Pomello. Some equivalence notions for concurrent systems: An overview. In Advances in Petri Nets, Volume 222 of Lecture Notes in Computer Science, pages 381--400, 1985.
Open Distributed Programming Using The Object Oriented.. - Buchs, GUELFI (1992) (4 citations) (Correct)
....object oriented notions of class and inheritance in CO OPN (more details see [B G91D] 2.9. Properties of CO OPN formalism. Some properties are formalized within the CO OPN framework like object systems equivalence, object replacement and algebra replacement. 11 The notion of equivalence [POME 86] between the semantics of object systems is defined for a fixed algebra A by the notion of concurrent bisimulation DTS A (SPEC O ) c DTS A (SPEC O ) One object can be replaced in an object system by an other one which is equivalent, producing a new object system bisimilar to the initial ....
....of open distributed systems. The ability to modify part of a system without changing the behavior of the whole system. without changing must be understood as the possibility to not observe different behaviors with respect to the equivalence used, in our case the bisimulation equivalence [POME 86] It means also that only a particular class of properties are preserved. The properties preserved with the bisimulation equivalence correspond to the properties that are expressed using the Milner process logic [MILN 89] 6.2. The semantics of the whole system We give here a description of the ....
L. Pomello "Some equivalence Notions for Concurrent Systems: An Overview". In: Advances in Petri nets 1985 Springer Verlag, LNCS 222 pp. 381-400.
Modal Observation Equivalence of Processes - Mitchell, Carlisle (1996) (3 citations) (Correct)
....oe between failure trace and strong bisimulation P oe Q iff P F tr Q . Define f P F tr = f S (P ) one can prove P F tr Q iff j= f S (P ) f S (Q ) 27 5.3 Ready Trace Equivalence This equivalence has occurred in the literature under various guises. See [22] 1] or [23] for example. Take j = a 1 X 1 a 2 X 2 Delta Delta Delta where the a i are action names and the X i are finite sets of action names. Write P j= j iff there is a sequence of transformations P = P 0 a 1 Gamma P 1 a 2 Gamma P 2 a 2 Gamma Delta Delta Delta and for each i, X i 1 = ....
L. Pomello, `Some equivalence notions for concurrent systems. An overview', Advances in Petri Nets 1985, LNCS 222, pp 381-400.
Equivalence Semantics for Concurrency: Comparison and Application - Galpin (1998) (Correct)
No context found.
L. Pomello. Some equivalence notions for concurrent systems---an overview. In Rozenberg [Roz85], 381--400. (p 7)
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