Unguardedness mostly means many solutions

DOI10.1016/j.tcs.2011.02.046zbMath1216.68185OpenAlexW2141784054MaRDI QIDQ549175

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)

Related Items

Equations, Contractions, and Unique Solutions

Cites Work

• On the consistency of Koomen's fair abstraction rule
• A structural approach to operational semantics
• A Theory of Communicating Sequential Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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