Computing Behavioral Relations for Probabilistic Concurrent Systems

• Published in: Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems pp. 117 - 155
• Main Authors: Gebler, Daniel, Hashemi, Vahid, Turrini, Andrea
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2014
• Series: Lecture Notes in Computer Science
• Subjects: Discrete Time Markov Chain; Label Transition System; Markov Decision Process; Model Check; Step Condition
• ISBN: 9783662454886; 3662454882
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-662-45489-3_5

Behavioral equivalences and preorders are fundamental notions to formalize indistinguishability of transition systems and provide means to abstraction and refinement. We survey a collection of models used to represent concurrent probabilistic real systems, the behavioral equivalences and preorders they are equipped with and the corresponding decision algorithms. These algorithms follow the standard refinement approach and they improve their complexity by taking advantage of the efficient algorithms developed in the optimization community to solve optimization and flow problems.