Abstract
A language for specifying nondeterministic operations which generalizes the equational specification language is introduced. Then, various notions of generated multimodels are discussed and sufficient conditions for the existence of quasi-initial semantics of nondeterministic specifications are given. Two calculi are introduced: NEQ and NIP. The former is sound and complete with respect to the class of all multimodels. The latter is an extension of the former with the ω-rule. It is sound and complete with respect to one of the classes of the generated multimodels. The calculi reduce to the respective deterministic calculi whenever the specification involves only deterministic operations.
This work has been partially supported by the Architectural Abstraction project under NFR (Norway), by CEC under ESPRIT-II Basic Reearch Working Group No. 6112 COMPASS, by the US DARPA under ONR contract N00014-92-J-1928, N00014-93-1-1335 and by the US Air Force Office of Scientific Research under Grant AFOSR-91-0354.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bergstra, J.A., Klop, J.W., “Algebra of communicating processes,” Proc. of CWI Symposium on Mathematics and CS, 89–138, Oct. 6–7 1986.
Broy, M., Gnatz, R., Wirsing, M., “Semantics of Nondeterministic and Noncontinuous Constructs,” LNCS, vol. 69, Springer, 1980, pp. 553–392.
Broy, M., Wirsing, M., “On the Algebraic Specification of Nondeterministic Programming Languages,” in CAAP'81, LNCS, vol. 112, Springer, 1981, pp. 162–179.
Broy, M., “On the Herbrand Kleene universe for nondeterministic computations,” in Proc. MFCS'84, LNCS, vol. 176, Springer, 1984.
Chang, C.C., Keisler, H.J., Model Theory, Amsterdam, North-Holand, 1977.
Clinger, W., “Nondeterministic call by need is neither lazy nor by name,” Proc. ACM Symp. LISP and Functional Programming, 226–234, 1982.
Ehrig, H., Mahr, B., Fundamentals of Algebraic Specification, vol. 1, Springer, 1985.
Engelfriet, J., Schmidt, E.M., “IO and OI. 1,” Journal of Computer and System Sciences, vol. 15, 328–353, 1977.
Engelfriet, J., Schmidt, E.M., “IO and OI. 2,” Journal of Computer and System Sciences, vol. 16, 67–99, 1978.
Goguen, J.A., Meseguer, J., “Completeness of Many-Sorted Equational Logic,” SIGPLAN Notices, vol. 16, no. 7, 1981.
Goguen, J.A., Meseguer, J., “Universal realization, persistent interconnection and implementation of abstract modules,” in Proc., 9th Int. Coll. on Automata, Languages and Programming, LNCS, vol. 140, Springer, 1982.
Goguen, J.A., Meseguer, J., “Remarks on Remarks on Many-Sorted Equational Logic,” SIGPLAN Notices, vol. 22, no. 4, 41–48, April 1987.
Goguen, J.A., What is unification? A categorical view of substitution, equation, and solution, Tech. Rep. CSLI-88-124, Center for Study of Languages and Information, 1988.
Hennessy, M.C.B., “The semantics of call-by-value and call-by-name in a nondeterministic environment,” SIAM J. Comput., vol. 9, no. 1, 1980.
Hesselink, W.H., “A Mathematical Approach to Nondeterminism in Data Types,” ACM Transactions on Programming Languages and Systems, vol. 10, 1988.
Hoare, C.A.R., Communicating Sequential Processes, Prentice-Hall International Ltd., 1985.
Hußmann, H., Nondeterministic Algebraic Specifications, Ph.D. thesis, Fakultät für Mathematik und Informatik, Universität Passau, 1990.
Hußmann, H., Nondeterminism in Algebraic Specifications, and Algebraic Programs, Birkhäuser, 1993.
Huet, G., Oppen, D., “Equations and Rewrite Rules: A Survey,” in Formal Language Theory: Perspectives and Open Problems, Academic Press, 1980.
Kaplan, S., “Conditional Rewriting,” in Conditional Term Rewriting Systems, LNCS, vol. 308, Springer, 1987.
Kaplan, S., “Rewriting with a Nondeterministic Choice Operator,” Theoretical Computer Science, vol. 56, 37–57, 1988.
Kapur, D., Towards a theory of abstract data types, Ph.D. thesis, Laboratory for CS, MIT, 1980.
Milner, R., Calculi for Communicating Systems, LNCS vol. 92, Springer, 1980.
Mosses, P.D., “Unified Algebras and Institutions,” in Proc. of LICS'89, Fourth Annual Symposium on Logic in Computer Science, 1989.
Nipkow, T., “Non-deterministic Data Types: Models and Implementations,” Acta Informatica, vol. 22, 629–661, 1986.
Nipkow, T., “Observing nondeterministic data types,” in Recent Trends in Data Type Specification, LNCS, vol. 332, Springer, 1987.
Nourani, F., “On induction for program logic: Syntax, semantics, and inductive closure,” EATCS Bulletin, vol. 13, 1981.
Plotkin, G., “A power domain construction,” SIAM Jour. Comp., vol. 5, no. 3, 452–487, 1976.
Plotkin, G., Apt, K.R., “Countable Nondeterminism and Random Assignment,” Tech. Rep. University of Edinburgh, 1982.
Søndergaard, H., Sestoft, P., Non-Determinacy and Its Semantics, Tech. Rep. 86/12, Datalogisk Institut, Københavns Universitet, January 1987.
Smyth, M.B., “Power domains,” J. of Computer and System Sciences, vol. 16, 1978.
Volger, H., “The semantics of disjunctive deductive databases,” in CSL'89, LNCS, vol. 440, Springer, 1989.
Walicki, M.A., Meldal, S., “Singular and plural nondeterministic parameters,” SIAM Joum. of Computing (submitted),.
Walicki, M.A., Meldal, S., “A complete calculus for the multialgebraic and functional semantics of nondeterminism,” ACM Transactions on Programming Languages and Systems (submitted),.
Walicki, M., Meldal, S., “Sets and Nondeterminism,” in Proc. of the Workshop on Logic Programming with Sets: ICLP'93, 1993.
Walicki, M., Algebraic Specifications of Nondeterminism, Ph.D. thesis, University of Bergen, Department of Informatics, 1993.
Walicki, M., Meldal, S., “Initiality + Nondeterminism Implies Junk,” in Proc. of NIK'93, Haveraaen, M., Tapir, November 1993, pp. 129–138.
Walicki, M., Meldal, S., “Multialgebras, Power Algebras and Complete Calculi of Identities and Inclusions,” to be publsihed in Recent Trends in Data Type Specifications, LNCS 1995.
Winskel, G., “An introduction to event structures,” LNCS, vol. 354, Springer, 1988.
Wirsing, M., Algebraic Specification, Tech. Rep. MIP-8914, Universität Passau, 1989.
Wirsing, M., “Algebraic Specification,” in Handbook of Theoretical Computer Science, vol. B, The MIT Press, 1990.
Wolter, U., Löwe, M., “Beyond Conditional Equations,” in CAAP'92, LNCS, vol. 581, Springer, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walicki, M., Meldal, S. (1995). Generated models and the ω-rule: The nondeterministic case. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds) TAPSOFT '95: Theory and Practice of Software Development. CAAP 1995. Lecture Notes in Computer Science, vol 915. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59293-8_211
Download citation
DOI: https://doi.org/10.1007/3-540-59293-8_211
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59293-8
Online ISBN: 978-3-540-49233-7
eBook Packages: Springer Book Archive