Skip to main content

Model checking mobile processes

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Andersen and G. Winskel. Compositional checking of satisfaction. In Proc. 3rd Workshop on Computer Aided Verification, pages 49–65, July 1991.

    Google Scholar 

  2. R. Cleaveland, J. Parrow, and B. Steffen. A semantics based verification tool for finite state systems. In Proc. 9th IFIP Symp. Protocol Specification, Verification and Testing, 1989.

    Google Scholar 

  3. R. Cleaveland and B. Steffen. Computing behavioural relations, logically. In Proc. IGALP'91, 1991.

    Google Scholar 

  4. M. Hennessy and H. Lin. Symbolic bisimulations. Dept. of Computer Science, University of Sussex, Report 1/92, 1992.

    Google Scholar 

  5. M. Hennessy and X. Liu. A modal logic for message passing processes. Dept. of Computer Science, University of Sussex, Report 3/93, 1993.

    Google Scholar 

  6. B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of nonfinite-state programs. Information and Computation, 1992.

    Google Scholar 

  7. K. G. Larsen. Proof systems for Hennessy-Milner logic with recursion. in Proc. 13th CAAP Lecture Notes in Computer Science, 299, 1988.

    Google Scholar 

  8. R. Milner. Communication and Concurrency. Prentice Hall International, 1989.

    Google Scholar 

  9. R. Milner. The polyadic π-calculus: A tutorial. Technical Report ECS-LFCS-91-180, Laboratory for the Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1991.

    Google Scholar 

  10. R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2:119–141, 1992.

    Google Scholar 

  11. R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. Technical Report R91:03, SICS, 1991. To appear in Theoretical Computer Science.

    Google Scholar 

  12. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1):1–40 and 41–77, 1992.

    Google Scholar 

  13. F. Orava and J. Parrow. An algebraic verification of a mobile network. Formal Aspects of Computing, pages 497–543, 1992.

    Google Scholar 

  14. D. Sangiorgi. From π-calculus to higher-order π-calculus-and back. To appear in Proc. TAPSOFT'93, 1993.

    Google Scholar 

  15. C. Stirling. Modal logics for communicating systems. Theoretical Computer Science, 49:311–347, 1987.

    Article  Google Scholar 

  16. C. Stirling. Modal and temporal logics for processes. Technical Report ECS-LFCS-92-221, LFCS, Dept. of Computer Science, University of Edinburgh, 1992.

    Google Scholar 

  17. C. Stirling and D. Walker. Local model checking in the modal mu-calculus. Theoretical Computer Science, 89:161–177, 1991.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Eike Best

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dam, M. (1993). Model checking mobile processes. In: Best, E. (eds) CONCUR'93. CONCUR 1993. Lecture Notes in Computer Science, vol 715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57208-2_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-57208-2_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57208-4

  • Online ISBN: 978-3-540-47968-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics