Pages that link to "Item:Q5308448"

The following pages link to Foundations of Software Science and Computation Structures (Q5308448):

Displaying 29 items.

• Configuration logics: modeling architecture styles (Q347359) (← links)
• Synthesising CCS bisimulation using graph rewriting (Q1004288) (← links)
• Locating reaction with 2-categories (Q1770420) (← links)
• Observational congruences for dynamically reconfigurable tile systems (Q1782000) (← links)
• Bisimilarity in term graph rewriting. (Q1854321) (← links)
• A calculus of concurrent graph-rewriting processes (Q2291821) (← links)
• A semantic framework for open processes (Q2463561) (← links)
• A general framework for types in graph rewriting (Q2581012) (← links)
• Deriving bisimulation congruences: a 2-categorical approach (Q2842606) (← links)
• G-reactive systems as coalgebras (Q2864375) (← links)
• Connector rewriting with high-level replacement systems (Q2866320) (← links)
• Adhesive DPO parallelism for monic matches (Q2867888) (← links)
• A coalgebraic theory of reactive systems (Q2870200) (← links)
• Van Kampen Colimits as Bicolimits in Span (Q2888497) (← links)
• Confluence of Graph Rewriting with Interfaces (Q2988637) (← links)
• Explicit State Model Checking for Graph Grammars (Q3507360) (← links)
• Network Applications of Graph Bisimulation (Q3540393) (← links)
• Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts (Q3540403) (← links)
• Open Petri Nets: Non-deterministic Processes and Compositionality (Q3540404) (← links)
• Deriving Bisimulation Congruences with Borrowed Contexts (Q3612482) (← links)
• Bisimulations on Data Graphs (Q4605201) (← links)
• (Q5028460) (← links)
• String diagram rewrite theory II: Rewriting with symmetric monoidal structure (Q5058366) (← links)
• String Diagram Rewrite Theory I: Rewriting with Frobenius Structure (Q5066951) (← links)
• Adhesive and quasiadhesive categories (Q5313719) (← links)
• Behavior-Preserving Simulation-to-Animation Model and Rule Transformations (Q5403459) (← links)
• Deriving Bisimulation Congruences in the Presence of Negative Application Conditions (Q5458376) (← links)
• String diagram rewrite theory III: Confluence with and without Frobenius (Q5879265) (← links)
• From rewrite rules to bisimulation congruences (Q5958468) (← links)