Add to ORKGInternational audienceWell-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute a finite representation of the set of successors of the downward closure of a state, is harder: Until now, the theoretical framework for manipulating downward-closed sets was missing. We answer this problem, using insights from domain theory (dcpos and ideal completions), from topology (sobrifications), and shed new light on the notion of adequate domains of limits
The downward closure of a language is the set of all (not necessarily contiguous) subwords of its me...
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interest...
AbstractWe address the verification problem of FIFO-channel systems. We apply the symbolic analysis ...
Well-structured transition systems provide the right foundation to compute a finite basis of the set...
We describe a simple, conceptual forward analysis procedure forinfinity-complete WSTS S. This comput...
We investigate a subclass of well-structured transition systems (WSTS), the bounded—in the sense of ...
Computing the set of states backwards reachable from a given {\em upward-closed} set of initial stat...
AbstractIn this paper, we present a general algorithmic schema called ‘Expand, Enlarge and Check’ fr...
AbstractIn this paper we present a new framework for computing the backward reachability from an upw...
Motivated by the analysis of highly dynamic message-passing systems, i.e. unbounded thread creation,...
Many infinite state systems can be seen as well-structured transition systems (WSTS), i.e., systems ...
Many infinite state systems can be seen as well-structured transition systems (WSTS), i.e., systems ...
Abstract. The control state reachability problem is decidable for well-structured infinite-state sys...
The downward closure of a language L of words is the set of all (not necessarily contiguous) subword...
AbstractIn this paper, we revisit the forward and backward approaches to the verification of extensi...
The downward closure of a language is the set of all (not necessarily contiguous) subwords of its me...
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interest...
AbstractWe address the verification problem of FIFO-channel systems. We apply the symbolic analysis ...
Well-structured transition systems provide the right foundation to compute a finite basis of the set...
We describe a simple, conceptual forward analysis procedure forinfinity-complete WSTS S. This comput...
We investigate a subclass of well-structured transition systems (WSTS), the bounded—in the sense of ...
Computing the set of states backwards reachable from a given {\em upward-closed} set of initial stat...
AbstractIn this paper, we present a general algorithmic schema called ‘Expand, Enlarge and Check’ fr...
AbstractIn this paper we present a new framework for computing the backward reachability from an upw...
Motivated by the analysis of highly dynamic message-passing systems, i.e. unbounded thread creation,...
Many infinite state systems can be seen as well-structured transition systems (WSTS), i.e., systems ...
Many infinite state systems can be seen as well-structured transition systems (WSTS), i.e., systems ...
Abstract. The control state reachability problem is decidable for well-structured infinite-state sys...
The downward closure of a language L of words is the set of all (not necessarily contiguous) subword...
AbstractIn this paper, we revisit the forward and backward approaches to the verification of extensi...
The downward closure of a language is the set of all (not necessarily contiguous) subwords of its me...
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interest...
AbstractWe address the verification problem of FIFO-channel systems. We apply the symbolic analysis ...