Taxonomy and Expressiveness of Preemption: A Syntactic Approach

  • Sophie Pinchinat
  • Éric Rutten
  • R. K. Shyamasundar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1538)


We propose a taxonomy of preemptive (suspensive and abortive) operators capturing the intuition of such operators that exist in the various synchronous languages. Some of the main contributions of the paper are: a precise notion of preemption is established at a structural level; we show that the class of suspensive operators is strictly more expressive than abortive operators, and we show that suspension is primitive while abortion is not

The proof techniques relies on a syntactic approach, based on SOS-specification formats, to categorize the different preemption features; also an equivalence criterion between operators specifications is proposed to provide us with expressive power measurement


Operational Semantic Label Transition System Equivalence Criterion Open Term Canonical Decomposition 
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. BD92.
    E. Badouel and Ph. Darondeau. Structural operational specifications and trace automata. In Proc. CONCUR’92, Stony Brook, NY, LNCS 630, pages 302–316. Springer-Verlag, August 1992.Google Scholar
  2. Ber93.
    G. Berry. Preemption in concurrent systems. In Proc. FSTTCS’93, Bombay, India, LNCS 761, pages 72–93. Springer-Verlag, 1993.Google Scholar
  3. BIM95.
    B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can’t be traced. Journal of the ACM, 42(1):232–268, January 1995.Google Scholar
  4. GV88.
    J. F. Groote and F. W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Research Report CS-R8845, CWI, November 1988.Google Scholar
  5. GV92.
    J. F. Groote and F. W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202–260, October 1992.Google Scholar
  6. Lar89.
    K. G. Larsen. Compositional theories based on an operational semantics of contexts. In Stepwise Refinement of Distributed Systems. Models, Formalisms, Correctness, Mook, LNCS 430, pages 487–518. Springer-Verlag, May 1989.Google Scholar
  7. Mil81.
    R. Milner. A modal characterisation of observable machine-behaviour. In Proc. CAAP’81, Genoa, LNCS 112, pages 25–34. Springer-Verlag, March 1981.Google Scholar
  8. Mil83.
    R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 23(3):267–310, 1983.CrossRefMathSciNetGoogle Scholar
  9. Mil89.
    R. Milner. A complete axiomatisation for observational congruence of finitestate behaviours. Information and Computation, 81(2):227–247, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  10. Par81.
    D. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI Conf. on Th. Comp. Sci., LNCS 104, pages 167–183. Springer-Verlag, March 1981.Google Scholar
  11. Pin91.
    S. Pinchinat. Ordinal processes in comparative concurrency semantics. In Proc. 5th Workshop on Computer Science Logic, Bern, LNCS 626, pages 293–305. Springer-Verlag, October 1991.Google Scholar
  12. Plo81.
    G. D. Plotkin. A structural approach to operational semantics. Lect. Notes, Aarhus University, Aarhus, DK, 1981.Google Scholar
  13. atpro91.
    Special issue on Real-time systems designs and programming, Proceedings of the IEEE, volume 79, September 1991.Google Scholar
  14. Ren97.
    A. Rensink. Bisimilarity of open terms. In Catuscia Palamidessi and Joachim Parrow, editors, Proc. EXPRESS’ 97: Expressiveness in Concurrency (Santa Margherita Ligure, Italy, September 8–12, 1997), volume 7 of entcs. Elesevier Science Publishers, 1997.Google Scholar
  15. Sim85.
    R. De Simone. Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37:245–267, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  16. SP95.
    R.K. Shyamasundar S. Pinchinat, E. Rutten. Preemption in reactive laguages (a preliminary report). In In Algorithms, Concurrency and Knowledge, Proc. of the Asian Computing Science Conference, ACSC’95, Pathumthani, Thailand, LNCS 1023, pages 111–125. Springer-Verlag, December 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Sophie Pinchinat
    • 1
  • Éric Rutten
    • 1
  • R. K. Shyamasundar
    • 2
  1. 1.EP-ATR GroupIRISARennesFrance
  2. 2.Computer Science GroupTata Institute of Fundamental ResearchBombayIndia

Personalised recommendations