Quantitative program logic and expected time bounds in probabilistic distributed algorithms.
From MaRDI portal
Publication:1603711
DOI10.1016/S0304-3975(01)00049-4zbMath1050.68024MaRDI QIDQ1603711
Publication date: 15 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
68N99: Theory of software
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The temporal logic of branching time
- Results on the propositional \(\mu\)-calculus
- Verification of multiprocess probabilistic protocols
- A logic for reasoning about time and reliability
- Probabilistic models for the guarded command language
- Finite state Markovian decision processes
- Verification of Probabilistic Programs
- Programming as a Discipline of Mathematical Nature
- Temporal logics for the specification of performance and reliability
- Proving time bounds for randomized distributed algorithms