Compositional SOS and beyond: A coalgebraic view of open systems

DOI10.1016/S0304-3975(01)00025-1zbMath1014.68107OpenAlexW2079822631MaRDI QIDQ1603820

Andrea Corradini, Ugo Montanari, Reiko Heckel

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00025-1

zbMATH Keywords

bisimulationtransition systems\(\Gamma\)-algebra

Mathematics Subject Classification ID

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

Related Items

A categorical framework for congruence of applicative bisimilarity in higher-order languages, A compositional coalgebraic model of fusion calculus, About permutation algebras, (pre)sheaves and named sets, Structural congruence for bialgebraic semantics, A presheaf environment for the explicit fusion calculus, SOS formats and meta-theory: 20 years after, Symmetries, local names and dynamic (de)-allocation of names, Ugo Montanari and Concurrency Theory, Bialgebras for structural operational semantics: an introduction, Unnamed Item, GETGRATS, Coalgebraic description of generalised binary methods, Processes as formal power series: a coinductive approach to denotational semantics, A congruence rule format for name-passing process calculi, Bialgebraic methods and modal logic in structural operational semantics, Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic, Rule Formats for Timed Processes, Towards Behavioral Maude, Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus, Dynamic connectors for concurrency, A Name Abstraction Functor for Named Sets

Cites Work

• Correctness of recursive parallel nondeterministic flow programs
• Petri nets are monoids
• Higher-level synchronising devices in Meije-SCCS
• A calculus of communicating systems
• The chemical abstract machine
• A calculus of mobile processes. II
• Structured operational semantics and bisimulation as a congruence
• An algebraic semantics for structured transition systems and its application to logic programs
• A \(\pi\)-calculus with explicit substitutions
• A hidden agenda
• Universal coalgebra: A theory of systems
• Bisimulation from open maps
• Bisimulation can't be traced
• A coalgebraic presentation of structured transition systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item