Results 1  10
of
2,485
On the Reachability Problem in Cryptographic Protocols
, 2000
"... We study the verification of secrecy and authenticity properties for cryptographic protocols which rely on symmetric shared keys. The verification can be reduced to check whether a certain parallel program which models the protocol and the specification can reach an erroneous state while interacting ..."
Abstract

Cited by 93 (0 self)
 Add to MetaCart
interacting with the environment. Assuming finite principals, we present a simple decision procedure for the reachability problem which is based on a `symbolic' reduction system.
The directed planar reachability problem
 In Proc. 25th annual Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), number 1373 in Lecture Notes in Computer Science
, 2005
"... Abstract. We investigate the stconnectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is logspacereducible to its complement, and we show that the problem of searching graphs of genus 1 reduces to the ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
to the planar case. We also consider a previouslystudied subclass of planar graphs known as grid graphs. We show that the directed planar stconnectivity problem reduces to the reachability problem for directed grid graphs. A special case of the gridgraph reachability problem where no edges are directed from
On the optimal reachability problem
 Formal Methods in System Design
, 2006
"... Abstract. We study the costoptimal 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 PSPACECOMPLETE. Our proof uses techniques of ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Abstract. We study the costoptimal 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 PSPACECOMPLETE. Our proof uses techniques
ON THE TRACTABILITY OF THE UN/REACHABILITY PROBLEM
"... Abstract. The Petri Net (PN) reachability problem is an effective formulation to attack the P vs. NP problem. The effectiveness is due to the inverse of the PN structure. The inversed reachability problem exchanges the initial and target state of the PN. In this problem, some 2SAT (XORSAT) formula ..."
Abstract
 Add to MetaCart
Abstract. The Petri Net (PN) reachability problem is an effective formulation to attack the P vs. NP problem. The effectiveness is due to the inverse of the PN structure. The inversed reachability problem exchanges the initial and target state of the PN. In this problem, some 2SAT (XORSAT) formula
On the Reachability Problem in P Systems with
"... Summary. We investigate the problem of reaching a configuration from another configuration in mobile membranes, and prove that the reachability can be decided by reducing it to the reachability problem of a version of pure and public ambient calculus without the capability open. 1 ..."
Abstract
 Add to MetaCart
Summary. We investigate the problem of reaching a configuration from another configuration in mobile membranes, and prove that the reachability can be decided by reducing it to the reachability problem of a version of pure and public ambient calculus without the capability open. 1
Reachability Problems: An Update
"... Abstract. There has been a great deal of progress in the fifteen years that have elapsed since Wigderson published his survey on the complexity of the graph connectivity problem [Wig92]. Most significantly, Reingold solved the longstanding question of the complexity of the st connectivity problem i ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
in undirected graphs, showing that this is complete for logspace (L) [Rei05]. This survey talk will focus on some of the remaining open questions dealing with graph reachability problems. Particular attention will be paid to these topics: – Reachability in planar directed graphs (and more generally, in graphs
Dynamic Optimization for Reachability Problems
"... This paper uses dynamic programming techniques to describe reach sets and related problems of forward and backward reachability. The original problems do not involve optimization criteria, and are reformulated in terms of optimization problems solved through the HamiltonJacobiBellman equations. The ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
This paper uses dynamic programming techniques to describe reach sets and related problems of forward and backward reachability. The original problems do not involve optimization criteria, and are reformulated in terms of optimization problems solved through the HamiltonJacobiBellman equations
Grid Graph Reachability Problems
 IN ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY
, 2006
"... We study the complexity of restricted versions of stconnectivity, which is the standard complete problem for NL. Grid graphs are a useful tool in this regard, since • reachability on grid graphs is logspaceequivalent to reachability in general planar digraphs, and • reachability on certain classes o ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
We study the complexity of restricted versions of stconnectivity, which is the standard complete problem for NL. Grid graphs are a useful tool in this regard, since • reachability on grid graphs is logspaceequivalent to reachability in general planar digraphs, and • reachability on certain classes
ALLENDER.ReachabilityProblems: An Update
, 2007
"... All changes are denoted by blue font Substantive revisions are denoted by a * preceding the section, paragraph, table, or figure that includes the revision Unless otherwise noted, chapters referenced are contained in this volume. Hyperlinks are denoted by underlined, bold, italic, blue font This upd ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
All changes are denoted by blue font Substantive revisions are denoted by a * preceding the section, paragraph, table, or figure that includes the revision Unless otherwise noted, chapters referenced are contained in this volume. Hyperlinks are denoted by underlined, bold, italic, blue font This updated chapter supersedes the previously published version dated December 2009. PARAGRAPH EXPLANATION OF CHANGE/REVISION PURPOSE All This chapter is being updated with hyperlinks and formatted to comply with current administrative instructions. Update All Expanded and rearranged chapter for clarity. Update 590101 Moved first sentence from original subparagraph 590301.B to new paragraph 590101.
Reachability problems for products of matrices in semirings
, 2002
"... Abstract. We consider the following matrix reachability problem: given r square matrices with entries in a semiring, is there a product of these matrices which attains a prescribed matrix? We define similarly the vector (resp. scalar) reachability problem, by requiring that the matrix product, actin ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Abstract. We consider the following matrix reachability problem: given r square matrices with entries in a semiring, is there a product of these matrices which attains a prescribed matrix? We define similarly the vector (resp. scalar) reachability problem, by requiring that the matrix product
Results 1  10
of
2,485