Results 11 to 20 of about 6,408 (118)
Probabilistic CTL $$^{*}$$ : The Deductive Way [PDF]
Complex probabilistic temporal behaviours need to be guaranteed in robotics and various other control domains, as well as in the context of families of randomized protocols. At its core, this entails checking infinite-state probabilistic systems with respect to quantitative properties specified in probabilistic temporal logics.
Rayna Dimitrova +3 more
openalex +5 more sources
Towards Hierarchical Probabilistic CTL Model Checking: Theoretical Foundations
This study proposes a hierarchical probabilistic computation tree logic, HpCTL, which is an extension of the standard probabilistic computation tree logic pCTL, as a theoretical basis for hierarchical probabilistic CTL model checking. Hierarchical probabilistic model checking is a new paradigm that can appropriately verify hierarchical randomized (or ...
Norihiro Kamide, Yuki Yano
openalex +2 more sources
The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL
We investigate the satisfiability and finite satisfiability problem for probabilistic computation-tree logic (PCTL) where operators are not restricted by any step bounds. We establish decidability for several fragments containing quantitative operators and pinpoint the difficulties arising in more complex fragments where the decidability remains open.
Jan Křetínský, Alexej Rotar
openalex +5 more sources
A locative inconsistency-tolerant hierarchical probabilistic computation tree logic (LIHpCTL) is introduced in this paper to establish the logical foundation of a new model checking paradigm. This logic is an extension of several previously proposed extensions of the standard temporal logic known as CTL, which is widely used for model checking.
Norihiro Kamide, Juan Bernal
openalex +2 more sources
Counterexample Generation in Probabilistic Model Checking [PDF]
Providing evidence for the refutation of a property is an essential, if not the most important, feature of model checking. This paper considers algorithms for counterexample generation for probabilistic CTL formulae in discrete-time Markov chains ...
Damman, B., Han, T., Katoen, J.P.
core +5 more sources
Specification Patterns for Robotic Missions [PDF]
Mobile and general-purpose robots increasingly support our everyday life, requiring dependable robotics control software. Creating such software mainly amounts to implementing their complex behaviors known as missions.
Berger, Thorsten +4 more
core +2 more sources
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show that by suitably adapting the definition of coalgebraic bisimulation, one obtains a general and uniform account of the linear-time behaviour of a state in ...
Mio, Matteo, Simpson, Alexander
core +7 more sources
Negotiating the Probabilistic Satisfaction of Temporal Logic Motion Specifications [PDF]
We propose a human-supervised control synthesis method for a stochastic Dubins vehicle such that the probability of satisfying a specification given as a formula in a fragment of Probabilistic Computational Tree Logic (PCTL) over a set of environmental ...
Belta, Calin, Cizelj, Igor
core +1 more source
We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almost certainly eventually reaches either F or a state from which F can no ...
Abdulla, Parosh Aziz +2 more
core +4 more sources
Stability-mediated epistasis constrains the evolution of an influenza protein. [PDF]
John Maynard Smith compared protein evolution to the game where one word is converted into another a single letter at a time, with the constraint that all intermediates are words: WORD→WORE→GORE→GONE→GENE. In this analogy, epistasis constrains evolution,
Bloom, Jesse D +2 more
core +1 more source

