Abstract
We study frameworks for the equivalence of abstract state-transition systems represented as posets. A basic notion of equivalence is proposed. A least fix-point operator transforms basic equivalences into strong equivalences (=Lagois Connections) which makes Lagois Connections into a category. In the absence of divergence, the two notions of equivalence coincide. We generalize these notions by adding a logical level to express divergence more precisely. Then both generalized notions of equivalence coincide even in the presence of divergence.
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
S. Abramsky and R. Jagadeesan New Foundations for the Geometry of Interaction; in the proceedings of the LICS 1992 conference, pp.211–222
J. Adâmek, H. Herrlich and G. Strecker Abstract And Concrete Categories, J. Wiley und Sons, Inc., 1990
G. Birkhoff Lattice Theory, American Mathematical Society Colloquium Publications, volume 25, third edition, third printing, reprinted with corrections, 1984
G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. W. Mislove and D. Scott A Compendium of Continuous Lattices, Springer Verlag, New York, 1980
C. A. Gunter Semantics of Programming Languages, Foundations in Computing Series, The MIT Press, Cambridge, Massachusetts, 1992
R. Jagadeesan and K. Pingali Abstract Semantics for a Higher-Order Functional Language with Logic Variables,in the Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Albuquerque, New Mexico, January 19–22, 1992, ACM Press, pp. 355–366
A. Jung Cartesian Closed Categories of Domains, CWI Tract 66, Amsterdam, 110pp., 1989
S. Mac Lane Categories for the Working Mathematician, Springer Verlag, New York, 1971
A. Melton, B. S. W. Schröder and G. E. Strecker Connections, in the proceedings of the 7th workshop on the Mathematical Foundations of Programming Semantics, LNCS 598, Springer Verlag, New York, 1992, pp. 492–506
A. Melton, B. S. W. Schröder and G. E. Strecker Lagois Connections—a Counterpart to Galois Connections, Technical Report, Department of Information and Computing Sciences, Kansas State University, 1993
R. Milner Communication and Concurrency,Prentice Hall International Series In Computer Science, London, 1989
H. R. Nielson and F. Nielson Semantics With Applications, Wiley Professional Computing, England, 1992
B. C. Pierce Basic Category Theory for Computer Scientists, Foundations of Computing Series, MIT Press 1991
G. Plotkin The category of complete partial orders: a tool of making meaning, in: Proceedings of the Summer School on Foundations of Artificial Intelligence and Computer Science, Instit.uto di Scienze dell’Informazione, Universita di Pisa, 1978
D. A. Schmidt. Denotational Semantics, Allyn and Bacon, Inc., 1986
D. Scott Domains for Denotational Semantics, in: ICALP82, M. Nielsen and E. M. Schmidt (editors), Springer Verlag, LNCS 140, 1982
G. Q. Zhang Logic of Domains, Birkhäuser, Boston, 1991
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 British Computer Society
About this paper
Cite this paper
Huth, M. (1993). On the Equivalence of State-Transition Systems. In: Burn, G., Gay, S., Ryan, M. (eds) Theory and Formal Methods 1993. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3503-6_13
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3503-6_13
Publisher Name: Springer, London
Print ISBN: 978-3-540-19842-0
Online ISBN: 978-1-4471-3503-6
eBook Packages: Springer Book Archive