Skip to main content

Syntactic Action Refinement in Presence of Multiway Synchronization

  • Conference paper
Semantics of Specification Languages (SoSL)

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

This paper deals with the action refinement problem in process algebra, which consists in replacing actions at a given level of abstraction by processes at a lower level. We show how the problem may be dealt with in presence of multiway synchronization and illustrate our approach by applying it to a language derived from the standardized Formal Description Technique LOTOS [12]. Two solutions are proposed: the first solution does not make any a priori assumption about action atomicity, and the second solution corresponds to a slight modification of the first one, which shows how action atomicity may still be preserved in presence of action refinement.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Aceto, M. Hennessy, Adding action refinement to finite algebra, In M Rodriguez, J Leach Albert, B Monien, editor, Automata, Languages and programming, 18th International Colloquium, volume 510 of LNCS, pages 506–519. Springer-Verlag, 1991.

    Google Scholar 

  2. T. Bolognesi, E. Brinksma, Introduction to the ISO Specification Language LOTOS, Computer Networks and ISDN Systems (North-Holland), No. 14, 1987, pp. 25–59.

    Article  Google Scholar 

  3. R. Coelho Da Costa, J.P. Courtiat, A true concurrency semantics for LOTOS, In Proceedings of the IFIP TC6/WG6.1 5th Int. Conf. on Formal

    Google Scholar 

  4. J.P. Courtiat, D.E. Saïdouni, A Case Study in Protocol Design, In E. Brinksma, T. Bolognesi and C.A. Vissers, editors, Third LotoSphere Workshop & Seminar, Pise, Italy, September 1992.

    Google Scholar 

  5. J.P. Courtiat, D.E. Saïdouni, Action Refinement in LOTOS, In Proceedings of the 13th IFIP Symposium on Protocol Specification, Testing and Verification. (PSTV 93), North-Holland, 1994.

    Google Scholar 

  6. P. Darondeau, P. Degano, About semantic action refinement, Fundamenta Informaticae, XIV: 221–234, 1991.

    Google Scholar 

  7. P. Degano, R. Gorrieri, Atomic refinement in process description languages, In A. Tarlecki. editor, Mathematical Foundations of Computer Science, volume 520 of LNCS, pages 121–130. Springer-Verlag, 1991.

    Google Scholar 

  8. U. Engberg, M. Nielsen, K.S. Larsen, Fully abstract models for a process language with refinement, In J.W. de Bakker, W.P. de Roever and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of LNCS, pages 523–548. Springer-Verlag, 1989.

    Google Scholar 

  9. F. Giannotti, D. Latella, Gate Splitting in LOTOS Specifications Using Abstract Interpretation, TAPSOFT’93, volume 668 of LNCS, pages 437452, Springer-Verlag, 1993.

    Google Scholar 

  10. R. Gorrieri, S. Marchetti, U. Montanari, A2CCS: Atomic Action for CCS, TCS 72: 203–223, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  11. A. Kiehn, E. Best, R. Devillers and L. Pomello, Concurrent bisimulations in Petri nets, Acta Informatica, 28: 231–264, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  12. LOTOS, A Formal Description Technique Based on the Ordering of Observational Behaviour, ISO IS 8807, Novembre, 1988.

    Google Scholar 

  13. Proceeding of the Third LotoSphere Workshop Si Seminar, E Brinksma, T. Bolognesi and C.A. Vissers, editors, Pise, Italy, September 1992.

    Google Scholar 

  14. R. Milner, Communication and Concurrency, C.A.R. Hoare Series Editor. Prentice Hall, 1989.

    Google Scholar 

  15. G. Rozenberg, M. Nielsen, K.S. Thiagarajan, Elementary transition systems and refinement, Acta Informatica, 29: 555–578, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  16. D.E. Saïdouni, J.P. Courtiat, Syntactic Action Refinement in Presence of Multiway Synchronization, Research Report 93129, LAAS-CNRS, April 1993, (extended version of the paper with proofs).

    Google Scholar 

  17. R.J. van Glabbeek, Comparative Concurrency Semantics and Refinement of Actions, PhD thesis, Vrije Universiteit Te Amsterdam, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 British Computer Society

About this paper

Cite this paper

Saïdouni, DE., Courtiat, JP. (1994). Syntactic Action Refinement in Presence of Multiway Synchronization. In: Andrews, D.J., Groote, J.F., Middelburg, C.A. (eds) Semantics of Specification Languages (SoSL). Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3229-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3229-5_16

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19854-3

  • Online ISBN: 978-1-4471-3229-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics