Recursive process definitions with the state operator

DOI10.1016/0304-3975(91)90225-QMaRDI QIDQ758198zbMATHFDO

Authors Jos C. M. Baeten, J. A. Bergstra

Publication date 1991

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

concurrencybasic process algebraconcurrent communicating processes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Publication:4872451
• Equivalence of recursive specifications in process algebra
• Process algebra with recursive operations
• Register-machine based processes
• CONCUR 2005 – Concurrency Theory

Cites work

• scientific article; zbMATH DE number 3808928 (Why is no real title available?)
• scientific article; zbMATH DE number 3990852 (Why is no real title available?)
• scientific article; zbMATH DE number 4035115 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3894457 (Why is no real title available?)
• A calculus of communicating systems
• Global renaming operators in concrete process algebra
• Process algebra for synchronous communication
• Recursive process definitions with the state operator

Cited in

(5)

• Recursive process definitions with the state operator
• Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule
• Modular specification of process algebras
• Decidability of bisimulation equivalence for normed pushdown processes
• A conservative look at operational semantics with variable binding

This page was built for publication: Recursive process definitions with the state operator

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