Permutable Agents in Process Algebras

Within the framework of symmetrical systems, an extension of CCS [6], so-called PCCS, is described. PCCS equips CCS with the concept of pool of agents by means of the explicit structure of Pool expressions. The symmetries whithin a Pools of agents may then be used to simplify the validation process of concurrent systems.

[1]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[2]  Peter Huber,et al.  Reachability Trees for High-level Petri Nets , 1986, Theor. Comput. Sci..

[3]  David L. Dill,et al.  Better verification through symmetry , 1996, Formal Methods Syst. Des..

[4]  A. Prasad Sistla,et al.  Symmetry and model checking , 1993, Formal Methods Syst. Des..

[5]  Giovanni Chiola,et al.  On Well-Formed Coloured Nets and Their Symbolic Reachability Graph , 1991 .

[6]  Somesh Jha,et al.  Exploiting Symmetry In Temporal Logic Model Checking , 1993, CAV.