Abstract probabilistic automata

Authors:
Benoît Delahaye;Joost-Pieter Katoen;Kim G. Larsen;Axel Legay;Mikkel L. Pedersen;Falak Sher;Andrzej Wasowski
Affiliations:
INRIA, IRISA, Rennes, France;RWTH Aachen University, Software Modeling and Verification Group, Germany;Aalborg University, Denmark;INRIA, IRISA, Rennes, France;Aalborg University, Denmark;RWTH Aachen University, Software Modeling and Verification Group, Germany;IT University of Copenhagen, Denmark
Venue:
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Year:
2011

Citing 16
Cited 5

Probabilistic simulations for probabilistic processes

Nordic Journal of Computing
Decision Algorithms for Probabilistic Bisimulation

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Modal Specifications

Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
A Probabilistic Extension of UML Statecharts

FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Axiomatization of Trace Semantics for Stochastic Nondeterministic Processes

QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Switched PIOA: parallel composition via distributed scheduling

Theoretical Computer Science - Components and objects
A testing scenario for probabilistic processes

Journal of the ACM (JACM)
Analyzing Security Protocols Using Time-Bounded Task-PIOAs

Discrete Event Dynamic Systems
Compositional Abstraction for Stochastic Systems

FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Modal interfaces: unifying interface automata and modal specifications

EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Modal I/O automata for interface and product line theories

ESOP'07 Proceedings of the 16th European conference on Programming
Three-valued abstraction for continuous-time Markov chains

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Compositional Design Methodology with Constraint Markov Chains

QEST '10 Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of Systems
Probability and nondeterminism in operational models of concurrency

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Don’t know in probabilistic systems

SPIN'06 Proceedings of the 13th international conference on Model Checking Software

New results for Constraint Markov Chains

Performance Evaluation
Compositional abstraction techniques for probabilistic automata

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
A proof system for compositional verification of probabilistic concurrent processes

FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Refinement and difference for probabilistic automata

QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Abstract Probabilistic Automata

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Probabilistic Automata (PAs) are a widely-recognized mathematical framework for the specification and analysis of systems with non-deterministic and stochastic behaviors. This paper proposes Abstract Probabilistic Automata (APAs), that is a novel abstraction model for PAs. In APAs uncertainty of the non-deterministic choices is modeled by may/must modalities on transitions while uncertainty of the stochastic behaviour is expressed by (underspecified) stochastic constraints. We have developed a complete abstraction theory for PAs, and also propose the first specification theory for them. Our theory supports both satisfaction and refinement operators, together with classical stepwise design operators. In addition, we study the link between specification theories and abstraction in avoiding the state-space explosion problem.