A note on the notation of recursion in process algebras

DOI10.1016/0020-0190(91)90145-8zbMATH Open0714.68053OpenAlexW2038821485MaRDI QIDQ751295

Dirk Taubner

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90145-8

zbMATH Keywords

formal semanticsrecursiontheory of computationprocess algebras

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cites Work

• Specification-oriented semantics for communicating processes
• Finite representations of CCS and TCSP programs by automata and Petri nets
• A structural approach to operational semantics
• A Theory of Communicating Sequential Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

Related Items (2)

Deciding observational congruence of finite-state CCS expressions by rewriting ⋮ Underspecification for a simple process algebra of recursive processes.

This page was built for publication: A note on the notation of recursion in process algebras