Foundations of timed concurrent constraint programming

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 denota...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Logic in Computer Science, 9th Annual IEEE Symposium s. 71 - 80
Hlavní autoři: Saraswat, V.A., Jagadeesan, R., Gupta, V.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE Comput. Soc. Press 1994
Témata:
Algebra
Automata
Computer languages
Computer science
Concurrent computing
Control systems
Equations
Maintenance
Modular construction
Time factors
ISBN:9780818663109, 0818663103
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.< >
ISBN:9780818663109
0818663103
DOI:10.1109/LICS.1994.316085