A Symbolic Model for Timed Concurrent Constraint Programming

Concurrent Constraint Programming (ccp) is a model for concurrency where agents interact with each other by telling and asking constraints (i.e., formulas in logic) into a shared store of partial information. The ntcc calculus extends ccp with the notion of discrete time-units for the specification...

Celý popis

Podrobná bibliografia

Vydané v:	Electronic notes in theoretical computer science Ročník 312; s. 161 - 177
Hlavní autori:	Arias, Jaime, Guzmán, Michell, Olarte, Carlos
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 24.04.2015
Predmet:	Concurrent constraint programming model checking temporal logic Concurrent constraint programming temporal logic model checking
ISSN:	1571-0661, 1571-0661
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!