Abstract
A non-deterministic process is viewed as a set of deterministic ones: its possible worlds. Each world represents a particular “solution” of non-determinism. Under this view of non-determinism as underspecification, nodeterministic processes are specifications, and the possible worlds represent the model space and thus the set of possible implementations. Then, refinement is inclusion of sets of possible worlds and can be used for stepwise specifications. This notion of refinement naturally induces new preorders (and equivalences) for processes that we characterize denotationally, operationally and axiomatically for a basic process algebra with nil, prefix and choice.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Baeten and W. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.
J.A. Bergstra, J.W. Klop, and E.R. Olderog. Failures without chaos: A new process semantics for fair abstraction. In M.Wirsing, editor, Formal Description of Programming Concepts — III, pages 77–103. North-Holland, 1987.
R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1984.
R. De Nicola and M. Hennessy. CCS without Τ's. In Proceedings, TAPSOFT'87, Theory And Practice of SOFTware development, pages 138–252. Springer-Verlag LNCS 249, 1987.
Hartmut Ehrig and Bernd Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. Springer-Verlag, 1985.
R.J. van Glabbeek. Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, Free University, Amsterdam, 1990. Second edition available as CWI tract 109, CWI, Amsterdam 1996.
Joseph A. Goguen. Theorem Proving and Algebra. MIT, 1997.
Joseph A. Goguen and Grant Malcolm. A hidden agenda. Technical Report CS97-538, UCSD, 1997. To appear in Theoretical Computer Science.
M. Hennessy. Algebraic theory of processes. MIT Press, 1988.
Fernando Orejas, Marisa Navarro, and Ana Sánchez. Algebraic implementation of abstract data-types: a survey of concepts and new compositionality results. Mathematical Structures in Computer Science, 6(1), 1996.
Donald Sannella and Andrzej Tarlecki. Toward formal development of programs from algebraic specifications. Acta Informatica, 25:233–281, 1988.
Rob van Glabbeek. The linear time — branching time spectrum. In J. Baeten and J. Klop, editors, Proceedings, CONCUR'90, Amsterdam, pages 278–297. Springer-Verlag Lecture Notes in Computer Science, 458, 1990.
Simone Veglioni. Integrating Static and Dynamic aspects in the specification of Open Object-based Distributed Systems. PhD thesis, Programming Research Group, Oxford University, 1997. Available on ftp://ftp.univaq.it/pub/users/veglioni/thesis.ps.
Simone Veglioni. Objects as Abstract Machines. In Proceedings, Formal Methods for Open, Object-based, Distributed Systems, 2nd International Conference, FMOODS'97. Chapman & Hall, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Veglioni, S., De Nicola, R. (1998). Possible worlds process algebras. In: Sangiorgi, D., de Simone, R. (eds) CONCUR'98 Concurrency Theory. CONCUR 1998. Lecture Notes in Computer Science, vol 1466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055623
Download citation
DOI: https://doi.org/10.1007/BFb0055623
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64896-3
Online ISBN: 978-3-540-68455-8
eBook Packages: Springer Book Archive