Skip to main content
SpringerLink
Log in
Book cover

Annual Asian Computing Science Conference

ASIAN 1999: Advances in Computing Science — ASIAN’99 pp 379–380Cite as

A Verification Technique Based on Syntactic Action Refinement in a TCSP-like Process Algebra and the Hennessy-Milner-Logic

  • Conference paper
  • First Online:

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

Abstract

We investigate the conceptual link between action refinement for a process algebra which contains the TCSP-parallel composition operator and recursion on the one hand and action refinement for the Hennessy-Milner-Logic on the other. We show that the assertion p ⊨ ϕ ⇔ P[a↪Q] ⊨ ϕ[a↪Q] where ⋅[a↪Q] denotes the refinement operator both on process terms and formulas holds in the considered framework under weak and reasonable restrictions.

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

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

Learn about institutional subscriptions

References

  1. L. Aceto and M. Hennessy. Adding action refinement to a finite process algebra. Lecture Notes in Computer Science, 510:506–519, 1991.

    MathSciNet  Google Scholar 

  2. S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(3):560–599, July 1984.

    Article  MATH  MathSciNet  Google Scholar 

  3. U. Goltz, R. Gorrieri, and A. Rensink. On syntactic and semantic action refinement. Lecture Notes in Computer Science, 789:385–404, 1994.

    Google Scholar 

  4. D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27(3):333–354, December 1983.

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Majster-Cederbaum and F. Salger. On syntactic action refinement and logic. Technical Report 7/99, Fakultät für Mathematik und Informatik, Universität Mannheim, D7.27, Germany, 1999.

    Google Scholar 

  6. M. Majster-Cederbaum and F. Salger. Syntactic action refinement in the modal mu-calculus and its applications to the verification of reactive systems.Technical Report (in preparation), Fakultät für Mathematik und Informatik, Universität Mannheim, D7.27, Germany, 1999.

    Google Scholar 

  7. R. Milner. A Calculus of Communicating Systems. Springer, Berlin, 1edition, 1980.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Mannheim Fakultät für Mathematik und Informatik, D7, 27, 68131, Mannheim, Germany

    Mila Majster-Cederbaum & Frank Salger

Authors
  1. Mila Majster-Cederbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank Salger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Chennai Mathematical Institute, 92 G.N. Chetty Road, T. Nagar, Chennai, 600 017, India

    P. S. Thiagarajan

  2. School of Computing, National University of Singapore, Lower Kent Ridge Road, Singapore, 119260

    Roland Yap

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Majster-Cederbaum, M., Salger, F. (1999). A Verification Technique Based on Syntactic Action Refinement in a TCSP-like Process Algebra and the Hennessy-Milner-Logic. In: Thiagarajan, P.S., Yap, R. (eds) Advances in Computing Science — ASIAN’99. ASIAN 1999. Lecture Notes in Computer Science, vol 1742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46674-6_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-46674-6_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66856-5

  • Online ISBN: 978-3-540-46674-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation