GSOS for probabilistic transition systems

DOI10.1016/S1571-0661(04)80358-XzbMath1270.68204OpenAlexW2886203768MaRDI QIDQ2842551

Falk Bartels

Publication date: 15 August 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80358-x

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (11)

A general SOS theory for the specification of probabilistic transition systems ⋮ SOS formats and meta-theory: 20 years after ⋮ Unnamed Item ⋮ Category theory for operational semantics ⋮ 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 ⋮ Non Expansive ε-Bisimulations ⋮ Bialgebraic Methods in Structural Operational Semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: GSOS for probabilistic transition systems