A Characterisation of Expressivity for Coalgebraic Bisimulation and Simulation

DOI10.1016/j.entcs.2012.08.021zbMath1343.03053OpenAlexW2067704480WikidataQ113318067 ScholiaQ113318067MaRDI QIDQ3178292

Toby Wilkinson

Publication date: 8 July 2016

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2012.08.021

zbMATH Keywords

simulationcoalgebrabisimulationpreordered setenriched logical connection

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical logic, topoi (03G30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simulations in coalgebra
• Stone coalgebras
• Enriched logical connections
• A modular approach to defining and characterising notions of simulation
• Internal Models for Coalgebraic Modal Logics
• Similarity Quotients as Final Coalgebras
• Exemplaric Expressivity of Modal Logics
• Testing Semantics: Connecting Processes and Process Logics
• Coalgebraic Modal Logic Beyond Sets
• Algebra and Coalgebra in Computer Science

This page was built for publication: A Characterisation of Expressivity for Coalgebraic Bisimulation and Simulation