28948 articles – 22377 references  [version française]

hal-00641408, version 1

Partition Refinement for Bisimilarity in CCP

Andrés Aristizábal () 12, Filippo Bonchi () 3, Luis Pino () 1, Frank D. Valencia () 12

27th ACM Symposium On Applied Computing (2012) 6 pages

Abstract: Saraswat's concurrent constraint programming (ccp) is a mature formalism for modeling processes (or programs) that interact by telling and asking constraints in a global medium, called the store. Bisimilarity is a standard behavioural equivalence in concurrency theory, but a well-behaved notion of bisimilarity for ccp has been proposed only recently. When the state space of a system is finite, the ordinary notion of bisimilarity can be computed via the well-known partition refinement algorithm, but unfortunately, this algorithm does not work for ccp bisimilarity. In this paper, we propose a variation of the partition refinement algorithm for verifying ccp bisimilarity. To the best of our knowledge this is the first work providing for the automatic verification of program equivalence for ccp

  • 1:  COMETE (INRIA Saclay - Ile de France)
  • INRIA – Polytechnique - X – CNRS : UMR7161
  • 2:  Laboratoire d'informatique de l'école polytechnique (LIX)
  • CNRS : UMR7161 – Polytechnique - X
  • 3:  Laboratoire de l'Informatique du Parallélisme (LIP)
  • Université de Lyon – CNRS : UMR5668 – INRIA – École Normale Supérieure - Lyon – Université Claude Bernard - Lyon I
  • Domain : Computer Science/Formal Languages and Automata Theory
    Computer Science/Logic in Computer Science
  • Keywords : Concurrent Constraint Programming – Bisimilarity – Partition Refinement
  • Available versions :  v1 (2011-11-16) v2 (2012-12-05) v3 (2012-12-07)
 
  • hal-00641408, version 1
  • oai:hal.archives-ouvertes.fr:hal-00641408
  • From: 
  • Submitted on: Tuesday, 15 November 2011 17:51:20
  • Updated on: Tuesday, 4 December 2012 17:03:29