Equations, Contractions, and Unique Solutions

DOI10.1145/2971339zbMath1367.68212OpenAlexW2603068949MaRDI QIDQ5278202

Davide Sangiorgi

Publication date: 13 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01647063/file/main.pdf

zbMATH Keywords

contractionbisimulationunique solutionequationscoinduction

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 (3)

Unnamed Item ⋮ Unique solutions of contractions, CCS, and their HOL formalisation ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unguardedness mostly means many solutions
• Fair testing
• Structured operational semantics and bisimulation as a congruence
• A complete axiomatisation for observational congruence of finite-state behaviours
• An efficiency preorder for processes
• Testing equivalences for processes
• On reduction-based process semantics
• Understanding concurrent systems
• Testing equivalence as a bisimulation equivalence
• Abstract GSOS Rules and a Modular Treatment of Recursive Definitions
• Checking NFA equivalence with bisimulations up to congruence
• A General Theory of Barbs, Contexts, and Labels
• Sound Bisimulations for Higher-Order Distributed Process Calculus
• Logical Bisimulations and Functional Languages
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
• Bisimulation can't be traced
• Coinductive Proof Techniques for Language Equivalence
• Small bisimulations for reasoning about higher-order imperative programs
• Lax Bialgebras and Up-To Techniques for Weak Bisimulations
• Enhancements of the bisimulation proof method

This page was built for publication: Equations, Contractions, and Unique Solutions