Skip to main content

A Symbolic Semantics and Bisimulation for Full Lotos

  • Conference paper

Part of the IFIP International Federation for Information Processing book series (IFIPAICT,volume 69)

Abstract

A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined; the semantics extends the (infinitely branching) standard semantics by giving meaning to data parameterised behaviours, and provides a finitely branching representation for behaviours. Symbolic bisimulation is defined. This extends our previous work [14], making the definitions more amenable to automated reasoning and processes with recursion.

Keywords

  • LOTOS
  • symbolic transition systems
  • symbolic bisimulation

References

  1. T. Bolognesi, editor. Catalogue of LOTOS Correctness Preserving Transformations. Technical Report Lo/WP1/T1.2/N0045, The LOTOSPHERE Esprit Project, 1992.

    Google Scholar 

  2. E. Brinksma. From Data Structure to Process Structure. In K.G. Larsen and A. Skou, editors, Proceedings of CAV 91, LNCS 575, pages 244–254, 1992.

    Google Scholar 

  3. J. Bryans and C. Shankland. Implementing a modal logic over data and processes using XTL. In this volume. Kluwer, 2001.

    Google Scholar 

  4. J. Bryans, A. Verdejo, and C. Shankland. Using Rewriting Logic to implement the modal logic FULL. In D. Nowak, editor, AVoCS’01: Workshop on Automated Verification of Critical Systems, 2001. Oxford University Computing Laboratory technical report PRG-RR-01-07.

    Google Scholar 

  5. M. Calder, S. Maharaj, and C. Shankland. A Modal Logic for Full LOTOS based on Symbolic Transition Systems. The Computer Journal, 2001. In press.

    Google Scholar 

  6. M. Calder, S. Maharaj, and C. Shankland. An Adequate Logic for Full LOTOS. In J. Oliveira and P. Zave, editors, Formal Methods Europe’01, LNCS 2021, pages 384–395. Springer-Verlag, 2001.

    Google Scholar 

  7. M. Calder and C. Shankland. A Symbolic Semantics and Bisimulation for Full LOTOS. Technical Report TR-2001-77, University of Glasgow, 2001. Extended version.

    Google Scholar 

  8. H. Eertink. Simulation Techniques for the Validation of LOTOS Specifications. PhD thesis, University of Twente, 1994.

    Google Scholar 

  9. R. Gotzhein. Specifying Abstract Data Types with LOTOS. In B. Sarikaya and G.V. Bochmann, editors, Protocol Specification, Testing, and Verification, VI, pages 15–26. Elsevier Science Publishers B.V. (North-Holland), 1987.

    Google Scholar 

  10. M. Hennessy and H. Lin. Symbolic Bisimulations. Theoretical Computer Science, 138:353–389, 1995.

    MathSciNet  CrossRef  MATH  Google Scholar 

  11. International Organisation for Standardisation. Information Processing Systems — Open Systems Interconnection — LOTOS — A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour, 1988.

    Google Scholar 

  12. L. Logrippo, M. Faci, and M. Haj-Hussein. An Introduction to LOTOS: Learning by Examples. Computer Networks and ISDN Systems, 23:325–342, 1992.

    CrossRef  Google Scholar 

  13. P. Robinson and C. Shankland. Implementing the modal logic FULL using Ergo. In D. Nowak, editor, AVoCS’01: Workshop on Automated Verification of Critical Systems, 2001. Oxford University Computing Laboratory technical report PRG-RR-01-07.

    Google Scholar 

  14. C. Shankland and M. Thomas. Symbolic Bisimulation for Full LOTOS. In M. Johnson, editor, Algebraic Methodology and Software Technology, Proceedings of AMAST 97, LNCS 1349, pages 479–493. Springer-Verlag, 1997.

    Google Scholar 

  15. M. Thomas. The Story of the Therac-25 in LOTOS. High Integrity Systems Journal, 1(1):3–15, 1994.

    Google Scholar 

  16. M. Thomas. Modelling and Analysing User Views of Telecommunications Services. In Feature Interactions in Telecommunications Systems, pages 168–183. IOS Press, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2001 IFIP International Federation for Information Processing

About this paper

Cite this paper

Calder, M., Shankland, C. (2001). A Symbolic Semantics and Bisimulation for Full Lotos. In: Kim, M., Chin, B., Kang, S., Lee, D. (eds) Formal Techniques for Networked and Distributed Systems. FORTE 2001. IFIP International Federation for Information Processing, vol 69. Springer, Boston, MA. https://doi.org/10.1007/0-306-47003-9_12

Download citation

  • DOI: https://doi.org/10.1007/0-306-47003-9_12

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-7923-7470-1

  • Online ISBN: 978-0-306-47003-5

  • eBook Packages: Springer Book Archive