Bisimulation through probabilistic testing
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Process algebra for performance evaluation
Theoretical Computer Science
Compositional Methods for Probabilistic Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Compositional Verification of Probabilistic Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
MEC: A System for Constructing and Analysing Transition Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Synchronous and Bidirectional Component Interfaces
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Process Algebra with Probabilistic Choice
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Interface theories with component reuse
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Compositional Abstraction for Stochastic Systems
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Modal interfaces: unifying interface automata and modal specifications
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Using Stochastic Comparison for Efficient Model Checking of Uncertain Markov Chains
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
Timed I/O automata: a complete specification theory for real-time systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Three-valued abstraction for continuous-time Markov chains
CAV'07 Proceedings of the 19th international conference on Computer aided verification
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Model-checking ω-regular properties of interval Markov chains
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Compositional Design Methodology with Constraint Markov Chains
QEST '10 Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of Systems
Abstract probabilistic automata
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
The embedded systems design challenge
FM'06 Proceedings of the 14th international conference on Formal Methods
Don’t know in probabilistic systems
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
New results on timed specifications
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
| Hi-index | 0.00 |
This paper studies compositional reasoning theories for stochastic systems. A specification theory combines notions of specification and implementation with satisfaction and refinement relations, and a set of operators that together support stepwise design. One of the first behavioral specification theories introduced for stochastic systems is the one of Interval Markov Chains (IMCs), which are Markov Chains whose probability distributions are replaced by a conjunction of intervals. In this paper, we show that IMCs are not closed under conjunction, which gives a formal proof of a conjecture made in several recent works. In order to leverage this problem, we suggested to work with Constraint Markov Chains (CMCs) that is another specification theory where intervals are replaced with general constraints. Contrary to IMCs, one can show that CMCs enjoy the closure properties of a specification theory. In addition, we propose aggressive abstraction procedures for CMCs. Such abstractions can be used either to combat the state-space explosion problem, or to simplify complex constraints. In particular, one can show that, under some assumptions, the behavior of any CMC can be abstracted by an IMC. Finally, we propose an algorithm for counter-example generation, in case a refinement of two CMCs does not hold. We present a tool that implements our results. Implementing CMCs is a complex process and relies on recent advances made in decision procedures for theory of reals.