Algebraic approaches to nondeterminism

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algebraic approaches to nondeterminism—an overview

Full text

Pdf (863 KB)

Source

ACM Computing Surveys (CSUR) archive
Volume 29 , Issue 1 (March 1997) table of contents

Pages: 30 - 81

Year of Publication: 1997

ISSN:0360-0300

Authors

Michał Walicki	Univ. of Bergen, Beragen, Norway
Sigurd Meldal	Univ. of Bergen, Beragen, Norway

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 17, Downloads (12 Months): 100, Citation Count: 12

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/248621.248623 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	tARTS, C., BACKHOUSE, R. C., HOOGENDIJK, P., Vo- ERMANS, E., VAN DER WOUDE, J. 1992. A Relational Theory of Datatypes. In preparation, draft available at URk=http://www.win.tue.nl/ win/cs/wp/papers/papers.html.
	2	Luca Aceto , Rocco De Nicola , Alessandro Fantechi, Testing equivalences for event structures, Advanced School on Mathematical models for the semantics of parallelism, p.1-20, January 1987, Rome, Italy
	3	APT, K.R. 1984. Ten years of Hoare's logic: a survey. Part II: Nondeterminism. Theor. Comput. Sci., 28, 83-109.
	4	Krzysztof R. Apt , Gordon D. Plotkin, A Cook's Tour of Countable Nondeterminism, Proceedings of the 8th Colloquium on Automata, Languages and Programming, p.479-494, July 13-17, 1981
	5	Egidio Astesiano , Gerardo Costa, Sharing in Nondeterminism, Proceedings of the 6th Colloquium, on Automata, Languages and Programming, p.1-15, July 16-20, 1979
	6	Ralph-Johan Back, Semantics of Unbounded Nondeterminism, Proceedings of the 7th Colloquium on Automata, Languages and Programming, p.51-63, July 14-18, 1980
	7	R. J. R. Back , J. von Wright, Duality in specification languages: a lattice-theoretical approach, Acta Informatica, v.27 n.7, p.583-625, 1990
	8	DE BAKKER, g.W. 1976. Semantics and termination of nondeterministic recursive programs. In Automata, Languages and Programming, Edinburgh, 435-477.
	9	BARR, M. AND WELLS, C. 1985. Toposes, Triples and Theories. Springer.
	10	Michael Barr , Charles Wells, Category theory for computing science, Prentice-Hall, Inc., Upper Saddle River, NJ, 1990
	11	F L Bauer , R Berghammer , M Broy , W Dosch , F Geiselbrechtinger , R Gnatz , E Hangel , W Hesse , B Krieg-Brückner , A Laut , T Matzner , B Möller , F Nickl , H Partsch , P Pepper , K Samelson , M Wirsing , H Wössner, The Munich Project CIP: Volume I: the wide spectrum language CIP-L, Springer-Verlag, London, 1986
	12	H Bekic , C B. Jones, Programming languages and their definition, Springer-Verlag New York, Inc., New York, NY, 1984
	13	Mordechai Ben-Ari , Zohar Manna , Amir Pnueli, The temporal logic of branching time, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.164-176, January 26-28, 1981, Williamsburg, Virginia [doi>10.1145/567532.567551]
	14	BERGSTRA, J. A. AND KLOP, J.W. 1983. An abstraction mechanism for process algebras. Tech. Rep. IW 231/83, Dept. of CS, Mathematisch Centrum, Amsterdam.
	15	BERGSTRA, J. A. AND KLOP, J.W. 1986. Algebra of communicating processes. In Proceedings of CWI Symposium on Mathematics and CS. (Oct.), 89-138.
	16	BERGSTRA, J. A. AND TUCKER, J.V. 1983. Initial and final algebra semantics for data type specifications. SIAM J. Comput. 12, 366-387.
	17	J. A. Bergstra , J. V. Tucker, Algebraic specifications of computable and semicomputable data types, Theoretical Computer Science, v.50 n.2, p.137-181, 1987 [doi>10.1016/0304-3975(87)90123-X]
	18	BIALASIK, M. AND KONIKOWSKA, B. 1997. A logic for nondeterministic specifications. In Essays Dedicated to the Memory of H. Rasiowa, (to appear). Kluwer. Also, Reasoning with nondeterministic specifications. Tech. Rep. 793, Polish Academy of Sciences, Institute of Computer Science, 1995.
	19	BLOOM, S. 1976. Varieties of ordered algebras. J. Comput. Syst. Sci. 13, 200-212.
	20	BLOOM, S. AND TINDELL, R. 1980. Compatible orderings on the metric theory of trees. SIAM J. Comput. 9, 4, 683-691.
	21	BORCEUX, F. 1994. Handbook of Categorical Algebra Cambridge University Press, New York.
	22	BOUDOL, G. 1980. Calculus maximaux et semantique operationnelle des programmes non deterministes. Ph.D. Thesis, University of Paris.
	23	BROY, M. 1983. Fixed point theory for communication and concurrency. In IFIP TC2 Working Conference on Formal Description of Programming Concepts II, North-Holland, 125- 147.
	24	Manfred Broy, On the Herbrand Kleene Universe for Nondeterministic Computations, Proceedings of the Mathematical Foundations of Computer Science 1984, p.214-222, September 03-07, 1984
	25	Manfred Broy, A theory for nondeterminism, parallelism, communication, and concurrency, Theoretical Computer Science, v.45 n.1, p.1-61, Sept. 1986
	26	BROY, M. AND WIRSING, M. 1980. Programming languages as abstract data types. Lille Colloque 80.
	27	BROY, M. AND WIRSING, M. 1981a. Initial versus terminal algebra semantics for partially defined abstract types. Tech. Rep. TUM-I 8018, Technische Universit~it Mfinchen, Dec. Revised version: Partial abstract types. Acta Inf. 18, 47-64, 1982.
	28	Manfred Broy , Martin Wirsing, On the Algebraic Specification of Nondeterministic Programming Languages, Proceedings of the 6th Colloquium on Trees in Algebra and Programming, p.162-179, March 05-07, 1981
	29	Manfred Broy , Walter Dosch , Helmuth Partsch , Peter Pepper , Martin Wirsing, Existential Quantifiers in Abstract Data Types, Proceedings of the 6th Colloquium, on Automata, Languages and Programming, p.73-87, July 16-20, 1979
	30	Manfred Broy , Rupert Gnatz , Martin Wirsing, Semantics of Nondeterministic and Noncontinuous Constructs, Program Construction, International Summer Schoo, p.553-592, July 26-August 06, 1978
	31	CHANDRA, A. K. 1978. Computable nondeterministic functions. In Nineteenth Annual Symposium on Foundations of Computer Science.
	32	William Clinger, Nondeterministic call by need is neither lazy nor by name, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.226-234, August 15-18, 1982, Pittsburgh, Pennsylvania, United States [doi>10.1145/800068.802154]
	33	COHN, P. M. 1965. Universal Algebra, Mathematics and Its Applications. Vol. 6. D. Reidel, Norwell, MA.
	34	Ole-Johan Dahl, Verifiable Programming, Prentice Hall PTR, Upper Saddle River, NJ, 1992
	35	Edsger W. Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Communications of the ACM, v.18 n.8, p.453-457, Aug. 1975 [doi>10.1145/360933.360975]
	36	Edsger Wybe Dijkstra, A Discipline of Programming, Prentice Hall PTR, Upper Saddle River, NJ, 1997
	37	E. W. Dijkstra , A. J. M. van Gasteren, A simple fix-point argument without the restriction to continuity, Control Flow and Data Flow: concepts of distributed programming, Springer-Verlag New York, Inc., New York, NY, 1987
	38	Agostino Dovier , Eugenio G. Omodeo , Enrico Pontelli , Gianfranco Rossi, Embedding Finite Sets in a Logic Programming Language, Proceedings of the Third International Workshop on Extensions of Logic Programming, p.150-167, February 26-28, 1992
	39	EGLI, H. 1975. A mathematical model for nondeterministic computations. Tech. Rep. ETH.
	40	ENGELFRIET, J. AND SCHMIDT, E. M. 1977. IO and OI. 1. J. Comput. Syst. Sci. 15, 328-353.
	41	ENGELFRIET, J. AND SCHMIDT, E. M. 1978. IO and OI. 2. J. Comput. Syst. Sci. 16, 67-99.
	42	Yishai A. Feldman , David Harel, A probabilistic dynamic logic, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.181-195, May 05-07, 1982, San Francisco, California, United States [doi>10.1145/800070.802191]
	43	FERNANDEZ, J. A. AND MINKER, J. 1991. Bottomup evaluation of hierarchical disjunctive deductive databases. In Proceedings of the Eighth International Conference on Logic Programming.
	44	Robert W. Floyd, Nondeterministic Algorithms, Journal of the ACM (JACM), v.14 n.4, p.636-644, Oct. 1967 [doi>10.1145/321420.321422]
	45	R. J. van Glabbeek, Bounded nondeterminism and the approximation induction principle in process algebra, 4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87, p.336-347, February 1987, Passau, Germany
	46	GOGUEN, J.A. 1989. What is unification? A categorical view of substitution, equation, and solution. In Resolution of Equations in Algebraic Structures, Volume 1: Algebraic Techniques, M. Nivat and A.-K. Hassan, Eds. Academic Press, 217-261.
	47	Joseph A. Goguen , Rod M. Burstall, Introducing Institutions, Proceedings of the Carnegie Mellon Workshop on Logic of Programs, p.221-256, June 06-08, 1983
	48	J. A. Goguen , J. W. Thatcher , E. G. Wagner , J. B. Wright, Initial Algebra Semantics and Continuous Algebras, Journal of the ACM (JACM), v.24 n.1, p.68-95, Jan. 1977 [doi>10.1145/321992.321997]
	49	Irene Guessarian, Algebraic Semantics, Springer-Verlag New York, Inc., Secaucus, NJ, 1981
	50	GUTTAG, J.V. 1975. The specification and application to programming of ADT. Tech. Rep. CSR6-59, Computer Systems Research Group, University of Toronto.
	51	HANSOUL, G. E. 1983. A subdirect decomposition theorem for multialgebras. Algebra Universalis, 16, 275-281.
	52	David Harel , Vaughan R. Pratt, Nondeterminism in logics of programs, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.203-213, January 23-25, 1978, Tucson, Arizona [doi>10.1145/512760.512782]
	53	D. Harel , A. R. Meyer , V. R. Pratt, Computability and completeness in logics of programs (Preliminary Report), Proceedings of the ninth annual ACM symposium on Theory of computing, p.261-268, May 04-04, 1977, Boulder, Colorado, United States [doi>10.1145/800105.803416]
	54	Reinhold Heckmann, Power Domains Supporting Recursion and Failure, Proceedings of the 17th Colloquium on Trees in Algebra and Programming, p.165-181, February 26-28, 1992
	55	HENNESSY, M. 1980. The semantics of call-byvalue and call-by-name in a nondeterministic environment. SIAM J. Comput. 9, no. 1.
	56	Matthew Hennessy, Powerdomains and nondeterministic recursive definitions, Proceedings of the 5th Colloquium on International Symposium on Programming, p.178-193, April 06-08, 1982
	57	Matthew Hennessy, Observing processes, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, p.173-200, May 30-June 03, 1988
	58	Matthew Hennessy , Robin Milner, On Observing Nondeterminism and Concurrency, Proceedings of the 7th Colloquium on Automata, Languages and Programming, p.299-309, July 14-18, 1980
	59	Wim H. Hesselink, A mathematical approach to nondeterminism in data types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.1, p.87-117, Jan. 1988 [doi>10.1145/42192.42194]
	60	HESSELINK, W. H. 1992. Programs, Recursion and Unbounded Choice. Cambridge University Press, New York.
	61	C. A. R. Hoare, Communicating sequential processes, Prentice-Hall, Inc., Upper Saddle River, NJ, 1985
	62	Paul F. Hoogendijk, (Relational) Programming Laws in the Boom Hierarchy of Types, Proceedings of the Second International Conference on Mathematics of Program Construction, p.163-190, June 29-July 03, 1992
	63	Günter Hornung , Peter Raulefs, Terminal Algebra Semantics and Retractions for Abstract Data Types, Proceedings of the 7th Colloquium on Automata, Languages and Programming, p.310-323, July 14-18, 1980
	64	Heinrich Hußmann, Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting, Proceedings of the International Workshop on Algebraic and Logic Programming, p.31-40, November 14-18, 1988
	65	HU~MANN, H. 1990. Nondeterministic algebraic specifications. Ph.D. Thesis, Fakult~t ffir Mathematik und Informatik, Universit~t Passa.
	66	Heinrich Hussmann, Nondeterminism in algebraic specifications and algebraic programs, Birkhauser Verlag, Basel, Switzerland, 1993
	67	HUET, G. AND HULLOT, J. 1981. Proofs by induction in equational theories with constructors. JCSS 25, 239-266.
	68	Bharat Jayaraman, Implementation of subset-equational programs, Journal of Logic Programming, v.12 n.4, p.299-324, April 1992 [doi>10.1016/0743-1066(92)90005-N]
	69	KAPLAN, S. 1987. Conditional rewriting. In Conditional Term Rewriting Systems, LNCS, Vol. 308, Springer.
	70	Stéphane Kaplan, Rewriting with a nondeterministic choice operator, Theoretical Computer Science, v.56 n.1, p.37-57, Jan. 1988 [doi>10.1016/0304-3975(86)90005-8]
	71	KAPUR, D. 1980. Towards a theory of abstract data types. Ph.D. Thesis, Laboratory for CS, MIT.
	72	Richard Kennaway , C. A. R. Hoare, A Theory of Nondeterminism, Proceedings of the 7th Colloquium on Automata, Languages and Programming, p.338-350, July 14-18, 1980
	73	Paul R. Kosinski, A straightforward denotational semantics for non-determinate data flow programs, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.214-221, January 23-25, 1978, Tucson, Arizona [doi>10.1145/512760.512783]
	74	KOSINSKI, P. R. 1979. Denotational semantics of determinate and non-determinate data flow programs. Ph.D. Thesis, MIT Laboratory of Computer Science.
	75	KOZEN, D. 1981. Semantics ofprobabilistic programs. J. Comput. Syst. Sci. 22.
	76	Valentinas Kriauciukas , Michal Walicki, Reasoning and Rewriting with Set-Relations I: Ground Completeness, Selected Papers from the 8th International Workshop on Computer Science Logic, p.264-278, September 25-30, 1994
	77	Valentinas Kriauciukas , Michal Walicki, Rewriting and Reasoning with Set-Relations II: The Non-ground Case Completeness, Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification, p.306-321, September 19-23, 1995
	78	KUIPER, R. 1981. An operational semantics for bounded nondeterminism equivalent to a denotational one. In Proceedings of the International Symposium on Algorithmic Languages, J. W. de Bakker, J. C. van Vliet, Eds. IFIP, 373-398, North-Holland. Also Tech. Rep. IW 169/81, Stichtig Mathematisch Centrum, Dept. of CS, Amsterdam.
	79	Daniel Lehmann , Michael O. Rabin, On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.133-138, January 26-28, 1981, Williamsburg, Virginia [doi>10.1145/567532.567547]
	80	Daniel J. Lehmann , Saharon Shelah, Reasoning with Time and Chance (Extended Abstract), Proceedings of the 10th Colloquium on Automata, Languages and Programming, p.445-457, July 18-22, 1983
	81	Jordi Levy , Jaume Agustí-Cullell, Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations, Proceedings of the 5th International Conference on Rewriting Techniques and Applications, p.17-31, June 16-18, 1993
	82	Ugo de'Liguoro , Adolfo Piperno, Must Preorder in Non-Deterministic Untyped Lambda-Calculus, Proceedings of the 17th Colloquium on Trees in Algebra and Programming, p.203-220, February 26-28, 1992
	83	LYNDON, R. C. 1959. Properties preserved under homomorphism. Pacific J. Math. 9.
	84	Bernhard Möller, On the algebraic specification of infinite objects—ordered and continuous models of algebraic types, Acta Informatica, v.22 n.5, p.537-578, Dec. 1985
	85	MACLANE, S. 1971. Categories for the Working Mathematician. Springer.
	86	Bernd Mahr , Johann A. Makowsky, Characterizing Specification Languages Which Admit Initial Semantics, Proceedings of the 8th Colloquium on Trees in Algebra and Programming, p.300-316, March 09-11, 1983
	87	MAIBAUM, T. S.E. 1977. The semantics of nondeterminism. Tech. Rep. CS-77-30, University of Waterloo, Ontario, Canada, Dec.
	88	J. A. Makowsky, Why Horn formulas matter in computer science: initial structures and generic examples, Journal of Computer and System Sciences, v.34 n.2-3, p.266-292, April/June 1987 [doi>10.1016/0022-0000(87)90027-4]
	89	MAL'CEV, A. I. 1971. The Metamathematics of Algebraic Systems. Studies in Logic and the Foundations of Mathematics, Vol. 66, North- Holland.
	90	MAL'CEV, A. I. 1973. Algebraic Systems. Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen, Vol. 192, Springer.
	91	MANES, A. 1982. Fuzzy theories. J. Math. Anal. Appl.
	92	MANNA, Z. 1970. The correctness of nondeterministic programs. Art. Intell. 1, 1-26.
	93	Zohar Manna , Amir Pnueli, The temporal logic of reactive and concurrent systems, Springer-Verlag New York, Inc., New York, NY, 1992
	94	MCCARTHY, J. 1963. A basis for a mathematical theory of computation. In Computer Programming and Formal Systems, North-Holland.
	95	MELDAL, S. 1989. An abstract axiomatization of pointer types. In Proceedings of the 22nd Annual Hawaii International Conference on Systern Sciences, IEEE Computer Society Press, Los Alamitos, CA.
	96	MESEGUER, J. 1983. Order completion monads. Algebra Universalis, 16, 63-82.
	97	José Meseguer, A logical theory of concurrent objects, ACM SIGPLAN Notices, v.25 n.10, p.101-115, Oct. 1990
	98	José Meseguer, Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science, v.96 n.1, p.73-155, 6 April 1992
	99	MEZEI, J. AND WRIGHT, J. B. 1967. Algebraic automata and context-free sets. Inf. Control 11.
	100	MILNER, R. 1973. Processes: A mathematical model of computing agents. In Proceedings of Logic Colloquium.
	101	R. Milner, A Calculus of Communicating Systems, Springer-Verlag New York, Inc., Secaucus, NJ, 1982
	102	R. Milner, Communication and concurrency, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989
	103	P. Mosses, Unified algebras and institutions, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.304-312, June 1989, Pacific Grove, California, United States
	104	P. D. Mosses, Unified algebras and action semantics, Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89, p.17-35, February 1989, Paderborn, Germany
	105	Greg Nelson, A generalization of Dijkstra's calculus, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.4, p.517-561, Oct. 1989 [doi>10.1145/69558.69559]
	106	Tobias Nipkow, Non-deterministic data types: models and implementations, Acta Informatica, v.22 n.6, p.629-661, March 1986 [doi>10.1007/BF00263649]
	107	T. Nipkow, Observing nondeterministic data types, Lecture notes in Computer Science on Recent trends in data type specification, p.170-183, August 1988, Gullane, Scotland
	108	NIPKOW, T. 1987b. Behavioural implementations concepts for nondeterministic data types. Ph.D. Thesis, Dept. of CS, The University of Manchester.
	109	NIVAT, M. 1975. On the interpretation ofrecursive polyadic program schemes. Symposia Mathematica, 15, 255-281.
	110	NIVAT, M. 1980. Nondeterministic programs: An algebraic overview. In Information Processing'80, Proceedings of the IFIP Congress'80, North-Holland.
	111	Michael J. O'Donnell, Computing in Systems Described by Equations, Springer-Verlag New York, Inc., Secaucus, NJ, 1977
	112	David Park, On the Semantics of Fair Parallelism, Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School, p.504-526, January 22-February 02, 1979
	113	PETRI, C. A. 1977. Non-sequential processes. Tech. Rep. ISF-77-05, Gesellschaft ftir Matematik und Datenverarbeitung, Sankt Augustin.
	114	PICKERT, G. 1950. Bemerkungen zum homomorphie-begriff. Math. Zeitschrift, 53.
	115	PICKETT, H.E. 1967. Homomorphisms and subalgebras of multialgebras. Pacific J. Math. 21, 327-342.
	116	PLOTKIN, G. 1976. A power domain construction. SIAM J. Comput. 5, 3, 452-487.
	117	Gordon D. Plotkin, Dijkstras Predicate Transformers & Smyth's Power Domaine, Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School, p.527-553, January 22-February 02, 1979
	118	PLOTKIN, G. 1983. Domains. Lecture notes, Dept. of Computer Science, University of Edinburgh, available at URL=http://hypatia. dcs.qmw.ac.uk/authors/P/PlotkinGD/papers/ dom.ps.Z.
	119	K. R. Apt , G. D. Plotkin, Countable nondeterminism and random assignment, Journal of the ACM (JACM), v.33 n.4, p.724-767, Oct. 1986 [doi>10.1145/6490.6494]
	120	Xiaolei Qian , Allen Goldberg, Referential opacity in nondeterministic data refinement, ACM Letters on Programming Languages and Systems (LOPLAS), v.2 n.1-4, p.233-241, March–Dec. 1993 [doi>10.1145/176454.176578]
	121	John H. Reif, Logics for probabilistic programming (Extended Abstract), Proceedings of the twelfth annual ACM symposium on Theory of computing, p.8-13, April 28-30, 1980, Los Angeles, California, United States [doi>10.1145/800141.804647]
	122	Wolfgang Reisig, Petri nets: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	123	H. Søndergaard , P. Sestoft, Non-determinism in functional languages, The Computer Journal, v.35 n.5, p.514-523, Oct. 1992 [doi>10.1093/comjnl/35.5.514]
	124	SAHEB-DJAHROMI, N. 1979. Probabilistic CPOs for nondeterminism. Tech. Rep. CSR-37-79, University of Edinburgh, Dept. of CS.
	125	Donald Sannella , Andrzej Tarlecki, Specifications in an arbitrary institution, Information and Computation, v.76 n.2-3, p.165-210, February/March 1988 [doi>10.1016/0890-5401(88)90008-9]
	126	Richard L. Schwartz, An Aximatic Treatment of Algol 68 Routines, Proceedings of the 6th Colloquium, on Automata, Languages and Programming, p.530-545, July 16-20, 1979
	127	J. T. Schwartz , R. B. Dewar , E. Schonberg , E. Dubinsky, Programming with sets; an introduction to SETL, Springer-Verlag New York, Inc., New York, NY, 1986
	128	SCOTT, D. 1972. Continuous lattices. In Proceedings of 1971 Dalhousie Conference, LNM, Vol. 274, Springer.
	129	SCOTT, D. 1976. Data types as lattices. SIAM J. Comput. 5, 4, 522-587.
	130	SMYTH, M.B. 1978. Power domains. J. Comput. Syst. Sci. 16.
	131	Michael B. Smyth, Power Domains and Predicate Transformers: A Topological View, Proceedings of the 10th Colloquium on Automata, Languages and Programming, p.662-675, July 18-22, 1983
	132	SPITZEN, J. AND WEGBREIT, B. 1975. The verification and synthesis of data structures. Acta Inf. 4, 127-144.
	133	Eugene W. Stark, Compostional Relational Semantics for Indeterminate Dataflow Networks, Category Theory and Computer Science, p.52-74, September 05-08, 1989
	134	STOLZENBURG, F. 1993. An algorithm for general set unification. In Workshop on Logic Programming with Sets, ICLP'93.
	135	P. A. Subrahmanyam, Nondeterminism in Abstract Data Types, Proceedings of the 8th Colloquium on Automata, Languages and Programming, p.148-164, July 13-17, 1981
	136	Andrzej Tarlecki, Free Constructions in Algebraic Institutions, Proceedings of the Mathematical Foundations of Computer Science 1984, p.526-534, September 03-07, 1984
	137	Ed Voermans, Pers as Types, Inductive Types and Types with Laws, Seminar and Workshop on Declarative Programming, p.274-291, November 18-22, 1991
	138	VOLGER, H. 1989a. The semantics of disjunctive deductive databases. Tech. Rep. MIP-8931, Fakultfit ftir Mathematik und Informatik, Universitfit Passau, Oct.
	139	Hugo Volger, The semantics of disjunctive deductive databases, Proceedings of the third workshop on Computer science logic, p.409-421, July 1990, Kaiserslautern, Germany
	140	WALICKI, M. 1993. Algebraic specifications of nondeterminism. Ph.D. Thesis, University of Bergen, Department of Informatics.
	141	Michal Walicki , Manfred Broy, Structured specifications and implementation of nondeterministic data types, Nordic Journal of Computing, v.2 n.3, p.358-395, Fall 1995
	142	WALICKI, M. AND MELDAL, S. 1993a. Initiality + nondeterminism ~ junk. In Proceedings of NIK'93, Tapir.
	143	WALICKI, M. AND MELDAL, S. 1993b. Sets and nondeterminism. Workshop on Logic Programming with Sets, ICLP'93.
	144	Michal Walicki , Sigurd Meldal, Multialgebras, Power Algebras and Complete Calculi of Identities and Inclusions, Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification, p.453-468, May 30-June 03, 1994
	145	Michal Walicki , Sigurd Meldal, Generated Models and the omega-Rule: The Nondeterministic Case, Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development, p.424-438, May 22-26, 1995
	146	Michal Walicki , Sigurd Meldal, A complete calculus for the multialgebraic and functional semantics of nondeterminism, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.2, p.366-393, March 1995 [doi>10.1145/201059.201070]
	147	Glynn Winskel, Event Structure Semantics for CCS and Related Languages, Proceedings of the 9th Colloquium on Automata, Languages and Programming, p.561-576, July 12-16, 1982
	148	WINSKEL, G. 1987. Event Structures. LNCS, Vol. 255, Springer.
	149	Glynn Winskel, An introduction to event structures, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, p.364-397, May 30-June 03, 1988
	150	WOLTER, U. AND LOWE, M. 1992. Beyond conditional equations. In CAAP'92, LNCS, Vol. 581, Springer.

