Results 21 to 30 of about 24,416 (155)
Performance analysis of probabilistic timed automata using digital clocks [PDF]
, 2006 Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a modelling formalism suitable for describing formally both nondeterministic and probabilistic aspects of real-time systems, and is amenable to
Kwiatkowska, M. +4 more
core +1 more source
Reachability and Top-k Reachability Queries with Transfer Decay
CoRR, 2021 The prevalence of location tracking systems has resulted in large volumes of spatiotemporal data generated every day. Addressing reachability queries on such datasets is important for a wide range of applications (surveillance, public health, social networks, etc.) A spatiotemporal reachability query identifies whether a physical item (or information ...
Elena Vladislavivna Strzheletska +1 more
openaire +3 more sources
Optimization-Based Methods for Nonlinear and Hybrid Systems Verification [PDF]
, 2005 Complex behaviors that can be exhibited by hybrid systems make the verification of such systems both important and challenging. Due to the infinite number of possibilities taken by the continuous state and the uncertainties in the system, exhaustive ...
Prajna, Stephen
core +1 more source
The Language Theory of Bounded Context-Switching
, 2010 Concurrent compositions of recursive programs with finite data are a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form of reachability has become popular in the formal verification ...
Salvatore La Torre +8 more
core +2 more sources
Non-Elementary Complexities for Branching VASS, MELL, and Extensions [PDF]
, 2014 We study the complexity of reachability problems on branching extensions of vector addition systems, which allows us to derive new non-elementary complexity bounds for fragments and variants of propositional linear logic.
Ranko Lazic +3 more
core +1 more source
On computing minimal realizations of periodic descriptor systems [PDF]
, 2007 : We propose computationally efficient and numerically reliable algorithms to compute minimal realizations of periodic descriptor systems. The main computational tool employed for the structural analysis of periodic descriptor systems (i.e., reachability
Andras Varga, Varga, Andreas
core +1 more source
Subcubic certificates for CFL reachability [PDF]
, 2022 Many problems in interprocedural program analysis can be modeled as the context-free language (CFL) reachability problem on graphs and can be solved in cubic time.
Majumdar, R. +5 more
core +2 more sources
Electronic Notes in Theoretical Computer Science, 1997 AbstractThis paper is an approach to combine the reachability problem with semantic notions like bisimulation equivalence. It deals with questions of the following form: Is there a reachable state that is bisimulation equivalent to a given state ? Here we show some decidability results for process algebras and Petri nets.
openaire +2 more sources
Performance Guarantees for Distributed Reachability Queries [PDF]
, 2012 In the real world a graph is often fragmented and distributed across different sites. This highlights the need for evaluating queries on distributed graphs.
Wang, Xin +2 more
core
History−Register Automata [PDF]
, 2013 Programs with dynamic allocation are able to create and use an unbounded number of fresh resources, such as references, objects, files, etc. We propose History-Register Automata (HRA), a new automata-theoretic formalism for modelling such programs. HRAs
Tzevelekos, Nikos +5 more
core +1 more source