Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata

DOI10.1007/978-3-642-40663-8_2MaRDI QIDQ2849998zbMATH OpenOpenAlexFDO

Authors Christel Baier

Publication date 20 September 2013

Published in Algebraic Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40663-8_2

Mathematics Subject Classification ID

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

Recommendations

• Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
• Methods for quantitative analysis of probabilistic pushdown automata
• Analysis of probabilistic processes and automata theory
• Distribution, approximation and probabilistic model checking
• Probabilistic analysis of some distributed algorithms
• scientific article; zbMATH DE number 125893
• Verifying automata specification of distributed probabilistic real-time systems

Cited in

(4)

• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
• Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
• High-level modelling and efficient analysis of randomized protocols.

This page was built for publication: Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata

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