Skip to main content
SpringerLink
Log in
Book cover

Annual Asian Computing Science Conference

ASIAN 1998: Advances in Computing Science ASIAN 98 pp 125–141Cite as

Taxonomy and Expressiveness of Preemption: A Syntactic Approach

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1538))

Abstract

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

Work supported by IFCPAR (Indo-French Center for the Promotion of Advanced Research), New Delhi

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. G. Berry. Preemption in concurrent systems. In Proc. FSTTCS’93, Bombay, India, LNCS 761, pages 72–93. Springer-Verlag, 1993.

    Google Scholar 

  3. 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. 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. 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. 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. 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. R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 23(3):267–310, 1983.

    Article  MathSciNet  Google Scholar 

  9. R. Milner. A complete axiomatisation for observational congruence of finitestate behaviours. Information and Computation, 81(2):227–247, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  10. 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. 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. G. D. Plotkin. A structural approach to operational semantics. Lect. Notes, Aarhus University, Aarhus, DK, 1981.

    Google Scholar 

  13. Special issue on Real-time systems designs and programming, Proceedings of the IEEE, volume 79, September 1991.

    Google Scholar 

  14. 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. R. De Simone. Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37:245–267, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  16. 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 

Download references

Author information

Authors and Affiliations

  1. EP-ATR Group, IRISA, F-35042, Rennes, France

    Sophie Pinchinat & Éric Rutten

  2. Computer Science Group, Tata Institute of Fundamental Research, Bombay, 400 005, India

    R. K. Shyamasundar

Authors
  1. Sophie Pinchinat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Éric Rutten
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. K. Shyamasundar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Science and Technology, National Chi-Nan University, Puli, Nantou, Taiwan

    Jieh Hsiang

  2. Research Institute for Mathematical Sciences, Kyoto University, Sakyo-ku, Kyoto, 606-8502, Japan

    Atsushi Ohori

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pinchinat, S., Rutten, É., Shyamasundar, R.K. (1998). Taxonomy and Expressiveness of Preemption: A Syntactic Approach. In: Hsiang, J., Ohori, A. (eds) Advances in Computing Science ASIAN 98. ASIAN 1998. Lecture Notes in Computer Science, vol 1538. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49366-2_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-49366-2_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65388-2

  • Online ISBN: 978-3-540-49366-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation