Reactive systems, (semi-)saturated semantics and coalgebras on presheaves

DOI10.1016/J.TCS.2009.06.010zbMATH Open1186.68315OpenAlexW1970282061MaRDI QIDQ843097FDOQ843097

Authors: Filippo Bonchi, Ugo Montanari 

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

Recommendations

• A coalgebraic theory of reactive systems
• Coalgebraic Models for Reactive Systems
• Interaction and Observation: Categorical Semantics of Reactive Systems Trough Dialgebras
• A denotational theory of synchronous reactive systems
• A coalgebraic presentation of structured transition systems
• G-reactive systems as coalgebras
• scientific article; zbMATH DE number 1973127
• scientific article; zbMATH DE number 3919813
• A coalgebraic approach to the semantics of the ambient calculus

zbMATH Keywords

Petri netsreactive systemslogic programmingbehavioral equivalences

Mathematics Subject Classification ID

Logic programming (68N17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Symbolic Semantics Revisited
• Universal coalgebra: A theory of systems
• Title not available (Why is that?)
• Models for name-passing processes: Interleaving and causal
• The chemical abstract machine
• A calculus of mobile processes. I
• Title not available (Why is that?)
• An interactive semantics of logic programming
• Explicit fusions
• Barbed bisimulation
• Handbook of Graph Grammars and Computing by Graph Transformation
• Mobile ambients
• Pure bigraphs: structure and dynamics
• Title not available (Why is that?)
• A fully abstract model for the \(\pi\)-calculus.
• Compositional semantics for open Petri nets based on deterministic processes
• Deriving Structural Labelled Transitions for Mobile Ambients
• Reactive Systems, Barbed Semantics, and the Mobile Ambients
• Title not available (Why is that?)
• Symbolic bisimulations
• A theory of bisimulation for the \(\pi\)-calculus
• On bisimulations for the asynchronous \(\pi\)-calculus
• CONCUR 2005 – Concurrency Theory
• Declarative modeling of the operational behavior of logic languages
• Relationally staged computations in calculi of mobile processes
• Bigraphs and transitions
• Behavioral theory for mobile ambients
• A Category of Explicit Fusions
• Coalgebraic Models for Reactive Systems
• A congruence for Petri nets
• A coalgebraic presentation of structured transition systems
• Local bigraphs and confluence: two conjectures (extended abstract)
• A compositional partial order semantics for Petri net components
• Title not available (Why is that?)
• Locating reaction with 2-categories
• Bisimulation by unification
• Transition systems, link graphs and Petri nets
• Reactive Systems over Directed Bigraphs
• Process Bisimulation Via a Graphical Encoding
• Title not available (Why is that?)
• Making the Unobservable, Unobservable
• Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
• RPO, Second-Order Contexts, and λ-Calculus
• Algebra and Coalgebra in Computer Science
• Foundations of Software Science and Computational Structures
• Lectures on Concurrency and Petri Nets
• From rewrite rules to bisimulation congruences

Cited In (13)

• A General Theory of Barbs, Contexts, and Labels
• Logic programming: laxness and saturation
• A denotational theory of synchronous reactive systems
• Coalgebraic Models for Reactive Systems
• What is a free name in a process algebra?
• A network-conscious \(\pi\)-calculus and its coalgebraic semantics
• Coalgebraic semantics for parallel derivation strategies in logic programming
• Exploiting parallelism in coalgebraic logic programming
• Interaction and Observation: Categorical Semantics of Reactive Systems Trough Dialgebras
• Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness
• Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi
• Compositional SOS and beyond: A coalgebraic view of open systems
• Relational presheaves, change of base and weak simulation

This page was built for publication: Reactive systems, (semi-)saturated semantics and coalgebras on presheaves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q843097)