A Proof System for Compositional Verification of Probabilistic Concurrent Processes

DOI10.1007/978-3-642-37075-5_11zbMath1260.68273OpenAlexW1568477142MaRDI QIDQ4910418

Matteo Mio, Alex K. Simpson

Publication date: 18 March 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37075-5_11

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) 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

SOS specifications for uniformly continuous operators, Back to the format: a survey on SOS for probabilistic processes, Compositional bisimulation metric reasoning with Probabilistic Process Calculi, Cyclic Arithmetic Is Equivalent to Peano Arithmetic, Probabilistic divide \& congruence: branching bisimilarity, Unnamed Item