Results 1 
2 of
2
Model Checking for the Concurrent Constraint Paradigm
"... This paper abstracts the contents of the Ph.D. dissertation which has been recently defended by the author. Although model checking was defined to automatically verify hardware, in the last decades it has been showed that it is possible to apply the technique also to software. The concurrent constra ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
This paper abstracts the contents of the Ph.D. dissertation which has been recently defended by the author. Although model checking was defined to automatically verify hardware, in the last decades it has been showed that it is possible to apply the technique also to software. The concurrent constraint paradigm is a simple but powerful computational model which we can use to specify reactive and hybrid systems. The thesis considers three of the timed languages of this paradigm. It presents two methods to apply the model checking technique to two different timed concurrent constraint languages, and it is also defined a denotational semantics which is fully abstract w.r.t. the operational behavior of another timed concurrent constraint language. This new semantics allows one to perform useful static analysis of programs.
When Is Reachability Intrinsically Decidable?
"... Abstract. A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computable copy of H. The reachability problem for H in G is, given u, w ∈ V, to decide whether there is a path from u ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computable copy of H. The reachability problem for H in G is, given u, w ∈ V, to decide whether there is a path from u to w. If the reachability problem for H is decidable in all computable copies of H then the problem is intrinsically decidable. This paper provides syntacticlogical characterizations of certain classes of graphs with intrinsically decidable reachability relations. 1