Advertisement

Action transducers and timed automata

  • Frits Vaandrager
  • Nancy Lynch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 630)

Abstract

The timed automaton model of [13, 12] is a general model for timing-based systems. A notion of timed action transducer is here defined as an automata-theoretic way of representing operations on timed automata. It is shown that two timed trace inclusion relations are substitutive with respect to operations that can be described by timed action transducers. Examples are given of operations that can be described in this way, and a preliminary proposal is given for an appropriate language of operators for describing timing-based systems. Finally, justification is given for the definition of implementation based on inclusion of timed trace sets; this is done in terms of a notion of feasibility which says that a timed automaton cannot prevent the passage of time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Abadi and L. Lamport. An old-fashioned recipe for real time. In Proceedings of the REX Workshop “Real-Time: Theory in Practice”, LNCS 600. Springer-Verlag, 1992. To appear.Google Scholar
  2. 2.
    R. Alur and D.L. Dill. Automata for modeling real-time systems. In Proceedings 17 th ICALP, LNCS 443, pages 322–335. Springer-Verlag, July 1990.Google Scholar
  3. 3.
    P. America. POOL-T — A parallel object-oriented language. In A. Yonezawa and M. Tokoro, editors, Object-Oriented Concurrent Systems. MIT Press, 1986.Google Scholar
  4. 4.
    J.C.M. Baeten and J.A. Bergstra. Real time process algebra. Journal of Formal Aspects of Computing Science, 3(2):142–188, 1991.MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.Google Scholar
  6. 6.
    B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced: preliminary report. In Conference Record of the 15 th ACM Symposium on Principles of Programming Languages, pages 229–239, 1988.Google Scholar
  7. 7.
    J. Davies and S. Schneider. An introduction to Timed CSP. Technical Monograph PRG-75, Oxford University Computing Laboratory, Programming Research Group, August 1989.Google Scholar
  8. 8.
    C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, 1985.MATHGoogle Scholar
  9. 9.
    A.S. Klusener. Abstraction in real time process algebra. Report CS-R9144, CWI, Amsterdam, October 1991.Google Scholar
  10. 10.
    K.G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. In Proceedings 17 th ICALP, LNCS 443, pages 526–539. Springer-Verlag, July 1990.Google Scholar
  11. 11.
    N.A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6 th Annual ACM Symposium on Principles of Distributed Computing, pages 137–151, August 1987. A full version is available as MIT Technical Report MIT/LCS/TR-387.Google Scholar
  12. 12.
    N.A. Lynch and F.W. Vaandrager. Forward and backward simulations — part II: Timing-based systems, 1992. In preparation.Google Scholar
  13. 13.
    N.A. Lynch and F.W. Vaandrager. Forward and backward simulations for timing based systems. Proceedings of the REX Workshop “Real-Time: Theory in Practice”, LNCS 600. Springer-Verlag, 1992. To appear.Google Scholar
  14. 14.
    M. Merritt, F. Modugno, and M. Tuttle. Time constrained automata. In Proceedings CONCUR 91, LNCS 527, pages 408–423. Springer-Verlag, 1991.Google Scholar
  15. 15.
    R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.MATHGoogle Scholar
  16. 16.
    F. Moller and C. Tofts. A temporal calculus of communicating systems. In Proceedings CONCUR 90, LNCS 458, pages 401–415. Springer-Verlag, 1990.Google Scholar
  17. 17.
    X. Nicollin and J. Sifakis. The algebra of timed processes ATP: Theory and application (revised version). Technical Report RT-C26, LGI-IMAG, Grenoble, France, November 1991.Google Scholar
  18. 18.
    X. Nicollin and J. Sifakis. An overview and synthesis on timed process algebras. In Proceedings CAV 91, LNCS 575, pages 376–398. Springer-Verlag, 1992.Google Scholar
  19. 19.
    X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. Proceedings of the REX Workshop “Real-Time: Theory in Practice”, LNCS 600. Springer-Verlag, 1992. To appear.Google Scholar
  20. 20.
    G.D. Plotkin. A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.Google Scholar
  21. 21.
    G.M. Reed and A.W. Roscoe. A timed model for communicating sequential processes. Theoretical Computer Science, 58:249–261, 1988.MATHMathSciNetCrossRefGoogle Scholar
  22. 22.
    F.W. Vaandrager. On the relationship between process algebra and input/output automata. In Proceedings 6 th Annual Symposium on Logic in Computer Science, pages 387–398. IEEE Computer Society Press, 1991.Google Scholar
  23. 23.
    Wang Yi. Real-time behaviour of asynchronous agents. In Proceedings CONCUR 90, LNCS 458, pages 502–520. Springer-Verlag, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Frits Vaandrager
    • 1
  • Nancy Lynch
    • 2
  1. 1.Department of Software TechnologyCWIAB AmsterdamThe Netherlands
  2. 2.MIT Laboratory for Computer ScienceCambridgeUSA

Personalised recommendations