Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours

DOI10.1016/j.jlamp.2018.09.006zbMath1408.68101arXiv1810.07488OpenAlexW3103955647WikidataQ129081373 ScholiaQ129081373MaRDI QIDQ1633345

Nick Fischer, Robert J. van Glabbeek

Publication date: 19 December 2018

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

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

zbMATH Keywords

process algebraprobabilityrecursionaxiomatisation

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 (5)

On the probabilistic bisimulation spectrum with silent moves ⋮ Characteristic invariants in Hennessy-Milner logic ⋮ Probabilistic weak bisimulation and axiomatization for probabilistic models ⋮ Explicit Identifiers and Contexts in Reversible Concurrent Calculus ⋮ Preface to the special issue on open problems in concurrency theory

Cites Work

• Axiomatizations for probabilistic finite-state behaviors
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• A complete axiomatisation for observational congruence of finite-state behaviours
• Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time
• Testing Finitary Probabilistic Processes
• The Quest for Minimal Quotients for Probabilistic Automata
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours