Abstract
In this paper we show that, given a family of interacting systems, many notions which are important for expressing properties of systems can be modeled as sheaves over a suitable topological space. In such contexts, geometric logic can be used to test whether “local” properties can be lifted to a global level. We develop a way to use this method in the study of interacting systems, illustrated by examples.
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
J. Adámek and V. Trnková. Automata and Algebras in Categories. Kluwer Academic Publishers, 1990.
E.M. Clarke, O. Grumberg, and D.E. Long. Model checking. In Nato ASI Series F, volume 152, New York, Heidelberg, Berlin, 1996. Springer-Verlag.
C.C. Chang and H.J. Keisler. Model Theory. North-Holland, Amsterdam, 3rd edition, 1990.
G.L. Cattani and G. Winskel. Presheaf models for concurrency. In D. van Dalen and M. Bezem, editors, Proceedings of Computer Science Logic’ 96, LNCS 1258, pages 58-75. Springer Verlag, Berlin, 1996.
V. Diekert. Combinatorics on Traces. In LNCS 454. Springer Verlag, 1990.
J.A. Goguen. Sheaf semantics for concurrent interacting objects. Mathematical Structures in Computer Science, 11:159–191, 1992.
P. Johnstone. Stone Spaces. Cambridge Studies in Advanced Mathematics 3. Cambridge University Press, 1982.
F. Kröger. Temporal Logic of Programs, volume 8 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1987.
J. Lilius. A sheaf semantics for Petri nets. Technical Report A23, Dept. of Computer Science, Helsinki University of Technology, 1993.
G. Malcolm. Interconnections of object specifications. In R. Wieringa and R. Feenstra, editors, Working Papers of the International Workshop on Information Systems — Correctness and Reusability, 1994. Appeared as internal report IR-357 of the Vrije Universiteit Amsterdam.
S. Mac Lane and I. Moerdijk. Sheaves in Geometry and Logic. Universitext. Springer Verlag, 1992.
L. Monteiro and F. Pereira. A sheaf theoretic model for concurrency. Proc. Logic in Computer Science (LICS’86), 1986.
J. Pfalzgraf. Logical fiberings and polycontextural systems. In P. Jorrand and J. Kelemen, editors, Proc. Fundamentals of Artificial Intelligence Research, volume 535 of LNCS (subseries LNAI), pages 170–184. Springer Verlag, 1991.
V. Sofronie. Towards a sheaf theoretic approach to cooperating agents scenarios. In J. Calmet, J.A. Campbell, and J. Pfalzgraf, editors, Proceedings of Artificial Intelligence and Symbolic Mathematical Computation, International Conference, AISMC-3, Steyr, LNCS 1138, pages 289–304. Springer-Verlag, 1996.
V. Sofronie-Stokkermans. Fibered Structures and Applications to Automated Theorem Proving in Certain Classes of Finitely-Valued Logics and to Modeling Interacting Systems. PhD thesis, RISC-Linz, J. Kepler University Linz, 1997.
G. Winskel. A presheaf semantics of value-passing proceses. In Montanari and Sassone, editors, Concurrency Theory: 7th International Conference, CONCUR’ 96 Proceedings, LNCS 1119, pages 98–114, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sofronie-Stokkermans, V., Stokkermans, K. (1999). Modeling interaction by sheaves and geometric logic. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_43
Download citation
DOI: https://doi.org/10.1007/3-540-48321-7_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66412-3
Online ISBN: 978-3-540-48321-2
eBook Packages: Springer Book Archive