Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
2,485
The Reachability Problem over Infinite Graphs
"... Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is central for automatic verification of infinitestate systems. Our focus is on graphs that are presented in terms of word or tre ..."
Abstract
- Add to MetaCart
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is central for automatic verification of infinitestate systems. Our focus is on graphs that are presented in terms of word
The Reachability problem for finite cellular automata
"... We investigate the complexity of the Configuration REachability Problem (CREP) for two classes of finite weakly predictable cellular automata: the invertible and the additive ones. In both cases we prove that CREP belongs tp the "Arthur-Merlin" class CoAM[2]. ..."
Abstract
- Add to MetaCart
We investigate the complexity of the Configuration REachability Problem (CREP) for two classes of finite weakly predictable cellular automata: the invertible and the additive ones. In both cases we prove that CREP belongs tp the "Arthur-Merlin" class CoAM[2].
Unfolding Based Algorithms for the Reachability Problem
, 2001
"... We study four solutions to the reachability problem for 1-safe Petri nets, all of them based on the unfolding technique. We define the problem as follows: given a set of places of the net, determine if some reachable marking puts a token in all of them. Three of the solutions to the problem are take ..."
Abstract
-
Cited by 11 (1 self)
- Add to MetaCart
We study four solutions to the reachability problem for 1-safe Petri nets, all of them based on the unfolding technique. We define the problem as follows: given a set of places of the net, determine if some reachable marking puts a token in all of them. Three of the solutions to the problem
Join-Reachability Problems in Directed Graphs ⋆
"... Abstract. For a given collection G of directed graphs we define the joinreachability graph of G, denoted by J (G), as the directed graph that, for any pair of vertices a and b, contains a path from a to b if and only if such a path exists in all graphs of G. Our goal is to compute an efficient repre ..."
Abstract
- Add to MetaCart
of vertices that reach a query vertex in all graphs of G. This problem is related to the well-studied reachability problem and is motivated by emerging applications of graph-structured databases and graph algorithms. We consider the construction of join-reachability structures for two graphs and develop
Planar and grid graph reachability problems
- THEOR. COMP. SYS
, 2009
"... We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, of which grid graphs are an important special case. Our main results are: • Reachability in graphs of genus one is logspac ..."
Abstract
-
Cited by 17 (4 self)
- Add to MetaCart
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, of which grid graphs are an important special case. Our main results are: • Reachability in graphs of genus one
On the optimal reachability problem on weighted timed automata
, 2007
"... We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infimum cost as well as a supremum cost. We show that this problem is PSPACE-COMPLETE. Our proof uses techniques of linear p ..."
Abstract
-
Cited by 23 (2 self)
- Add to MetaCart
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infimum cost as well as a supremum cost. We show that this problem is PSPACE-COMPLETE. Our proof uses techniques of linear
Cellular Automata and Intermediate Reachability Problems
- FUNDAMENTAE INFORMATICAE
"... We exhibit one-dimensional cellular automata whose reachability and confluence problems have arbitrary r.e. degree of unsolvability. ..."
Abstract
-
Cited by 10 (8 self)
- Add to MetaCart
We exhibit one-dimensional cellular automata whose reachability and confluence problems have arbitrary r.e. degree of unsolvability.
Extended stochastic hybrid systems and their reachability problem
- in Hybrid Systems: Computation and Control, LNCS 2993
, 2004
"... Abstract. In this paper we generalize a model for stochastic hybrid systems. First, we prove that this model is a right Markov process and it satisfies some mathematical properties. Second, we propose a method based on the theory of Dirichlet forms to study the reachability problem associated with t ..."
Abstract
-
Cited by 37 (7 self)
- Add to MetaCart
Abstract. In this paper we generalize a model for stochastic hybrid systems. First, we prove that this model is a right Markov process and it satisfies some mathematical properties. Second, we propose a method based on the theory of Dirichlet forms to study the reachability problem associated
Membership and Reachability Problems for Row-monomial Transformations
"... Abstract. In this paper we study the membership and vector reachability problems for labelled transition systems with row-monomial transformations. We show the decidability of these problems for row-monomial martix semigroups over rationals and extend these results to the wider class of matrix semig ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract. In this paper we study the membership and vector reachability problems for labelled transition systems with row-monomial transformations. We show the decidability of these problems for row-monomial martix semigroups over rationals and extend these results to the wider class of matrix
Decidability of Reachability Problems for Classes of Two . . .
- STACS'00, LNCS 1770
, 2000
"... We present a global and comprehensive view of the properties of subclasses of two counters automata for which counters are only accessed through the following operations: increment (+1), decrement ( 1), reset (c := 0), transfer (the whole content of counter c is transfered into counter c 0 ), and te ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
are obtained with the help of a new symbolic reachability tree algorithm for ...
Results 11 - 20
of
2,485
