Computing Behavioral Relations for Probabilistic Concurrent Systems

DOI10.1007/978-3-662-45489-3_5zbMath1426.68183OpenAlexW106195609MaRDI QIDQ2937734

Daniel Gebler, Andrea Turrini, Vahid Hashemi

Publication date: 12 January 2015

Published in: Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-45489-3_5

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Deciding probabilistic automata weak bisimulation: theory and practice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interactive Markov chains. And the quest for quantified quality
• CCS expressions, finite state processes, and three problems of equivalence
• A logic for reasoning about time and reliability
• The many facets of linear programming
• On the semantics of Markov automata
• Deciding bisimilarity and similarity for probabilistic processes.
• Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states
• Comparative branching-time semantics for Markov chains
• Branching bisimulation for probabilistic systems: characteristics and decidability
• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
• A General Framework for Probabilistic Characterizing Formulae
• Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time
• Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
• Deciding Simulations on Probabilistic Automata
• A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
• Concurrency and Composition in a Stochastic World
• Three Partition Refinement Algorithms
• A new approach to the maximum-flow problem
• A Fast Parametric Maximum Flow Algorithm and Applications
• An Introduction to Decision Theory
• A Semantics for Every GSPN
• The Quest for Minimal Quotients for Probabilistic Automata
• Deciding Bisimilarities on Distributions
• Continuous-time probabilistic automata
• Model-checking continuous-time Markov chains
• Probability and Nondeterminism in Operational Models of Concurrency
• Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
• Cost Preserving Bisimulations for Probabilistic Automata

This page was built for publication: Computing Behavioral Relations for Probabilistic Concurrent Systems