Relational presheaves, change of base and weak simulation
From MaRDI portal
Publication:2341703
DOI10.1016/j.jcss.2014.12.007zbMath1327.68170OpenAlexW2021791570MaRDI QIDQ2341703
Publication date: 28 April 2015
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2014.12.007
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Presheaves and sheaves, stacks, descent conditions (category-theoretic aspects) (18F20)
Related Items
Bisimulation maps in presheaf categories, Unnamed Item, Categorical specification and implementation of replicated data types
Cites Work
- Simulations in coalgebra
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
- A calculus of mobile processes. II
- Locating reaction with 2-categories
- Modular structural operational semantics
- A structural approach to operational semantics
- Bisimulation from open maps
- Deriving structural labelled transitions for mobile ambients
- Pure bigraphs: structure and dynamics
- Connector algebras for C/E and P/T nets' interactions
- An Exercise on Transition Systems
- Relational Presheaves as Labelled Transition Systems
- Similarity Quotients as Final Coalgebras
- Relating coalgebraic notions of bisimulation
- A Connector Algebra for P/T Nets Interactions
- Generic Forward and Backward Simulations II: Probabilistic Simulation
- Quantales, observational logic and process semantics
- Introduction to bicategories
- A final coalgebra theorem
- CONCUR 2004 - Concurrency Theory
- Generic Trace Semantics via Coinduction
- Relational and partial variable sets and basic predicate logic
- Generic Forward and Backward Simulations
- CONCUR 2005 – Concurrency Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
