Foundations of Software Science and Computation Structures
From MaRDI portal
Publication:5308456
DOI10.1007/b95995zbMath1126.68447OpenAlexW3105029025MaRDI QIDQ5308456
Paweł Sobociński, Stephen Lack
Publication date: 28 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95995
Related Items (42)
Van Kampen Colimits as Bicolimits in Span ⋮ Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation ⋮ Allegories and Collagories for Transformation of Graph Structures Considered as Coalgebras ⋮ Unnamed Item ⋮ Parallelism in AGREE Transformations ⋮ Adhesive and quasiadhesive categories ⋮ Amalgamation of domain specific languages with behaviour ⋮ Finite limits and anti-unification in substitution categories ⋮ Fundamentals of compositional rewriting theory ⋮ Spined categories: generalizing tree-width beyond graphs ⋮ Computational category-theoretic rewriting ⋮ Unfolding Graph Transformation Systems: Theory and Applications to Verification ⋮ Explicit State Model Checking for Graph Grammars ⋮ Arboreal categories and equi-resource homomorphism preservation theorems ⋮ Graph rewriting and relabeling with PBPO\(^+\): a unifying theory for quasitoposes ⋮ From Algebraic Graph Transformation to Adhesive HLR Categories and Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Workshop on Petri Nets and Graph Transformations ⋮ Grammar Morphisms and Weakly Adhesive Categories ⋮ Process Construction and Analysis for Workflows Modelled by Adhesive HLR Systems with Application Conditions ⋮ Integration of categorical frameworks: Rule-based refinement and hierarchical composition for components ⋮ Construction and properties of adhesive and weak adhesive high-level replacement categories ⋮ Spans of cospans ⋮ Reasoning with graph constraints ⋮ Collagories: relation-algebraic reasoning for gluing constructions ⋮ Decorated Corelations ⋮ A Logic of Graph Constraints ⋮ A categorial approach to reaction systems: first steps ⋮ Single pushout rewriting in comprehensive systems of graph-like structures ⋮ New wide classes of weakly Mal'tsev categories ⋮ Moment Semantics for Reversible Rule-Based Systems ⋮ Unnamed Item ⋮ Comprehensive systems: a formal foundation for multi-model consistency management ⋮ Van Kampen Colimits and Path Uniqueness ⋮ Coarse-Graining Open Markov Processes ⋮ Connector Rewriting with High-Level Replacement Systems ⋮ Directed Bigraphs ⋮ Rule-based transformation of graph rewriting rules: towards higher-order graph grammars ⋮ Concurrency theorems for non-linear rewriting theories ⋮ Graph rewriting and relabeling with PBPO\textsuperscript{+}
This page was built for publication: Foundations of Software Science and Computation Structures
