A Temporal Logic for Reasoning about Timed Concurrent Constraint Programs

Authors:
F. S. de Boer;M. Gabbrielli;M. C. Meo
Affiliations:
-;-;-
Venue:
TIME '01 Proceedings of the Eighth International Symposium on Temporal Representation and Reasoning (TIME'01)
Year:
2001

Citing 0
Cited 14

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
A Temporal Concurrent Constraint Programming Calculus

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)
A semantic framework for the abstract model checking of tccp programs

Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Automatic verification of timed concurrent constraint programs

Theory and Practice of Logic Programming
Model checking for the concurrent constraint paradigm: Thesis

AI Communications
A Framework for Timed Concurrent Constraint Programming with External Functions

Electronic Notes in Theoretical Computer Science (ENTCS)
The tccp Interpreter

Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract Model Checking of tccp programs

Electronic Notes in Theoretical Computer Science (ENTCS)
Concurrent and reactive constraint programming

A 25-year perspective on logic programming
A symbolic model checker for tccp programs

RISE'04 Proceedings of the First international conference on Rapid Integration of Software Engineering Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

A temporal logic is presented for reasoning about the correctness of timed concurrent constraint programs. The logic is based on epistemic modalities which express either what a process knows at a certain time or what a process believes about the results of the other processes. In terms of these epistemic modalities of "knowledge" and "belief" a compositional axiomatization is given of the reactive behaviour of timed concurrent constraint programs.