The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
Concurrent constraint programming
Concurrent constraint programming
Timed default concurrent constraint programming
Journal of Symbolic Computation - Special issue: executable temporal logics
Proving concurrent constraint programs correct
ACM Transactions on Programming Languages and Systems (TOPLAS)
Stochastic processes as concurrent constraint programs
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A timed concurrent constraint language
Information and Computation
Multiagent Systems: A Survey from a Machine Learning Perspective
Autonomous Robots
Models for Concurrent Constraint Programming
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Probabilistic Concurrent Constraint Programming
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
A Temporal Concurrent Constraint Programming Calculus
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A Foundation for Higher-order Concurrent Constraint Programming
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
A Temporal Logic for Reasoning about Timed Concurrent Constraint Programs
TIME '01 Proceedings of the Eighth International Symposium on Temporal Representation and Reasoning (TIME'01)
Timed soft concurrent constraint programs
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Hi-index | 0.00 |
The ntcc calculus is a model of non-deterministic temporal concurrent constraint programming. In this paper we study behavioral notions for this calculus. In the underlying computational model, concurrent constraint processes are executed in discrete time intervals. The behavioral notions studied reflect the reactive interactions between concurrent constraint processes and their environment, as well as internal interactions between individual processes. Relationships between the suggested notions are studied, and they are all proved to be decidable for a substantial fragment of the calculus. Furthermore, the expressive power of this fragment is illustrated by examples.