Abstract
In this article the general approach to Plotkin style operational semantics of
(extended abstract)
The research of the author was supported by ESPRIT project no. 432, An Integrated Formal Approach to Industrial Software Development (METEOR), and by RACE project no. 1046, Specification and Programming Environment for Communication Software (SPECS). A full version of this paper appeared as report CS-R8950, Centrum voor Wiskunde en Informatica, Amsterdam.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky (1987): Observation equivalence as a testing equivalence. Theoretical Computer Science 53, pp.225–241.
K.R. Apt (1988): Introduction to logic programming. Report CS-R8826, Centrum voor Wiskunde en Informatica, Amsterdam, to appear in: Handbook of Theoretical Computer Science, (J. van Leeuwen, Managing Editor), North-Holland.
J.C.M. Baeten & J.A. Bergstra (1988): Global renaming operators in concrete process algebra. I&C 78(3), pp. 205–245.
J.C.M. Baeten, J.A. Bergstra & J.W. Klop (1986): Syntax and defining equations for an interrupt mechanism in process algebra. Fund. Inf. IX(2), pp. 127–168.
B. Bloom, S. Istrail & A.R. Meyer (1988): Bisimulation can't be traced: preliminary report. In: Conference Record of the 15th ACM Symposium on Principles of Programming Languages (POPL), San Diego, California, pp. 229–239.
R. Cleaveland & M. Hennessy (1988): Priorities in process algebra. In: Proceedings 3th Annual Symposium on Logic in Computer Science (LICS), Edinburgh, pp. 193–202.
J.F. Groote & F.W. Vaandrager (1988): Structured operational semantics and bisimulation as a congruence. Report CS-R8845, Centrum voor Wiskunde en Informatica, Amsterdam, under revision for I&C. An extended abstract appeared in: Proceedings ICALP 89, Stresa (G. Ausiello, M. Dezani-Ciancaglini & S. Ronchi Della Rocca, eds.), LNCS 372, Springer-Verlag, pp. 423–438.
R. Langerak (1989): A testing theory for LOTOS using deadlock detection. In: Proceedings 9th IFIP WG6.1 International Symposium on Protocol Specification, Testing, and Verification, June 1989, Enschede, The Netherlands (E. Brinksma, G. Scollo & C.A. Vissers, eds.).
R. Milner (1989): Communication and concurrency, Prentice-Hall International.
F. Moller (1989): Axioms for concurrency. Ph.D. Thesis, Report CST-59-89, Department of Computer Science, University of Edinburgh.
I.C.C. Phillips: CCS with Broadcast Stability. Unpublished manuscript.
G.D. Plotkin (1981): A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University.
A. Pnueli (1985): Linear and branching structures in the semantics and logics of reactive systems. In: Proceedings ICALP 85, Nafplion (W. Brauer, ed.), LNCS 194, Springer-Verlag, pp. 15–32.
T.C. Przymusinski (1987): On the declarative semantics of deductive databases and logic programs. In: Foundations of Deductive Databases and Logic Programming (Jack Minker, ed.), Morgan Kaufmann Publishers, Inc., Los Altos, California, pp. 193–216.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Groote, J.F. (1990). Transition system specifications with negative premises. In: Baeten, J.C.M., Klop, J.W. (eds) CONCUR '90 Theories of Concurrency: Unification and Extension. CONCUR 1990. Lecture Notes in Computer Science, vol 458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039069
Download citation
DOI: https://doi.org/10.1007/BFb0039069
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53048-0
Online ISBN: 978-3-540-46395-5
eBook Packages: Springer Book Archive