Bisimilarity congruences for open terms and term graphs via tile logic
From MaRDI portal
(Redirected from Bisimilarity congruences for open terms and term graphs via tile logic)
Recommendations
- Bisimilarity in term graph rewriting.
- A characterisation of open bisimilarity using an intuitionistic modal logic
- A characterisation of open bisimilarity using an intuitionistic modal logic
- scientific article; zbMATH DE number 1231589
- scientific article; zbMATH DE number 1231603
- Bisimulation equivalences for graph grammars
- Bisimulation and coverings for graphs and hypergraphs
- Bisimilarity for paraconsistent description logics
- The Bisimulation Problem for Equational Graphs of Finite Out-Degree
- On bisimulations for description logics
Cited in
(13)- Dynamic connectors for concurrency
- Rewriting logic: Roadmap and bibliography
- Observational congruences for dynamically reconfigurable tile systems
- Bisimilarity of open terms.
- Bisimilarity of open terms in stream GSOS
- SMT-based generation of symbolic automata
- Notions of bisimulation and congruence formats for SOS with data
- Comparing higher-order encodings in logical frameworks and tile logic
- Comparing cospan-spans and tiles via a Hoare-style process calculus
- Models of Computation: A Tribute to Ugo Montanari’s Vision
- scientific article; zbMATH DE number 1231603 (Why is no real title available?)
- Open ended systems, dynamic bisimulation and tile logic
- GETGRATS: a summary of scientific results (with annotated bibliography)
This page was built for publication: Bisimilarity congruences for open terms and term graphs via tile logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536607)