Advertisement

Tackling the RPC-memory specification problem with I/O automata

  • Judi Romijn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1169)

Abstract

An I/O automata solution to the problem posed in 1994 by Broy & Lamport at the Dagstuhl Workshop on Reactive Systems is presented. The problem calls for specification and verification of memory and remote procedure call components. The problem specification consists of an untimed and a timed part. In this paper, both parts are solved completely.

Keywords

Concurrency protocol verification I/O automata fairness liveness real time 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Abadi, L. Lamport, and S. Merz. A TLA solution to the RPC-Memory specification problem, 1996. This volume.Google Scholar
  2. 2.
    E. Astesiano and G. Reggio. A dynamic specification of the RPC-Memory problem, 1996. This volume.Google Scholar
  3. 3.
    E. Best. A memory module specification using composable high level nets, 1996. This volume.Google Scholar
  4. 4.
    J. Blom and B. Jonsson. Constraint oriented temporal logic specification, 1996. This volume.Google Scholar
  5. 5.
    M. Broy. A functional solution to the RPC-Memory specification problem, 1996. This volume.Google Scholar
  6. 6.
    J.R. Cuéllar, D. Barnard, and M. Huber. A solution relying on the model checking of boolean transition systems, 1996. This volume.Google Scholar
  7. 7.
    R. Gawlick, R. Segala, J.F. Søgaard-Andersen, and N. Lynch. Liveness in timed and untimed systems. In S. Abiteboul and E. Shamir, editors, Proceedings 21th ICALP, Jerusalem, volume 820 of Lecture Notes in Computer Science. Springer-Verlag, 1994. A full version appears as MIT Technical Report number MIT/LCS/TR-587.Google Scholar
  8. 8.
    R. Gotzhein. Applying a temporal logic to the RPC-Memory specification problem, 1996. This volume.Google Scholar
  9. 9.
    J. Hooman. Using PVS for an assertional verification of the RPC-Memory specification problem, 1996. This volume.Google Scholar
  10. 10.
    H. Hungar. Specification and verification using symbolic timing diagrams, 1996. This volume.Google Scholar
  11. 11.
    N. Klarlund, M. Nielsen, and K. Sunesen. A case study in verification based on trace abstractions, 1996. This volume.Google Scholar
  12. 12.
    R. Kurki-Suonio. Incremental specification with joint actions: The RPC-Memory specification problem, 1996. This volume.Google Scholar
  13. 13.
    K.G. Larsen, B. Steffen, and C. Weise. The methodology of modal constraints, 1996. This volume.Google Scholar
  14. 14.
    N.A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., San Fransisco, California, 1996.Google Scholar
  15. 15.
    N.A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pages 137–151, August 1987. A full version is available as MIT Technical Report MIT/LCS/TR-387.Google Scholar
  16. 16.
    N.A. Lynch and M.R. Tuttle. An introduction to input/output automata. CWI Quarterly, 2(3):219–246, September 1989.Google Scholar
  17. 17.
    N.A. Lynch and F.W. Vaandrager. Forward and backward simulations — part II: Timing-based systems. Technical Report MIT/LCS/TM-487.c, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA, April 1995. To appear in Information and Computation.Google Scholar
  18. 18.
    N.A. Lynch and F.W. Vaandrager. Forward and backward simulations. part I: Untimed systems. Information and Computation, 121(2):214–233, September 1995.CrossRefGoogle Scholar
  19. 19.
    Z. Manna and A. Pnueli. Verifying hybrid systems. In R.L. Grossman, A. Nerode, A.P. Ravn, and H. Rischel, editors, Hybrid Systems, volume 736 of Lecture Notes in Computer Science, pages 4–35. Springer-Verlag, 1993.Google Scholar
  20. 20.
    M. Rinderspacher. The solution of the RPC-Memory specification problem using reachability analysis, 1996. This volume.Google Scholar
  21. 21.
    J.M.T. Romijn and F.W. Vaandrager. A note on fairness in I/O automata. Report CS-R9579, CWI, Amsterdam, December 1995. To appear in Information Processing Letters.Google Scholar
  22. 22.
    K. Stølen. Using relations on Streams to solve the RPC-Memory specification problem, 1996. This volume.Google Scholar
  23. 23.
    R.T. Udink and J.N. Kok. The RPC-Memory specification problem: UNITY plus refinement calculus, 1996. This volume.Google Scholar
  24. 24.
    Wang Yi. Real-time behaviour of asynchronous agents. In J.C.M. Baeten and J.W. Klop, editors, Proceedings CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science, pages 502–520. Springer-Verlag, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Judi Romijn
    • 1
  1. 1.CWIGB AmsterdamThe Netherlands

Personalised recommendations