Retracing some paths in process algebra

DOI10.1007/3-540-61604-7_44zbMath1514.68153arXiv1401.5113OpenAlexW1554525902WikidataQ57006832 ScholiaQ57006832MaRDI QIDQ6104362

Samson Abramsky

Publication date: 28 June 2023

Published in: CONCUR '96: Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.5113

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

The coinductive resumption monad ⋮ Geometry of Synthesis II: From Games to Delay-Insensitive Circuits ⋮ String diagrams for traced and compact categories are oriented 1-cobordisms ⋮ A survey of categorical properties of \(\mathbb{L}\)-fuzzy relations ⋮ DisCoPy: Monoidal Categories in Python ⋮ Simple free star-autonomous categories and full coherence ⋮ Attribute Grammars and Categorical Semantics ⋮ A specification structure for deadlock-freedom of synchronous processes ⋮ A type assignment system for game semantics ⋮ Logic and Geometry of Agents in Agent-Based Modeling ⋮ Join inverse categories and reversible recursion ⋮ Machine semantics ⋮ Pseudo-commutative Monads ⋮ Quantum circuit oracles for abstract machine computations ⋮ Proofs as Polynomials ⋮ Musings around the geometry of interaction, and coherence ⋮ Towards a geometry of recursion ⋮ Linear realizability and full completeness for typed lambda-calculi ⋮ Categories of Timed Stochastic Relations ⋮ Information Processing in Convex Operational Theories ⋮ Inversion, Iteration, and the Art of Dual Wielding ⋮ A categorical framework for typing CCS-style process communication ⋮ Physical Traces ⋮ The Uniformity Principle on Traced Monoidal Categories ⋮ Feedback for linearly distributive categories: Traces and fixpoints ⋮ From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference ⋮ A structural approach to reversible computation ⋮ Event Domains, Stable Functions and Proof-Nets ⋮ Conformal Field Theory as a Nuclear Functor ⋮ Labelled Markov Processes as Generalised Stochastic Relations ⋮ What are the Fundamental Structures of Concurrency? ⋮ A categorical model for the geometry of interaction

Cites Work

• A logical view of composition
• Coherence for compact closed categories
• A calculus of communicating systems
• A calculus of mobile processes. II
• New foundations for the geometry of interaction
• Proofs as processes
• The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions
• Functions as processes
• A Powerdomain Construction
• Games and full completeness for multiplicative linear logic
• Special issue on Hybrid systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Retracing some paths in process algebra