Advertisement

Permutable agents in process algebras

  • FranÇois Michel
  • Pierre Azéma
  • FranÇois Vernadat
Regular Sessions Session 6: Models and Methods
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1055)

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.

Key words

Process Algebras Symmetries Concurrent Systems Verification 

References

  1. [1]
    A. Sistla E. Emerson. Symmetry and model checking. In Computer Aided Verification, pages 463–478. Lecture Notes in Computer Science 697, June–July 1993.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    C. Ip and D. Dill. Better verification through symmetry. In Int. Symp. on Computer Hardware Description language and their Application, 1993.Google Scholar
  5. [5]
    Claude Dutheillet Lamonthezie. Symétrie dans les Réseau Colorés. PhD thesis, Université Paris 6, 1991.Google Scholar
  6. [6]
    Robin Milner. A Calculus of Communication Systems, volume 92. Springer-Verlag, lncs edition, 1980.Google Scholar
  7. [7]
    Robin Milner. Communication and Concurrency. Prentice Hall, 1989.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    K. Schmidt. Symmetries of petri nets. Informatik-Berichte 33, Humbolt-UniversitÄt zu Berlin, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • FranÇois Michel
    • 1
  • Pierre Azéma
    • 1
  • FranÇois Vernadat
    • 1
  1. 1.LAAS/CNRS 7Toulouse CedexFrance

Personalised recommendations