UTP designs for binary multirelations

DOI10.1007/978-3-319-10882-7_23MaRDI QIDQ2938175zbMATH OpenOpenAlexFDO

Authors Pedro Ribeiro, Ana Cavalcanti

Publication date 13 January 2015

Published in Theoretical Aspects of Computing – ICTAC 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-10882-7_23

zbMATH Keywords

binary multirelationsrefinementsemanticsUTP

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Angelic nondeterminism and unifying theories of programming
• Angelic nondeterminism in the unifying theories of programming
• Monotone Predicate Transformers as Up-Closed Multirelations
• Modelling angelic and demonic nondeterminism with multirelations
• Theory and Applications of Relational Structures as Knowledge Instruments

Cited in

(6)

• Angelic processes for CSP via the UTP
• Angelic nondeterminism and unifying theories of programming
• Conscriptions: a new relational model for sequential computations
• Monotone Predicate Transformers as Up-Closed Multirelations
• Theory and Applications of Relational Structures as Knowledge Instruments
• Angelic nondeterminism in the unifying theories of programming

This page was built for publication: UTP designs for binary multirelations

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