Skip to main content
SpringerLink
Log in

Acceptance Automata: A Framework for Specifying and Verifying TCSP Parallel Systems

  • Conference paper
Parle ’91 Parallel Architectures and Languages Europe

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

  • 710 Accesses

Abstract

Acceptance Automata, a particular case of labelled transition systems whose semantics is given in terms of the Failures Model, are presented. It is shown how parallel composition and hiding can be defined for them in a way consistent with the TCSP model. A notion of canonical automaton is presented. In the finite case it can be effectively computed and used for proving implementations correct. Finally, the TCSP concept of refinement is characterized in the acceptance automata domain.

This work has been partially supported by the ESPRIT-II Basic Research Action COMPASS (Working Group no. 3264).

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Autebert, J.M., Gabarro, J., Sema, M.J. “Finite memory CSP and CCS devices.” Internal Rport, Departamento de Lenguajes y Sistemas Informdticos, Universidad Politécnica de Cataluña (1990).

    Google Scholar 

  2. Brookes, S.D., Hoare, C.A.R., Roscoe, A.W. “A Theory of Communicating Sequential Processes.” Journal of the ACM 31 (1984) 560–599.

    Article  MathSciNet  Google Scholar 

  3. Hennessy, M. “Acceptance Trees.” Journal of the ACM 32 (1985) 896–928.

    Article  MathSciNet  Google Scholar 

  4. Hennessy, M. Algebraic Theory of Processes. MIT Press (1988).

    Google Scholar 

  5. Hoare, C.A.R. Communicating Sequential Processes. Prentice-Hall (1985).

    Google Scholar 

  6. HoJi 85] Hoare, C.A.R., Jifeng, H. “Algebraic Specification and Proof of Properties of Communicating Sequential Processes.” Tech. Rep. PRG-52 (1985) Oxford University Computing Laboratory.

    Google Scholar 

  7. Josephs, M.B. “A state-based approach to communicating processes.” Distributed Computing 3 (1988) 9–18.

    Article  Google Scholar 

  8. de Niccola, R. “Two Complete Axiom Systems for a Theory of Communicating Sequential Processes.” Information and Control 64 (1985) 136–172.

    Article  MathSciNet  Google Scholar 

  9. Olderog, E.-R., Hoare, C.A.R. “Specification-Oriented Semantics for Communicating Processes.” Acta Informatica 23 (1986) 9–66.

    Article  MathSciNet  Google Scholar 

  10. Park, D. “Concurrency and automata on infinite sequences.” Proc. 5th GI Conf. of Theoretical Computer Science, LNCS 104 (1981) 245–251.

    Google Scholar 

  11. Peña, R., Alonso, L.M. “Specification and Verification of TCSP Systems by Means of Partial Abstract Data Types.” In Proceedings TAPSOF I“89, LNCS 352 (1989) 328–344.

    Article  Google Scholar 

  12. Wood, D. Theory of computation. John-Wiley (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Lenguajes y Sistemas Informáticos, Universidad del Pais Vasco, E-20080, San Sebastián, Spain

    Luis M. Alonso

  2. Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, E-08028, Barcelona, Spain

    Ricardo Peña

Authors
  1. Luis M. Alonso
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ricardo Peña
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Philips Research Laboratories, P.O. Box 80.000, 5600 JA, Eindhoven, The Netherlands

    Emile H. L. Aarts

  2. Department of Computer Science, University of Utrecht, Padualaan 14, 3584 CH, Utrecht, The Netherlands

    Jan van Leeuwen

  3. Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Martin Rem

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alonso, L.M., Peña, R. (1991). Acceptance Automata: A Framework for Specifying and Verifying TCSP Parallel Systems. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds) Parle ’91 Parallel Architectures and Languages Europe. Lecture Notes in Computer Science, vol 505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-25209-3_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-25209-3_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-23206-4

  • Online ISBN: 978-3-662-25209-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation