Non-determinism and Probabilities in Timed Concurrent Constraint Programming
DOI10.1007/978-3-540-89982-2_56zbMath1185.68451OpenAlexW1488613427WikidataQ57652416 ScholiaQ57652416MaRDI QIDQ5504690
Publication date: 22 January 2009
Published in: Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89982-2_56
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (3)
Cites Work
- A logic for reasoning about time and reliability
- Truly concurrent constraint programming
- Timed Concurrent Constraint Programming for Analysing Biological Systems
- Modeling Concurrent systems specified in a Temporal Concurrent Constraint language-I
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Non-determinism and Probabilities in Timed Concurrent Constraint Programming