Non-strongly stable orders also define interesting simulation relations

DOI10.1007/978-3-642-03741-2_16MaRDI QIDQ2888489zbMATH OpenOpenAlexFDO

Authors I. Fábregas, David de Frutos Escrig, Miguel Palomino

Publication date 1 June 2012

Published in Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL https://eprints.ucm.es/20652/1/Frutos07oficial.pdf

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Simulations in coalgebra
• Simulations in coalgebra
• Coalgebraic simulations and congruences
• Weak bisimulations for coalgebras over ordered functors
• On logics for coalgebraic simulation

Cites work

• A framework based on implementation relations for implementing LOTOS specifications
• Bisimulation can't be traced
• Bisimulation through probabilistic testing
• On the Unification of Process Semantics: Observational Semantics
• Simulations in coalgebra
• Simulations in coalgebra
• Structured operational semantics and bisimulation as a congruence
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.

Cited in

(7)

• Simulations in coalgebra
• Characteristic formulae for fixed-point semantics: a general framework
• Coalgebraic simulations and congruences
• New Bisimulation Semantics for Distributed Systems
• Subtyping context-free session types
• Subtyping context-free session types
• Simulations in coalgebra

This page was built for publication: Non-strongly stable orders also define interesting simulation relations

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