Processes and formalisms for unbounded choice
type: Item
instance of: scholarly article
title: Processes and formalisms for unbounded choice
zbMATH Open document ID: 0769.68009
DOI: 10.1016/0304-3975(92)90174-E
author: W. H. Hesselink
published in: Theoretical Computer Science
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 65325
zbMATH Keywords: specification
zbMATH Keywords: specification algebras
zbMATH Keywords: choice operators
zbMATH Keywords: completions
MaRDI profile type: Publication
cites work: On the consistency of Koomen's fair abstraction rule
cites work: Duality in specification languages: A lattice-theoretical approach
cites work: Q3664418
cites work: Q4343990
cites work: Deadlock and fairness in morphisms of transition systems
cites work: Predicate-transformer semantics of general recursion
cites work: Command algebras, recursion and program transformation
cites work: Q3996921
cites work: A theoretical basis for stepwise refinement and the programming calculus
cites work: Q5631102
cites work: A lattice-theoretical fixpoint theorem and its applications
full work available at URL: 0304-3975(92)90174-e
OpenAlex ID: W1981355442
description: scientific article; zbMATH DE number 65325