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
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
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)
Confluence in concurrent constraint programming
Theoretical Computer Science - Special issue on algebraic methodology and software technology
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A timed concurrent constraint language
Information and Computation
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Robot Soccer with LEGO Mindstorms
RoboCup-98: Robot Soccer World Cup II
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
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)
A generic operator over discrete time intervals
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
On the expressive power of temporal concurrent constraint programming languages
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Temporal concurrent constraint programming: denotation, logic and applications
Nordic Journal of Computing
Temporal Concurrent Constraint Programming: Applications and Behavior
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Proving Correctness of Timed Concurrent Constraint Programs
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Temporal Concurrent Constraint Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Temporal concurrent constraint programming: applications and behavior
Formal and natural computing
Proving correctness of timed concurrent constraint programs
ACM Transactions on Computational Logic (TOCL)
Decidability of infinite-state timed CCP processes and first-order LTL
Theoretical Computer Science - Expressiveness in concurrency
A Timed Linda Language and its Denotational Semantics
Fundamenta Informaticae
Timed soft concurrent constraint programs
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
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
Constraint programming systems for modeling music theories and composition
ACM Computing Surveys (CSUR)
A survey of constraint-based programming paradigms
Computer Science Review
A Timed Linda Language and its Denotational Semantics
Fundamenta Informaticae
| Hi-index | 0.00 |
The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and non-deterministic timed behavior. We call this tcc extension the ntcc calculus. The expressiveness of ntcc is illustrated by modeling cells, asynchronous bounded broadcasting and timed systems such as RCX controllers. We present a denotational semantics for the strongest-postcondition of ntcc processes and, based on this semantics, we develop a proof system for linear temporal properties of these processes.