Computing Behavioral Relations for Probabilistic Concurrent Systems

DOI10.1007/978-3-662-45489-3_5MaRDI QIDQ2937734zbMATH OpenOpenAlexFDO

Authors Daniel Gebler, Vahid Hashemi, Andrea Turrini

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)

Recommendations

• Taming confusion for modeling and implementing probabilistic concurrent systems
• Introduction to Probabilistic Concurrent Systems
• Probability and Nondeterminism in Operational Models of Concurrency
• Bisimulation and cocongruence for probabilistic systems
• Modelling concurrent behaviours by commutativity and weak causality relations
• scientific article; zbMATH DE number 1476492
• An algebraic framework for defining random concurrent behaviours
• Probabilistic concurrent constraint programming
• scientific article; zbMATH DE number 3846853

Cites work

• A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
• A Fast Parametric Maximum Flow Algorithm and Applications
• A general framework for probabilistic characterizing formulae
• A logic for reasoning about time and reliability
• A new approach to the maximum-flow problem
• A semantics for every GSPN
• An Introduction to Decision Theory
• Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
• Branching bisimulation for probabilistic systems: characteristics and decidability
• CCS expressions, finite state processes, and three problems of equivalence
• Comparative branching-time semantics for Markov chains
• Concurrency and composition in a stochastic world
• Continuous-time probabilistic automata
• Cost preserving bisimulations for probabilistic automata
• Deciding bisimilarities on distributions
• Deciding bisimilarity and similarity for probabilistic processes.
• Deciding probabilistic automata weak bisimulation in polynomial time
• Deciding Simulations on Probabilistic Automata
• Dynamic programming and optimal control. Vol. 1.
• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
• scientific article; zbMATH DE number 3128787 (Why is no real title available?)
• scientific article; zbMATH DE number 3148886 (Why is no real title available?)
• scientific article; zbMATH DE number 5719844 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1296290 (Why is no real title available?)
• scientific article; zbMATH DE number 729460 (Why is no real title available?)
• scientific article; zbMATH DE number 1927574 (Why is no real title available?)
• scientific article; zbMATH DE number 1759621 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• scientific article; zbMATH DE number 5685899 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Interactive Markov chains. And the quest for quantified quality
• Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states
• Model-checking continuous-time Markov chains
• Network flows. Theory, algorithms, and applications.
• On the semantics of Markov automata
• Probabilistic bisimulation and simulation algorithms by abstract interpretation
• Probability and Nondeterminism in Operational Models of Concurrency
• The many facets of linear programming
• The quest for minimal quotients for probabilistic automata
• Three Partition Refinement Algorithms

Cited in

(4)

• Equivalence and preorder checking for finite-state systems
• Deciding probabilistic automata weak bisimulation: theory and practice
• Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
• The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2937734)