Transition system specifications with negative premises

  • Jan Friso Groote
Selected Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 458)


In this article the general approach to Plotkin style operational semantics of


Logic Programming Transition Relation Operational Semantic Conservative Extension Deductive Database 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. Abramsky (1987): Observation equivalence as a testing equivalence. Theoretical Computer Science 53, pp.225–241.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    J.C.M. Baeten & J.A. Bergstra (1988): Global renaming operators in concrete process algebra. I&C 78(3), pp. 205–245.Google Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    R. Cleaveland & M. Hennessy (1988): Priorities in process algebra. In: Proceedings 3th Annual Symposium on Logic in Computer Science (LICS), Edinburgh, pp. 193–202.Google Scholar
  7. [7]
    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.Google Scholar
  8. [8]
    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.).Google Scholar
  9. [9]
    R. Milner (1989): Communication and concurrency, Prentice-Hall International.Google Scholar
  10. [10]
    F. Moller (1989): Axioms for concurrency. Ph.D. Thesis, Report CST-59-89, Department of Computer Science, University of Edinburgh.Google Scholar
  11. [11]
    I.C.C. Phillips: CCS with Broadcast Stability. Unpublished manuscript.Google Scholar
  12. [12]
    G.D. Plotkin (1981): A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University.Google Scholar
  13. [13]
    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.Google Scholar
  14. [14]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Jan Friso Groote
    • 1
  1. 1.Centre for Mathematics and Computer ScienceAmsterdamThe Netherlands

Personalised recommendations