A congruence rule format for name-passing process calculi

DOI10.1016/j.ic.2007.12.005zbMath1165.68050OpenAlexW2085226568MaRDI QIDQ1012125

Sam Staton, Marcelo P. Fiore

Publication date: 14 April 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2007.12.005

zbMATH Keywords

operational semanticsnominal logiccategorical model theoryopen bisimilarity

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Coinductive predicates and final sequences in a fibration, A compositional coalgebraic model of fusion calculus, Nominal SOS, Unnamed Item, Bialgebras for structural operational semantics: an introduction, Characterizing contextual equivalence in calculi with passivation, Some undecidable properties of SOS specifications, A general account of coinduction up-to, Bialgebraic methods and modal logic in structural operational semantics, Coinductive predicates and final sequences in a fibration, Coverability Synthesis in Parametric Petri Nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models for name-passing processes: Interleaving and causal
• A new approach to abstract syntax with variable binding
• A calculus of mobile processes. II
• A conservative look at operational semantics with variable binding
• Compositional SOS and beyond: A coalgebraic view of open systems
• Nominal logic, a first order theory of names and binding
• A theory of bisimulation for the \(\pi\)-calculus
• Comparing operational models of name-passing process calculi
• Bisimulation can't be traced
• A proof theory for generic judgments
• Variable binding operators in transition system specifications