Skip to main content

Assumption-commitment in automata

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1997)

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

Abstract

In the study of distributed systems, the assumption —commitment framework is crucial for compositional specification of processes. The idea is that we reason about each process separately, making suitable assumptions about other processes in the system. Symmetrically, each process commits to certain actions which the other processes can rely on. We study such a framework from an automata-theoretic viewpoint. We present systems of finite state automata which make assumptions about the behaviour of other automata and make commitments about their own behaviour. We characterize the languages accepted by these systems to be the regular trace languages (of Mazurkiewicz) over an associated independence alphabet, and present a syntactic characterization of these languages using top-level parallelism. The results smoothly generalize for automata over infinite words as well.

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.

References

  1. Alur, R., and Henzinger, T., “Local liveness for compositional modelling of fair reactive systems”, LNCS 939, 1995, 166–179.

    Google Scholar 

  2. Cori, R., Metivier, Y. and Zielonka, W., “Asynchronous mappings and asynchronous cellular automata”, Information and Computation, vol 106, 1993, 159–202.

    Article  MATH  MathSciNet  Google Scholar 

  3. Diekert, V. and Muscholl, A., “Deterministic asynchronous automata for infinite traces”, LNCS 665, 1993, 617–628.

    Google Scholar 

  4. Diekert, V. and Rozenberg, G., The book of traces, World Scientific Press, 1995.

    Google Scholar 

  5. Fagin, R., Halpern, J., Moses, Y. and Vardi, M., Reasoning about knowledge, M.I.T. Press, 1995.

    Google Scholar 

  6. Francez, N., and Pnueli, A., “A proof method for cyclic programs”, Acta Inf., vol 9, 1978, 138–158.

    MathSciNet  Google Scholar 

  7. Gastin, P. and Petit, A., “Asynchronous cellular automata for infinite traces”, LNCS 627, 1992, 583–594.

    Google Scholar 

  8. Hoare, C.A.R., “Communicating Sequential processes”, Comm. ACM, vol 21, 1978, 666–677.

    Article  MATH  Google Scholar 

  9. Hoare, C.A.R., Communicating Sequential processes, Prentice Hall, 1985.

    Google Scholar 

  10. Jones, C.B., “Specification and design of (parallel) programs”, Proc IFIP 83, 1983, 321–331.

    Google Scholar 

  11. Misra, J., and Chandy, M., “Proofs of networks of processes”, IEEE Trans. on Soft. Engg., vol 7, 1981, 417–426.

    MATH  MathSciNet  Google Scholar 

  12. Ochmanski, E., “Regular behaviour of concurrent systems”, Bulletin of the EATCS, vol 27, 1985, 56–67.

    Google Scholar 

  13. Pandya, P.K., and Joseph, M., “P-A logic: a compositional proof system for distributed programs”, Distributed Computing, vol 5, 1991, 37–54.

    Article  MATH  MathSciNet  Google Scholar 

  14. Ramanujam, R., “Locally linear time temporal logic”, Proc IEEE LICS, New Jersey, 1996, 118–127.

    Google Scholar 

  15. Zielonka, W., “Notes on finite asynchronous automata”, RAIRO-Inf. Theor. et Appli., vol. 21, 1987, 99–135.

    MATH  MathSciNet  Google Scholar 

  16. Zwiers, J., Compositionality, concurrency and partial correctness, Springer LNCS 321, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

S. Ramesh G Sivakumar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mohalik, S., Ramanujam, R. (1997). Assumption-commitment in automata. In: Ramesh, S., Sivakumar, G. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1997. Lecture Notes in Computer Science, vol 1346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0058029

Download citation

  • DOI: https://doi.org/10.1007/BFb0058029

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63876-6

  • Online ISBN: 978-3-540-69659-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics