Skip to main content

Acceptance Automata: A framework for specifying and verifying TCSP parallel systems

  • Submitted Presentations
  • Conference paper
  • First Online:
PARLE '91 Parallel Architectures and Languages Europe (PARLE 1991)

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

  • 118 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Autebert, J.M., Gabarro, J., Serna, M.J. “Finite memory CSP and CCS devices.” Internal Rport, Departamento de Lenguajes y Sistemas Informáticos, 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.

    Google Scholar 

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

    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. 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.

    Google Scholar 

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

    Google Scholar 

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

    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 TAPSOFT'89, LNCS 352 (1989) 328–344.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Emile H. L. Aarts Jan van Leeuwen Martin Rem

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag

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. PARLE 1991. Lecture Notes in Computer Science, vol 506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54152-7_59

Download citation

  • DOI: https://doi.org/10.1007/3-540-54152-7_59

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54152-3

  • Online ISBN: 978-3-540-47472-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics