A compositional trace-based semantics for probabilistic automata
- 1 January 1995
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 234-248
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Formal verification of timed properties of randomized distributed algorithms1995
- Liveness in timed and untimed systemsLecture Notes in Computer Science, 1994
- Proving time bounds for randomized distributed algorithms1994
- Forward and backward simulations for timing-based systems1992
- Fast randomized consensus using shared memoryJournal of Algorithms, 1990
- Defining livenessInformation Processing Letters, 1985
- Automatic verification of probabilistic concurrent finite state programs1985
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984
- Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols1983
- Probabilistic automataInformation and Control, 1963