Results 11 to 20 of about 24,416 (155)
A coalgebraic view on reachability [PDF]
Commentationes Mathematicae Universitatis Carolinae, 2020 Coalgebras for an endofunctor provide a category-theoretic framework for modeling a wide range of state-based systems of various types. We provide an iterative construction of the reachable part of a given pointed coalgebra that is inspired by and resembles the standard breadth-first search procedure to compute the reachable part of a graph.
Thorsten, wissmann +3 more
openaire +2 more sources
Robust Weighted Timed Automata and Games [PDF]
, 2013 Weighted timed automata extend timed automata with cost variables that can be used to model the evolution of various quantities. Although cost-optimal reachability is decidable (in polynomial space) on this model, it becomes undecidable on weighted ...
Markey, Nicolas +5 more
core +1 more source
Temporal reachability graphs [PDF]
Proceedings of the 18th annual international conference on Mobile computing and networking, 2012 In proceedings ACM Mobicom ...
Whitbeck, John +3 more
openaire +4 more sources
On Reachability and Spatial Reachability in Fragments of BioAmbients
Electronic Notes in Theoretical Computer Science, 2007 AbstractBioAmbients is a powerful model for representing various aspects of living cells. The model provides a rich set of operations for the movement and interaction of molecules. The richness of the language motivates the study of dialects of the full model and the comparison with other computational models.
DELZANNO, GIORGIO, MONTAGNA R.
openaire +4 more sources
On Higher-Order Reachability Games Vs May Reachability
, 2022 We consider the reachability problem for higher-order functional programs and study the relationship between reachability games (i.e., the reachability problem for programs with angelic and demonic nondeterminism) and may-reachability (i.e., the reachability problem for programs with only angelic nondeterminism).
Kazuyuki Asada +2 more
openaire +3 more sources
On the Complexity of L-reachability [PDF]
Fundamenta Informaticae, 2014 We initiate a complexity theoretic study of the language based graph reachability problem (L–REACH) : Fix a language L. Given a graph whose edges are labelled with alphabet symbols of the language L and two special vertices s and t, test if there is path P from s to t in the graph such that the concatenation of the symbols seen from s to t in the path ...
Balagopal Komarath +2 more
openaire +3 more sources
Reinforcing reachable routes [PDF]
Computer Networks, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Srinidhi Varadarajan +2 more
openaire +3 more sources
Sampling-based Polytope Calculus for Reachability Analysis of Dynamical Systems [PDF]
, 2023 openPolytope calculus is a powerful and useful tool for generating and computing polytopes that find use in many applications, from dynamical systems to higher algebra and graph theory.
ZANARINI, DAVIDE
core
Reachability Problems for PAMs [PDF]
, 2016 Piecewise affine maps (PAMs) are frequently used as a reference model to show the openness of the reachability questions in other systems. The reachability problem for one-dimentional PAM is still open even if we define it with only two intervals. As the main contribution of this paper we introduce new techniques for solving reachability problems based
Oleksiy Kurganskyy, Igor Potapov
openaire +3 more sources
Completely Reachable Automata [PDF]
, 2016 We present a few results and several open problems concerning complete deterministic finite automata in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word.
Eugenija A. Bondar +1 more
openaire +6 more sources