Processes and unfoldings: concurrent computations in adhesive categories
From MaRDI portal
Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Categories of machines, automata (18B20) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- A framework for the verification of infinite-state graph transformation systems
- Adhesive and quasiadhesive categories
- Algebraic approach to single-pushout graph transformation
- Categories of partial maps
- Contextual Petri nets, asymmetric event structures, and processes
- Diagnosis of asynchronous discrete-event systems: a net unfolding approach
- Domain and event structure semantics for Petri nets with read and inhibitor arcs
- Exponentiable morphisms, partial products and pullback complements
- Finitary \(\mathcal{M}\)-adhesive categories
- Fundamentals of algebraic graph transformation
- Hereditary pushouts reconsidered
- scientific article; zbMATH DE number 1840601 (Why is no real title available?)
- On the semantics of place/transition Petri nets
- Parallelism and concurrency in high-level replacement systems
- Petri nets, algebras, morphisms, and compositionality
- Sesqui-Pushout Rewriting
- Subobject transformation systems
- Toposes Are Adhesive
- Unfolding Grammars in Adhesive Categories
- Unfolding semantics of graph transformation
- Unfolding-based diagnosis of systems with an evolving topology
- Van Kampen colimits as bicolimits in Span
Cited in
(6)- A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications
- Unfolding Grammars in Adhesive Categories
- scientific article; zbMATH DE number 7453970 (Why is no real title available?)
- Foundations of Software Science and Computation Structures
- Coreflective concurrent semantics for single-pushout graph grammars.
- Unfolding semantics of graph transformation
This page was built for publication: Processes and unfoldings: concurrent computations in adhesive categories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740371)
