Unguardedness mostly means many solutions

DOI10.1016/J.TCS.2011.02.046zbMATH Open1216.68185OpenAlexW2141784054MaRDI QIDQ549175FDOQ549175

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

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

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)

Cites Work

• Title not available (Why is that?)
• A structural approach to operational semantics
• A Theory of Communicating Sequential Processes
• On the consistency of Koomen's fair abstraction rule
• Title not available (Why is that?)
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
• Title not available (Why is that?)

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)