Unguardedness mostly means many solutions

DOI10.1016/J.TCS.2011.02.046MaRDI QIDQ549175zbMATHOpenAlexFDO

Authors Jos C. M. Baeten, Bas Luttik

Publication date 7 July 2011

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

Full work available at URL https://doi.org/10.1016/j.tcs.2011.02.046

zbMATH Keywords

process algebrarecursive specificationunguarded equation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On guarded recursion
• scientific article; zbMATH DE number 7080198
• Guard your daggers and traces: properties of guarded (co-)recursion
• Bisimulations generated from corecursive equations
• Unifying guarded and unguarded iteration

Cites work

• scientific article; zbMATH DE number 4016181 (Why is no real title available?)
• scientific article; zbMATH DE number 3876566 (Why is no real title available?)
• scientific article; zbMATH DE number 42070 (Why is no real title available?)
• A Theory of Communicating Sequential Processes
• A structural approach to operational semantics
• On the consistency of Koomen's fair abstraction rule
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.

Cited in

(3)

• Equations, contractions, and unique solutions
• On the greatest solution of equations in \(\mathrm{CLL}_R\)
• Bisimulations generated from corecursive equations

This page was built for publication: Unguardedness mostly means many solutions

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