Abstract
Multirelations have been used for modelling games, protocols and computations. They have also been used for modelling contact, closure and topology. We bring together these two lines of research using relation algebras and more general algebras. In particular, we look at various properties of multirelations that have been used in the two lines of research, show how these properties are connected and study by which multirelational operations they are preserved. We find that many results do not require a restriction to up-closed multirelations; this includes connections between various kinds of reflexive-transitive closure.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aumann, G.: Kontakt-Relationen. Sitzungsberichte der Bayerischen Akademie der Wissenschaften, Mathematisch-Naturwissenschaftliche Klasse, pp. 67–77 (1970)
Aumann, G.: Kontakt-Relationen (2. Mitteilung). Sitzungsberichte der Bayerischen Akademie der Wissenschaften, Mathematisch-Naturwissenschaftliche Klasse, pp. 119–122 (1971)
Aumann, G.: Kontaktrelationen. Mathematisch-physikalische Semesterberichte zur Pflege des Zusammenhangs von Schule und Universität 20, 182–188 (1973)
Aumann, G.: AD ARTEM ULTIMAM – Eine Einführung in die Gedankenwelt der Mathematik. R. Oldenbourg Verlag (1974)
Back, R.J., von Wright, J.: Refinement Calculus. Springer, New York (1998)
Berghammer, R.: Ordnungen, Verbände und Relationen mit Anwendungen, 2nd edn. Springer (2012)
Berghammer, R., Guttmann, W.: A relation-algebraic approach to multirelations and predicate transformers. In: Hinze, R., Voigtl\"{a}nder, J. (eds.) MPC 2015. LNCS, vol. 9129, pp. 50–70. Springer, Heidelberg (2015)
Blanchette, J.C., Böhme, S., Paulson, L.C.: Extending Sledgehammer with SMT solvers. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 116–130. Springer, Heidelberg (2011)
Blanchette, J.C., Nipkow, T.: Nitpick: A counterexample generator for higher-order logic based on a relational model finder. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 131–146. Springer, Heidelberg (2010)
Cavalcanti, A., Woodcock, J., Dunne, S.: Angelic nondeterminism in the unifying theories of programming. Formal Aspects of Computing 18(3), 288–307 (2006)
Furusawa, H., Nishizawa, K., Tsumagari, N.: Multirelational models of lazy, monodic tree, and probabilistic Kleene algebras. Bulletin of Informatics and Cybernetics 41, 11–24 (2009)
Furusawa, H., Struth, G.: Concurrent dynamic algebra. ACM Transactions on Computational Logic 16(4:30), 1–38 (2015)
Furusawa, H., Tsumagari, N., Nishizawa, K.: A non-probabilistic relational model of probabilistic Kleene algebras. In: Berghammer, R., Möller, B., Struth, G. (eds.) RelMiCS/AKA 2008. LNCS, vol. 4988, pp. 110–122. Springer, Heidelberg (2008)
Guttmann, W.: Algebras for correctness of sequential computations. Sci. Comput. Program. 85(Part B), 224–240 (2014)
Guttmann, W.: Multirelations with infinite computations. Journal of Logical and Algebraic Methods in Programming 83(2), 194–211 (2014)
Martin, C.E., Curtis, S.A.: The algebra of multirelations. Mathematical Structures in Computer Science 23(3), 635–674 (2013)
Martin, C.E., Curtis, S.A., Rewitzky, I.: Modelling angelic and demonic nondeterminism with multirelations. Sci. Comput. Program. 65(2), 140–158 (2007)
Möller, B.: Kleene getting lazy. Sci. Comput. Program. 65(2), 195–214 (2007)
Parikh, R.: Propositional logics of programs: new directions. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 347–359. Springer, Heidelberg (1983)
Paulson, L.C., Blanchette, J.C.: Three years of experience with Sledgehammer, a practical link between automatic and interactive theorem provers. In: Sutcliffe, G., Ternovska, E., Schulz, S. (eds.) Proceedings of the 8th International Workshop on the Implementation of Logics, pp. 3–13 (2010)
Peleg, D.: Concurrent dynamic logic. J. ACM 34(2), 450–479 (1987)
Preoteasa, V.: Algebra of monotonic Boolean transformers. In: Simao, A., Morgan, C. (eds.) SBMF 2011. LNCS, vol. 7021, pp. 140–155. Springer, Heidelberg (2011)
Rewitzky, I.: Binary multirelations. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds.) TARSKI. LNCS, vol. 2929, pp. 256–271. Springer, Heidelberg (2003)
Rewitzky, I., Brink, C.: Monotone predicate transformers as up-closed multirelations. In: Schmidt, R.A. (ed.) RelMiCS/AKA 2006. LNCS, vol. 4136, pp. 311–327. Springer, Heidelberg (2006)
Schmidt, G.: Relational Mathematics. Cambridge University Press (2011)
Schmidt, G., Berghammer, R.: Contact, closure, topology, and the linking of row and column types of relations. Journal of Logic and Algebraic Programming 80(6), 339–361 (2011)
Schmidt, G., Hattensperger, C., Winter, M.: Heterogeneous relation algebra. In: Brink, C., Kahl, W., Schmidt, G. (eds.) Relational Methods in Computer Science, ch. 3, pp. 39–53. Springer, Wien (1997)
Tsumagari, N., Nishizawa, K., Furusawa, H.: Multirelational model of lazy Kleene algebra. In: Berghammer, R., Möller, B., Struth, G. (eds.) Relations and Kleene Algebra in Computer Science: PhD Programme at RelMiCS10/AKA5, pp. 73–77. Report 2008-04, Institut für Informatik, Universität Augsburg (2008)
von Wright, J.: Towards a refinement algebra. Sci. Comput. Program. 51(1–2), 23–45 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Berghammer, R., Guttmann, W. (2015). Closure, Properties and Closure Properties of Multirelations. In: Kahl, W., Winter, M., Oliveira, J. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2015. Lecture Notes in Computer Science(), vol 9348. Springer, Cham. https://doi.org/10.1007/978-3-319-24704-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-24704-5_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24703-8
Online ISBN: 978-3-319-24704-5
eBook Packages: Computer ScienceComputer Science (R0)