We review and discuss here some of the existing approaches based on CLP (Constraint Logic Programming) for verifying properties of various kinds of state-transition systems.

The model-checking problem for 1-safe Petri nets and linear-time temporal logic (LTL) consists of deciding, given a 1-safe Petri net and a formula of LTL, whether the Petri net satisses the property encoded by the formula. This paper introduces a semidecision test for this problem. By a semidecision test we understand a procedure which may answer`yes', in which case the Petri net satisses the p...

We propose the development of multimedia programming frameworks based on the declarative logic programming setting and in particular the framework of object-oriented timed concurrent constraint programming (OO-TCCP). The real-time extensions that have been proposed for the concurrent constraint programming framework are coupled with the object-oriented and inheritance mechanisms that have been ...

Recently constraint satisfaction has been embedded in various high-level declarative programming environments, like the Constraint Logic Programming framework, and even more recently such environments have been extended with concurrency, like in the Concurrent Constraint Programming paradigm. The merging of diierent areas of research is always an exciting event, and proliic of new ideas. We bel...