Abstract
It is meaningful that a language is provided with several semantic descriptions: e.g. one which serves the needs of the implementor, another one that is suitable for specification and yet another one that will be used to explain the language to the user. In this case one has to guarantee that the various semantics are ’consistent’. The attempt of this paper is to clarify the notion ’consistency’ and to give categorical characterizations of consistency results. Applications to verification as well as compositional semantics are considered.
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky, A. Jung: Domain Theory, In S. Abramsky, D.M. Gabbay and T.S.E. Maibaum, (ed.), Handbook of Logic in Computer Science, Vol. 3, Clarendon Press, 1994.
C. Baier, M.E. Majster-Cederbaum: The Connection between an Event Structure Semantics and an Operational Semantics for TCSP, Acta Informatica 31, 1994.
C. Baier, M.E. Majster-Cederbaum: Denotational Semantics in the CPO and Metric Approach, Theoretical Computer Science, Vol. 135, 1994.
C. Baier, M.E. Majster-Cederbaum: Construction of a CMS on a given CPO, Techn. Report 28/95, Universität Mannheim, 1994, submitted for publication to Acta Informatica.
J.W. de Bakker, J.J.Ch. Meyer: Metric Semantics for Concurrency, Report CS-R8803, Centre for Mathematics and Computer Science, Amsterdam, 1988.
J.W. de Bakker, J.H.A. Warmerdam: Metric Pomset Semantics for a Concurrent Language with Recursion, Report CS-R9033, Centre for Mathematics and Computer Science, Amsterdam, July 1990.
G. Boudol, I.Castellani: Concurrency and Atomicity, Theoretical Computer Science, Vol. 59, 1988.
G. Boudol, I.Castellani: Three Equivalent Semantics for CCS, Lecture Notes in Computer Science 469, Springer-Verlag, 1990.
S.D. Brookes, C.A.R. Hoare, A.W. Roscoe: A Theory of Communicating Sequential Processes, Journal of the ACM, Vol. 31, No. 3, July 1984.
E.M. Clarke, E.A. Emerson: Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic, Proc. Workshop on Logics of Programs, Lecture Notes in Computer Science 131, 1981.
P. Degano, R. De Nicola, U. Montanari: On the Consistency of’ Truly Concurrent’ Operational and Denotational Semantics, Proc. Symposium on Logic in Computer Science, Edinburgh, 1988.
G. Gierz, H. Hofmann, K. Keimel, J. Lawson, M. Mislove, D. Scott: A Compendium of Continuous Lattices, Springer-Verlag, 1980.
U. Goltz, R. Loogen: Modelling Nondeterministic Concurrent Processes with Event Structures, Fundamenta Informaticae, Vol. 14, No.1, 1991.
U. Goltz, A. Mycroft: On the Relationship of CCS and Petri Nets, Proc. ICALP 84, Lecture Notes in Computer Science 172, Springer-Verlag, 1984.
M. Hennessy: Axiomatising Finite Delay Operators, Acta Informatica Vol 21 1984.
M. Hennessy, R. Milner: On Observing Nondeterminism and Concurrency, in Automata, Languages and Programming, Lecture Notes in Computer Science 85 1980.
C.A.R. Hoare: Communicating Sequential Processes, Prentice Hall, 1985.
C.A.R. Hoare, P.E. Lauer: Consistent and Complementary Formal Theories of the Semantics of Programming Languages, Acta Informatica, Vol. 3, 1974.
E. Horita: A Fully Abstract Model for a Nonuniform Concurrent Language with Parametrization and Locality, in Proc. REX Workshop '92, Lecture Notes in Computer Science 666, Springer-Verlag 1993.
J.N. Kok, J.J.M.M. Rutten: Contractions in Comparing Concurrency Semantics, Report CS-R8755, Centre for Mathematics and Computer Science, November 1987.
L. Lamport: Specifying Concurrent Program Modules, ACM Transactions on Programming Languages and Systems, Vol. 5, No. 2, 1983.
M. Majster-Cederbaum: General Properties of Semantics, Habilitation Thesis, Technische Universität München, 1983.
M. Majster-Cederbaum, C. Baier: Metric Completion versus Ideal Completion, to appear in Theoretical Computer Science, Vol. 170. (Extended abstract in Proc. STRICT 95, J. Desel (ed.), Springer-Verlag.)
M. Majster-Cederbaum, F. Zetzsche: The comparison of a CPO-Based with a CMS-Based Semantics for CSP, Theoretical Computer Science, Vol. 124, 1994.
R. Milner: A Calculus of Communicating Systems, Lecture Notes in Computer Science 92, Springer-Verlag, 1980.
R. Milner: Communication and Concurrency, Prentice Hall, 1989.
M.W. Mislove, F.J. Oles: Full Abstraction and Unnested Recursion, in Proc. REX Workshop '92, Lecture Notes in Computer Science 666, Springer-Verlag, 1993.
R. de Nicola, M. Hennessy: Testing Equivalences for Processes, Theoretical Computer Science, Vol. 34, 1984.
E.R. Olderog: TCSP: Theory of Communicating Sequential Processes, Advances in Petri-Nets 1986, Lecture Notes in Computer Science 255, Springer-Verlag, 1987.
E.R. Olderog: Operational Petri-Net Semantics for CCSP, Advances in Petri-Nets 1987, Lecture Notes in Computer Science 266, Springer-Verlag, 1987.
A. Pnueli: The Temporal Logic of Programs, 18th Ann. Symp. on Foundations of Computer Science, Providence, 1977.
W. Reisig: Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness, Proc. ICALP 84, Lecture Notes in Computer Science 172, Springer-Verlag, 1984.
W. Reisig: Elements of a Temporal Logic Coping with Concurrency, SFB-Bericht 342/23, 92A, Techn. Universität München, 1992.
M. Spanier: Vergleich zweier Theorien nebenläufiger Prozesse, Ph.D.Thesis, Universität Mannheim, 1993.
G. Winskel: Synchronisation Trees, Theoretical Computer Science, Vol. 34, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baier, C., Majster-Cederbaum, M. (1996). A categorical characterization of consistency results. In: Wirsing, M., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1996. Lecture Notes in Computer Science, vol 1101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014334
Download citation
DOI: https://doi.org/10.1007/BFb0014334
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61463-0
Online ISBN: 978-3-540-68595-1
eBook Packages: Springer Book Archive