Foundations of timed concurrent constraint programming
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of process algebras, we develop some combinators expressible in this model, and reconcile their operational, logical and denotational character. We show how programs may be compiled into finite-state machines with loop-free computations at each state, thus guaranteeing bounded response time.Keywords
This publication has 14 references indexed in Scilit:
- Synchronous Programming of Reactive SystemsPublished by Springer Nature ,1993
- The Esterel synchronous programming language: design, semantics, implementationScience of Computer Programming, 1992
- A fully abstract semantics for a first-order functional language with logic variablesACM Transactions on Programming Languages and Systems, 1991
- A language for compositional specification and verification of finite state hardware controllersProceedings of the IEEE, 1991
- The chemical abstract machinePublished by Association for Computing Machinery (ACM) ,1990
- Statecharts: a visual formalism for complex systemsScience of Computer Programming, 1987
- A hierarchy of temporal propertiesPublished by Association for Computing Machinery (ACM) ,1987
- On the Development of Reactive SystemsPublished by Springer Nature ,1985
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- Results on the propositional μ-calculusTheoretical Computer Science, 1983