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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Logic in Computer Science, 9th Annual IEEE Symposium S. 71 - 80
Hauptverfasser: Saraswat, V.A., Jagadeesan, R., Gupta, V.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE Comput. Soc. Press 1994
Schlagworte:
Algebra
Automata
Computer languages
Computer science
Concurrent computing
Control systems
Equations
Maintenance
Modular construction
Time factors
ISBN:9780818663109, 0818663103
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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