Abstract
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.
An equivalence relation, so-called Permutability, is formally introduced: two PCCS expressions are permutable iff they can be obtained from each other by a permutation of expressions within a pool. Permutability can be decided in a polynomial time w.r.t. the length of expressions. The Permutability notion allows the definition of symbolic Processes, which describe the system behaviour when inside a pool the agent identities are removed. A transitional semantics is defined and behavioral verifications may be conducted over symbolic Processes.
Chapter PDF
Similar content being viewed by others
References
A. Sistla E. Emerson. Symmetry and model checking. In Computer Aided Verification, pages 463–478. Lecture Notes in Computer Science 697, June–July 1993.
T. Filkorn E.M. Clarke and S. Jha. Exploiting symmetry in temporal logic model checking. In Computer Aided Verification, pages 451–462. Lecture Notes in Computer Science 697, June–July 1993.
G. Franceschinis G. Chiola, C. Dutheillet and S. Haddad. On well-formed coloured nets and their symbolic reachability graph. In High-Level Petri Nets, pages 373–396. Springer-Verlag, 1991.
C. Ip and D. Dill. Better verification through symmetry. In Int. Symp. on Computer Hardware Description language and their Application, 1993.
Claude Dutheillet Lamonthezie. Symétrie dans les Réseau Colorés. PhD thesis, Université Paris 6, 1991.
Robin Milner. A Calculus of Communication Systems, volume 92. Springer-Verlag, lncs edition, 1980.
Robin Milner. Communication and Concurrency. Prentice Hall, 1989.
L.O. Jepsen P. Huber, A.M. Jensen and K. Jensen. Reachability trees for high-level petri nets. In High-Level Petri Nets, pages 319–350. Springer-Verlag, 1991.
K. Schmidt. Symmetries of petri nets. Informatik-Berichte 33, Humbolt-UniversitÄt zu Berlin, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Michel, F., Azéma, P., Vernadat, F. (1996). Permutable agents in process algebras. In: Margaria, T., Steffen, B. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1996. Lecture Notes in Computer Science, vol 1055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61042-1_45
Download citation
DOI: https://doi.org/10.1007/3-540-61042-1_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61042-7
Online ISBN: 978-3-540-49874-2
eBook Packages: Springer Book Archive