Sciweavers

Share
CADE
2012
Springer
8 years 28 days ago
Taming Past LTL and Flat Counter Systems
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
Stéphane Demri, Amit Kumar Dhar, Arnaud San...
CORR
2011
Springer
147views Education» more  CORR 2011»
9 years 5 months ago
On Reachability for Hybrid Automata over Bounded Time
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target locat...
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, J...
ECCC
2010
143views more  ECCC 2010»
9 years 8 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran
MFCS
2010
Springer
9 years 9 months ago
Robust Computations with Dynamical Systems
Abstract. In this paper we discuss the computational power of Lipschitz dynamical systems which are robust to infinitesimal perturbations. Whereas the study in [1] was done only f...
Olivier Bournez, Daniel S. Graça, Emmanuel ...
FUIN
2010
88views more  FUIN 2010»
9 years 9 months ago
Solvability of the Halting and Reachability Problem for Binary 2-tag Systems
In this paper we will provide a detailed proof of the solvability of the halting and reachability problem for binary 2-tag systems. We will furthermore prove that an important sub...
Liesbeth De Mol
TCS
1998
9 years 10 months ago
Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...
Javier Esparza
ACTA
2010
104views more  ACTA 2010»
9 years 10 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
FSTTCS
2008
Springer
9 years 11 months ago
Analyzing Asynchronous Programs with Preemption
ABSTRACT. Multiset pushdown systems have been introduced by Sen and Viswanathan as an adequate model for asynchronous programs where some procedure calls can be stored as tasks to ...
Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Toui...
MCU
2007
123views Hardware» more  MCU 2007»
9 years 12 months ago
Study of Limits of Solvability in Tag Systems
Abstract. In this paper we will give an outline of the proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a deletion number v = 2. Thi...
Liesbeth De Mol
DLT
2008
9 years 12 months ago
When Is Reachability Intrinsically Decidable?
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 computabl...
Barbara F. Csima, Bakhadyr Khoussainov
books