Abstract
In the present paper we consider the abstract background for designing a practical graph-based computational environment with variable, optional semantics. From the variety of possibilities we concentrate on graphs and polynets as possible carriers of the syntax, and finite automata and flow-diagram programs as possible semantics. We discuss the encapsulation property which emerges in such systems and give precise description of the syntax, operational and denotational semantics in terms of Category Theory. A data structure capable to meet the requirements of a graph-based computational environment is sketched at the end.
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
Burstall, R. An Algebraic Description of Programs with Assertions, Verification and Simulation, Proceedings of ACM Conference on Proving Assertions about Programs, Las Cruces, New Mexico pp.7–14,(1972).
Landin, P.J. A program machine symmetric automata theory. Machine Intelligence 5 (eds. B. Meltzer and D. Michie) Edinburgh University Press, pp.99-120,(1969).
Manes, E., M. Arbib. Algebraic Approaches to Program Semantics, Springer-Verlag, (1986)
Mac Lane, S. Categories for Working Mathematicians, Springer-Verlag, (1971).
Goguen, J., On Homomorphisms, Correctness, Termination, Unfoldment and Equivalence of Flow Diagram Programs, Journal of Computer and System Sciences 8, pp.333–365 (1974).
Meseguer, J., U. Montanari. Petri Nets are Monoids, Tech. Rep. SRI-CSL-88-3, C.S.Lab.,SRI International, January (1988).
Velinov, Y. An algebraic Structure for Derivations in Rewriting Systems, TCS 57, pp.205–224, (1988).
Velinov, Y. Nets Polycategories and Semantics of Parallel Programs, X National School for Scientists “Applications of Math. in Techniques”, Varna, pp.340–351, (1985).
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
Velinov, Y. (1999). On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment. In: Champarnaud, JM., Ziadi, D., Maurel, D. (eds) Automata Implementation. WIA 1998. Lecture Notes in Computer Science, vol 1660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48057-9_18
Download citation
DOI: https://doi.org/10.1007/3-540-48057-9_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66652-3
Online ISBN: 978-3-540-48057-0
eBook Packages: Springer Book Archive