Skip to main content
SpringerLink
Log in

Verification of communicating processes by means of automata reduction and abstraction

  • Conference paper
  • First Online:
STACS 92 (STACS 1992)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. A. Arnold. Construction et analyse des systèmes de transitions: le système MEC. In Actes du Premier Colloque C 3, 1985.

    Google Scholar 

  2. G. Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logics and Models for Concurrent Systems. Springer-Verlag, 1985.

    Google Scholar 

  3. M. Browne, E. Clarke, et al. Automatic verification of sequential circuits using temporal logic. Technical Report CMU-CS-100, Carnegie Mellon University, 1984.

    Google Scholar 

  4. R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics-based tool for the verification of finite-state systems. ACM Transactions on Programming Languages and Systems, To appear.

    Google Scholar 

  5. R. de Simone and D. Vergamini. Aboard AUTO. Technical Report RT111, INRIA, October 1989.

    Google Scholar 

  6. Jean-Claude Fernandez. Aldebaran: A tool for verification of communicating processes. Rapport technique SPECTRE C14, Laboratoire de Génie Informatique-Institut IMAG, Grenoble, September 1989.

    Google Scholar 

  7. H. Korver. The current state of bisimulation tools. Technical Report P9101, CWI, January 1991.

    Google Scholar 

  8. E. Madelaine and D. Vergamini. Finiteness conditions and structural construction of automata for all process algebras. In R. Kurshan, editor, Proceedings of Workshop on Computer Aided Verification, New-Brunswick, June 1990.

    Google Scholar 

  9. R. Milner. A Calculus of Communicating Systems, volume 92 of Lectures Notes in Computer Science. Springer-Verlag, 1980.

    Google Scholar 

  10. V. Roy and R. de Simone. An AUTOGRAPH primer. Technical Report RT112, INRIA, October 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA, Route des Lucioles, Sophia Antipolis, 06565, Valbonne Cedex, France

    Eric Madelaine

  2. CERICS, Avenue Albert Einstein, Sophia Antipolis, 06565, Valbonne Cedex, France

    Didier Vergamini

Authors
  1. Eric Madelaine
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Didier Vergamini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alain Finkel Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Madelaine, E., Vergamini, D. (1992). Verification of communicating processes by means of automata reduction and abstraction. In: Finkel, A., Jantzen, M. (eds) STACS 92. STACS 1992. Lecture Notes in Computer Science, vol 577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_221

Download citation

  • DOI: https://doi.org/10.1007/3-540-55210-3_221

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55210-9

  • Online ISBN: 978-3-540-46775-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation