Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
From MaRDI portal
Publication:843097
DOI10.1016/j.tcs.2009.06.010zbMath1186.68315MaRDI QIDQ843097
Publication date: 29 September 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.010
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N17: Logic programming
Related Items
A network-conscious \(\pi\)-calculus and its coalgebraic semantics, Relational presheaves, change of base and weak simulation, Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models for name-passing processes: Interleaving and causal
- Symbolic bisimulations
- Declarative modeling of the operational behavior of logic languages
- The chemical abstract machine
- A calculus of mobile processes. I
- On bisimulations for the asynchronous \(\pi\)-calculus
- A fully abstract model for the \(\pi\)-calculus.
- Mobile ambients
- Universal coalgebra: A theory of systems
- Locating reaction with 2-categories
- A theory of bisimulation for the \(\pi\)-calculus
- Pure bigraphs: structure and dynamics
- Explicit fusions
- Local Bigraphs and Confluence: Two Conjectures
- Bigraphs and transitions
- Bisimulation by Unification*
- Transition systems, link graphs and Petri nets
- Behavioral theory for mobile ambients
- A Category of Explicit Fusions
- Coalgebraic Models for Reactive Systems
- Reactive Systems over Directed Bigraphs
- Deriving Structural Labelled Transitions for Mobile Ambients
- Process Bisimulation Via a Graphical Encoding
- Reactive Systems, Barbed Semantics, and the Mobile Ambients
- An interactive semantics of logic programming
- Compositional semantics for open Petri nets based on deterministic processes
- Handbook of Graph Grammars and Computing by Graph Transformation
- Making the Unobservable, Unobservable
- Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
- Barbed bisimulation
- RPO, Second-Order Contexts, and λ-Calculus
- Symbolic Semantics Revisited
- Algebra and Coalgebra in Computer Science
- Foundations of Software Science and Computational Structures
- Lectures on Concurrency and Petri Nets
- CONCUR 2005 – Concurrency Theory
- A coalgebraic presentation of structured transition systems
- From rewrite rules to bisimulation congruences
