Non-determinism and Probabilities in Timed Concurrent Constraint Programming

Authors:
Jorge A. Pérez;Camilo Rueda
Affiliations:
Dept. of Computer Science, University of Bologna, Italy;Dept. of Science and Engineering of Computing, Universidad Javeriana - Cali, Colombia and IRCAM, Paris, France
Venue:
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Year:
2008

Citing 8
Cited 1

Concurrent constraint programming

Concurrent constraint programming
Modeling and verification of randomized distributed real-time systems

Modeling and verification of randomized distributed real-time systems
Temporal concurrent constraint programming: denotation, logic and applications

Nordic Journal of Computing
Probabilistic Concurrent Constraint Programming

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Probabilistic Asynchronous pi-Calculus

FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
An Operational Semantics for Probabilistic Concurrent Constraint Programming

ICCL '98 Proceedings of the 1998 International Conference on Computer Languages
Timed Concurrent Constraint Programming for Analysing Biological Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic and Nondeterministic Aspects of Anonymity

Electronic Notes in Theoretical Computer Science (ENTCS)

Models and emerging trends of concurrent constraint programming

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

A timed concurrent constraint process calculus with probabilistic and non-deterministic choices is proposed. We outline the rationale of an operational semantics for the calculus. The semantics ensures consistent interactions between both kinds of choices and is indispensable for the definition of logic-based verification capabilities over system specifications.