Concise graphs and functional bisimulations

MaRDI QIDQ2847417zbMATH OpenFDO

Authors Ling Cheung, Jesse Hughes

Publication date 9 September 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066104050972

Mathematics Subject Classification ID

Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Convenient category of processes and simulations I: Modulo strong bisimilarity
• Decision procedures and graph reductions for bisimulation equivalences part 1
• scientific article; zbMATH DE number 3898224
• On the bisimulation proof method
• Tree-functors, determinacy and bisimulations

Cited in

(3)

• Bisimilarity in term graph rewriting.
• Bisimulations on Data Graphs
• scientific article; zbMATH DE number 7437711 (Why is no real title available?)

This page was built for publication: Concise graphs and functional bisimulations

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