GSOS for probabilistic transition systems
From MaRDI portal
Publication:2842551
DOI10.1016/S1571-0661(04)80358-XzbMath1270.68204MaRDI QIDQ2842551
Publication date: 15 August 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Non Expansive ε-Bisimulations, Category theory for operational semantics, SOS formats and meta-theory: 20 years after, Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes, Bialgebraic methods and modal logic in structural operational semantics, Rule Formats for Timed Processes, GSOS for probabilistic transition systems, Well-behaved Translations between Structural Operational Semantics, Bialgebraic Methods in Structural Operational Semantics
Cites Work
- Bisimulation through probabilistic testing
- Universal coalgebra: A theory of systems
- Reactive, generative, and stratified models of probabilistic processes
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- GSOS for probabilistic transition systems
- On the bisimulation proof method
- Bisimulation can't be traced
- Generalised coinduction
- A final coalgebra theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item