A game characterization for contrasimilarity

DOI10.4204/EPTCS.339.5MaRDI QIDQ6643746zbMATH OpenFDO

Authors Benjamin Bisping, Luisa Montanari

Publication date 26 November 2024

Full work available at URL https://doi.org/10.4204/EPTCS.339.5

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of game theory (91A80)

Recommendations

• Bisimulation, games, and logic
• Bisimulation, modal logic and model checking games
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Process equivalence problems as energy games
• Games for bisimulations and abstraction

Cites work

• A Context-Free Process as a Pushdown Automaton
• A game for linear-time-branching-time spectroscopy
• A hierarchy of equivalences for asynchronous calculi
• Analysing and comparing encodability criteria
• Bisimulation, modal logic and model checking games
• Certifiably Sound Parallelizing Transformations
• Coupled similarity: the first 32 years
• Games for bisimulations and abstraction
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• Impossible futures and determinism
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.

Cited in

(2)

• Characterizing contrasimilarity through games, modal logic, and complexity
• One energy game for the spectrum between branching bisimilarity and weak trace semantics

This page was built for publication: A game characterization for contrasimilarity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6643746)