Confluence Reduction for Probabilistic Systems

DOI10.1007/978-3-642-19835-9_29zbMath1316.68077arXiv1011.2314OpenAlexW2131603512WikidataQ62047461 ScholiaQ62047461MaRDI QIDQ3000663

Mark Timmer, Jaco van de Pol, Mariëlle I. A. Stoelinga

Publication date: 19 May 2011

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.2314

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) 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 (5)

Layered reasoning for randomized distributed algorithms ⋮ A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time ⋮ Confluence Reduction for Probabilistic Systems ⋮ Confluence reduction for Markov automata ⋮ A linear process-algebraic format with data for probabilistic automata

Cites Work

• Confluence for process verification
• Confluence Reduction for Probabilistic Systems
• Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
• State Space Reduction of Linear Processes Using Control Flow Reconstruction
• Branching time and abstraction in bisimulation semantics
• Computer Aided Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Confluence Reduction for Probabilistic Systems