A note on the notation of recursion in process algebras

DOI10.1016/0020-0190(91)90145-8MaRDI QIDQ751295zbMATH OpenOpenAlexFDO

Authors 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

recursiontheory of computationprocess algebrasformal semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• Equivalence of recursive specifications in process algebra
• scientific article; zbMATH DE number 3894457
• Recursive equations in higher-order process calculi
• scientific article; zbMATH DE number 4018375
• Reasoning algebraically about recursion

Cites work

• scientific article; zbMATH DE number 3961577 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 3894457 (Why is no real title available?)
• scientific article; zbMATH DE number 3286027 (Why is no real title available?)
• A Theory of Communicating Sequential Processes
• A structural approach to operational semantics
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Specification-oriented semantics for communicating processes

Cited in

(3)

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

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

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