Abstract
Nondeterminacy occurs commonly in computing, much more than we recognise. Indeed it deserves to be recognised as a fundamental notion, meriting a place alongside other fundamental notions such as algorithm, recursion, data type, concurrency, object, etc. Essentially the same notion of nondeterminacy manifests itself in a range of different contexts, among them imperative, functional, and concurrent programming, competing agents, data refinement, and fixpoint theory. Nondeterminacy can be recognised, extracted, and studied in isolation such that the properties we discover are applicable more-or-less without change in the various domains in which it occurs.
This extended abstract of an invited talk has been included in late-stage editing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Morris, J.M., Bunkenburg, A.: Term transformers: a new approach to state (submitted, 2006)
Morris, J.M., Tyrrell, M.: Dually nondeterministic functions and functional refinement (submitted, 2005)
Morris, J.M., Tyrrell, M.: Dual unbounded nondeterminacy, recursion, and fixpoints. Acta Informatica (to appear, 2006)
Morris, J.M., Tyrrell, M.: Terms with unbounded demonic and angelic nondeterminacy. Science of Computer Programming (to appear, 2006)
Tyrrell, M., Morris, J.M., Butterfield, A., Hughes, A.: A lattice-theoretic model for an algebra of communicating sequential processes. In: Proc. 3rd Int. Colloquium on Theoretical Aspects of Computing. LNCS, Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morris, J.M. (2006). Plug-and-Play Nondeterminacy. In: Julliand, J., Kouchnarenko, O. (eds) B 2007: Formal Specification and Development in B. B 2007. Lecture Notes in Computer Science, vol 4355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11955757_32
Download citation
DOI: https://doi.org/10.1007/11955757_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68760-3
Online ISBN: 978-3-540-68761-0
eBook Packages: Computer ScienceComputer Science (R0)