Characterizing contrasimilarity through games, modal logic, and complexity

DOI10.1016/J.IC.2024.105191MaRDI QIDQ6614880

Luisa Montanari, Benjamin Bisping

Publication date: 8 October 2024

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

game theorymodal logicsbehavioral equivalence

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• CCS expressions, finite state processes, and three problems of equivalence
• Impossible futures and determinism
• A hierarchy of equivalences for asynchronous calculi
• Coupled similarity: the first 32 years
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• Certifiably Sound Parallelizing Transformations
• Introduction to Bisimulation and Coinduction
• A Context-Free Process as a Pushdown Automaton
• Algebraic laws for nondeterminism and concurrency
• Bisimulation, modal logic and model checking games
• A game characterization for contrasimilarity

This page was built for publication: Characterizing contrasimilarity through games, modal logic, and complexity

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