Michel, F., Azema, P. and Vernadat, F., Permutable Agents in Process Algebra. In Tools and Algorithms for the Construction and Analysis of Systems, 96, Springer Verlag, LNCS 1055, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
From Asymmetry to Full Symmetry: New Techniques for Symmetry .. - Emerson, Trefler (1999) (11 citations) (Correct)
....may have 3 reachable states. Symmetry reduction is an abstraction technique which endeavors to substantially ameliorate this state explosion problem by exploiting the fact that many computer systems are symmetric in their design and implementation (c.f. JR91] ID96] ES96] CEFJ96] HITZ95] [MAV96] [ES97] GS97] ET98] AHI98] Such symmetry can be seen to be a form of redundancy from the standpoint of model checking temporal logic formulae. The state graph M , of many synchronization and coordination protocols which are the parallel composition of n processes identical up to renaming, ....
....: l i , 9i : l i and 9i 6= j : l i l j . For example, AG: 9i 6= j : C i C j ) is a formula of ASCTL . 2.1 Simulation up to Permutation Let M = S; R) and M = S ) be structures defined over LP and I . B S Theta S is a simulation up to permutation (c.f. Mi71] Pa81] HM85] [MAV96] [ES96] CEFJ96] iff for all (s; s ) 2 B ffl there is a 2 Sym I such that (s) s and ffl for all (s; t) 2 R there is a t such that (s and (t; t ) 2 B. B S Theta S is a bisimulation up to permutation iff for all (s; s ) 2 B the above two conditions hold and ffl ....
Michel, F., Azema, P. and Vernadat, F., Permutable Agents in Process Algebra. In Tools and Algorithms for the Construction and Analysis of Systems, 96, Springer Verlag, LNCS 1055, 1996.
From Asymmetry to Full Symmetry: New Techniques for Symmetry .. - Emerson, Trefler (1999) (11 citations) (Correct)
....and SRC contract 98 DP 388. Symmetry reduction is an abstraction technique which endeavors to substantially ameliorate this state explosion problem by exploiting the fact that many computer systems are symmetric in their design and implementation (cf. JR91] ID96] ES96] CE 96] HI 95] [MAV96] [ES97] GS97] ET98] AHI98] Such symmetry can be seen to be a form of redundancy from the standpoint of model checking temporal logic formulae. The state graph, M , of many synchronization and coordination protocols which are the parallel composition of n processes identical up to renaming, ....
....i , 9i : l i and 9i 6= j : l i l j . For example, AG: 9i 6= j : C i C j ) is a formula of SACTL . 2.1 Simulation up to Permutation Let M = S; R) and M 0 = S 0 ; R 0 ) be structures defined over LP and I. B S Theta S 0 is a simulation up to permutation (cf. Mi71] Pa81] HM85] [MAV96] [ES96] CE 96] iff for all (s; s 0 ) 2 B there is a 2 Sym I such that (s) s 0 and for all (s; t) 2 R there is a t 0 such that (s 0 ; t 0 ) 2 R 0 and (t; t 0 ) 2 B. B S Theta S 0 is a bisimulation up to permutation iff for all (s; s 0 ) 2 B the above two ....
Michel, F., Azema, P. and Vernadat, F., Permutable Agents in Process Algebra. In Tools and Algorithms for the Construction and Analysis of Systems, 96, Springer Verlag, LNCS 1055, 1996.
An Operator for Symmetry Representation and Exploitation in.. - Holger Hermanns (1997) (3 citations) (Correct)
....where Markovian and immediate actions coexist. Furthermore, we provide the possibility to specify a synchronisation set comprising actions that have to occur synchronously in all components. Symmetry exploitation in ordinary process algebras has also gained some attention. In particular, [MAV96, YJL96] discusses CCS with symmetric agents. The paper is organised as follows. Section 2 introduces the basic definitions and notations used throughout the paper. Section 3 is devoted to the definition of symmetric composition and its properties. Section 4 compares the benefits of symmetric composition ....
F. Michel, P. Az'ema, and F. Vernadat. Permutable Agents in Process Algebras. In Proc. of 2nd Int. Workshop on Tools and Algorithms for the Construction and Analysis of Systems. Springer, LNCS 1055, 1996.
An Operator for Symmetry Representation and Exploitation in.. - Hermanns (1997) (3 citations) (Correct)
....we consider a language where Markovian and immediate actions coexist. Furthermore, we define the semantics operationally (instead of denotationally) thus avoiding the problem of unreachable states. Symmetry exploitation in ordinary process algebras has also gained some attention. In particular, [MAV96, YJL96] discusses CCS with symmetric agents. The paper is organised as follows. Section 2 introduces the basic definitions and notations used throughout the paper. Section 3 is devoted to the definition of symmetric composition and its properties. Section 4 compares the benefits of symmetric ....
F. Michel, P. Az'ema, and F. Vernadat. Permutable Agents in Process Algebras. In Proc. of 2nd Int. Workshop on Tools and Algorithms for the Construction and Analysis of Systems. Springer, LNCS 1055, 1996.
Virtual Symmetry Reduction - Emerson, Havlicek, Trefler (2000) (1 citation) (Correct)
No context found.
F. Michel, P. Azema, and F. Vernadat, Permutable agents in process algebra. In tools and Algorithms for the Construction and Analysis of Systems, 1996, LNCS 1055, Springer, 1996.
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