Results 21 to 30 of about 6,312 (121)
Counterexample Generation in Probabilistic Model Checking [PDF]
, 2009 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]
, 2018 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
, 2013 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
, 2007 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
Negotiating the Probabilistic Satisfaction of Temporal Logic Motion Specifications [PDF]
, 2013 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
LTL Control in Uncertain Environments with Probabilistic Satisfaction Guarantees [PDF]
, 2011 We present a method to generate a robot control strategy that maximizes the probability to accomplish a task. The task is given as a Linear Temporal Logic (LTL) formula over a set of properties that can be satisfied at the regions of a partitioned ...
Belta, Calin +3 more
core +1 more source
Stability-mediated epistasis constrains the evolution of an influenza protein. [PDF]
, 2013 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
Completeness of Flat Coalgebraic Fixpoint Logics
, 2010 Modal fixpoint logics traditionally play a central role in computer science, in particular in artificial intelligence and concurrency. The mu-calculus and its relatives are among the most expressive logics of this type.
Gastin, P. +3 more
core +1 more source
High-level Counterexamples for Probabilistic Automata [PDF]
, 2015 Providing compact and understandable counterexamples for violated system properties is an essential task in model checking. Existing works on counterexamples for probabilistic systems so far computed either a large set of system runs or a subset of the ...
Jansen, Nils +3 more
core +1 more source
Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes [PDF]
, 2013 We consider PML, the probabilistic version of Hennessy-Milner logic introduced by Larsen and Skou to characterize bisimilarity over probabilistic processes without internal nondeterminism.We provide two different interpretations for PML by considering ...
Bernardo, Marco +2 more
core +2 more sources