Processes and formalisms for unbounded choice

DOI10.1016/0304-3975(92)90174-EzbMath0769.68009OpenAlexW1981355442MaRDI QIDQ1193892

Wim H. Hesselink

Publication date: 27 September 1992

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

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90174-e

zbMATH Keywords

completionsspecificationchoice operatorsspecification algebras

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items

Nondeterminacy and recursion via stacks and games

Cites Work

• A theoretical basis for stepwise refinement and the programming calculus
• Command algebras, recursion and program transformation
• Duality in specification languages: A lattice-theoretical approach
• On the consistency of Koomen's fair abstraction rule
• Predicate-transformer semantics of general recursion
• Deadlock and fairness in morphisms of transition systems
• A lattice-theoretical fixpoint theorem and its applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item