Three partition refinement algorithms
SIAM Journal on Computing
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Nondeterminism and infinite computations in constraint programming
Selected papers of the workshop on Topology and completion in semantics
A Calculus of Communicating Systems
A Calculus of Communicating Systems
A logical view of concurrent constraint programming
Nordic Journal of Computing
Verifying Bisimulations "On the Fly"
FORTE '90 Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, III
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On Bisimulations for the Asynchronous pi-Calculus
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Symbolic Bisimulation Minimisation
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
CCS expressions, finite state processes, and three problems of equivalence
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Saturated Semantics for Reactive Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Universal concurrent constraint programing: symbolic semantics and applications to security
Proceedings of the 2008 ACM symposium on Applied computing
Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular
Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive Systems, Barbed Semantics, and the Mobile Ambients
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Psi-calculi: Mobile Processes, Nominal Data, and Logic
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Open bisimulation for the concurrent constraint pi-calculus
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
A Calculus of Contracting Processes
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Deriving labels and bisimilarity for concurrent constraint programming
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Partition refinement for bisimilarity in CCP
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Spatial and epistemic modalities in constraint-based process calculi
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Hi-index | 0.00 |
Concurrent Constraint Programming (ccp) is a well-established declarative framework from concurrency theory. Its foundations and principles e.g., semantics, proof systems, axiomatizations, have been thoroughly studied for over the last two decades. In contrast, the development of algorithms and automatic verification procedures for ccp have hitherto been far too little considered. To the best of our knowledge there is only one existing verification algorithm for the standard notion of ccp program (observational) equivalence. In this paper we first show that this verification algorithm has an exponential-time complexity even for programs from a representative sub-language of ccp; the summation-free fragment (ccp\+). We then significantly improve on the complexity of this algorithm by providing two alternative polynomial-time decision procedures for ccp\+ program equivalence. Each of these two procedures has an advantage over the other. One has a better time complexity. The other can be easily adapted for the full language of ccp to produce significant state space reductions. The relevance of both procedures derives from the importance of ccp\+. This fragment, which has been the subject of many theoretical studies, has strong ties to first-order logic and an elegant denotational semantics, and it can be used to model real-world situations. Its most distinctive feature is that of confluence, a property we exploit to obtain our polynomial procedures.