Elementary structures in process theory (1): Sets with renaming

DOI10.1017/S0960129599002947zbMATH Open0968.68112OpenAlexW2075077574MaRDI QIDQ4526151FDOQ4526151

Kohei Honda

Publication date: 16 January 2001

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129599002947

zbMATH Keywords

process calculi

Mathematics Subject Classification ID

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

Cited In (6)

• Dynamic connectors for concurrency
• Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
• Nominal logic, a first order theory of names and binding
• A program logic for fresh name generation
• Algebraic theories for name-passing calculi
• Linearity and bisimulation

Recommendations

• About permutation algebras, (pre)sheaves and named sets 👍 👎
• Algebraic theories for name-passing calculi 👍 👎
• What is a free name in a process algebra? 👍 👎
• Algebraic calculi of processes and net expressions 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Elementary structures in process theory (1): Sets with renaming

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