Non-determinism and Probabilities in Timed Concurrent Constraint Programming

Jorge A. Pérez, Camilo Rueda

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

8 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationLogic Programming, 24th International Conference, ICLP 2008, Udine, Italy, December 9-13 2008, Proceedings
Editors Garcia de la Banda, M. Pontelli
Place of PublicationBerlin
PublisherSpringer
Pages677-681
Number of pages5
ISBN (Electronic)978-3-540-89982-2
ISBN (Print)978-3-540-89981-5
DOIs
Publication statusPublished - 2008
EventLogic Programming, 24th International Conference, ICLP 2008, Udine, Italy, December 9-13 2008 - Udine, Italy
Duration: 9-Dec-201513-Dec-2015

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume5366
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceLogic Programming, 24th International Conference, ICLP 2008, Udine, Italy, December 9-13 2008
Country/TerritoryItaly
CityUdine
Period09/12/201513/12/2015

Fingerprint

Dive into the research topics of 'Non-determinism and Probabilities in Timed Concurrent Constraint Programming'. Together they form a unique fingerprint.

Cite this