CITED BY 12

	J. M. Morris , A. Bunkenburg, A source of inconsistency in theories of nondeterministic functions, Science of Computer Programming, v.43 n.1, p.77-89, April 2002
	Stefan Ratschan, Convergent approximate solving of first-order constraints by approximate quantifiers, ACM Transactions on Computational Logic (TOCL), v.5 n.2, p.264-281, April 2004
	Andrea Corradini , Fabio Gadducci, A functorial semantics for multi-algebras and partial algebras, with applications to syntax, Theoretical Computer Science, v.286 n.2, p.293-322, 17 September 2002
	Rajiv Mirani , Paul Hudak, First-class monadic schedules, ACM Transactions on Programming Languages and Systems (TOPLAS), v.26 n.4, p.609-651, July 2004
	Grigore Roşu, Behavioral abstraction is hiding information, Theoretical Computer Science, v.327 n.1-2, p.197-221, 25 October 2004
	Holger Giese , Stefan Henkler , Martin Hirsch , Florian Klein, Nobody's perfect: interactive synthesis from parametrized real-time scenarios, Proceedings of the 2006 international workshop on Scenarios and state machines: models, algorithms, and tools, May 27-27, 2006, Shanghai, China
	Yngve Lamo , Michał Walicki, Quantifier-free logic for nondeterministic theories, Theoretical Computer Science, v.355 n.2, p.215-227, 11 April 2006
	Fairouz Tchier, Demonic fixed points, Acta Cybernetica, v.17 n.3, p.533-555, January 2006
	Michał Walicki , Magne Haveraaen , Sigurd Meldal, Computation Algebras, Mathematical Structures in Computer Science, v.11 n.5, p.597-636, October 2001
	Harald Fecher , Heiko Schmidt, Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems, Electronic Notes in Theoretical Computer Science (ENTCS), v.192 n.1, p.45-60, October, 2007
	Stefan Henkler , Joel Greenyer , Martin Hirsch , Wilhelm Schafer , Kahtan Alhawash , Tobias Eckardt , Christian Heinzemann , Renate Loffler , Andreas Seibel , Holger Giese, Synthesis of timed behavior from scenarios in the Fujaba Real-Time Tool Suite, Proceedings of the 2009 IEEE 31st International Conference on Software Engineering, p.615-618, May 16-24, 2009
	Michal Armoni , Mordechai Ben-Ari, The concept of nondeterminism: its development and implications for teaching, ACM SIGCSE Bulletin, v.41 n.2, June 2009