scientific article; zbMATH DE number 7438559

zbMath1476.68170arXiv1508.06710MaRDI QIDQ5013870

Matias David Lee, Daniel Gebler, Pedro R. D'Argenio

Publication date: 3 December 2021

Full work available at URL: https://arxiv.org/abs/1508.06710

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic logical characterization
• Transition system specifications with negative premises
• SOS formats and meta-theory: 20 years after
• Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
• Bisimulation through probabilistic testing
• Structured operational semantics and bisimulation as a congruence
• A conservative look at operational semantics with variable binding
• The meaning of negative premises in transition system specifications. II
• A structural approach to operational semantics
• Rooted branching bisimulation as a congruence
• GSOS for probabilistic transition systems
• Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation
• Probabilistic bisimulation as a congruence
• Bisimulations for non-deterministic labelled Markov processes
• Bisimulation can't be traced
• The meaning of negative premises in transition system specifications
• Foundations of Software Science and Computational Structures