Advertisement

Automatic synthesis of real time systems

  • JØrgen H. Andersen
  • Kåre J. Kristoffersen
  • Kim G. Larsen
  • Jesper Niedermann
Foundations of Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 944)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ACD90]
    R. Alur, C. Courcoubetis, and D. Dill. Model-checking for Real-Time Systems. In Proceedings of Logic in Computer Science, pages 414–425. IEEE Computer Society Press, 1990.Google Scholar
  2. [AD94]
    R. Alur and D. Dill. Automata for Modelling Real-Time Systems. Theoretical Computer Science, 126(2): 183–236, April 1994.Google Scholar
  3. [AH89]
    R. Alur and T. A. Henzinger. A Really Temporal Logic. In Proceeding of IEEE Symp. on Foundations of Computer Science, Foundations of Computer Science, 1989.Google Scholar
  4. [Cer92]
    Karlis Cerans. Decidability of bisimulation equivalences for parallel timer processes. In Proceedings of CAV'92, volume 663 of Lecture Notes in Computer Science, Springer Verlag, Berlin, 1992. Springer Verlag.Google Scholar
  5. [CGL93]
    K. Cerans, J. C. Godskesen, and K. G. Larsen. Timed modal specifications — theory and tools. In Proceedings of 5th International Conference on Computer Aided Verification, volume 697 of Lecture Notes in Computer Science, 1993.Google Scholar
  6. [God94]
    J. C. Godskesen. Timed Modal Specifications — A theory for verification of real-time concurrent systems. PhD thesis, Aalborg University, 1994.Google Scholar
  7. [HC68]
    G. E. Hughes and M. J. Cresswell. An Introduction to Modal Logic. Methuen and Co., 1968.Google Scholar
  8. [HL89]
    H. Hüttel and K. G. Larsen. The Use of Static Constructs in a Modal Process Logic. In Logic at Botik'89., volume 363 of Lecture Notes in Computer Science, 1989.Google Scholar
  9. [HLY92]
    U. Holmer, K.G. Larsen, and W. Yi. Decidability of bisimulation equivalence between regular timed processes. In Proceedings of CAV'91, volume 575 of Lecture Notes in Computer Science, Springer Verlag, Berlin, 1992.Google Scholar
  10. [HM85]
    M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery, pages 137–161, 1985.Google Scholar
  11. [HNSY92]
    T. A. Henzinger, Z. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. In Logic in Computer Science, 1992.Google Scholar
  12. [JLJL93]
    O.H. Jensen, J.T. Lang, C. Jeppesen, and K.G. Larsen. Model construction for implicit specifications in modal logic. In Proceedings of 4th International Conference on Concurrency Theory, volume 715 of Lecture Notes in Computer Science, 1993.Google Scholar
  13. [LQ90]
    P. Lewis and H. Qin. Factorization of finite state machines under observational equivalence. Lecture Notes in Computer Science, Springer Verlag, 458, 1990.Google Scholar
  14. [LS92]
    K.G. Larsen and A. Skou. Compositional verification of probabilistic processes. In Proceedings of CONCUR'92. To appear in Lecture Notes in Computer Science., 1992.Google Scholar
  15. [LX90a]
    K. G. Larsen and L. Xinxin. Equation Solving Using Modal Transition systems. In Proceedings of Logic in Computer Science, 1990.Google Scholar
  16. [LX90b]
    K.G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. In proceedings of ICALP'90, volume 443 of Lecture Notes in Computer Science, 1990.Google Scholar
  17. [LX91]
    K.G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. Journal of Logic and Computation, 1(6):761–795, 1991.Google Scholar
  18. [LY93]
    K. G. Larsen and W. Yi. Time Abstracted Bisimulation: Implicit Specifications and Decidability. In Proceedings of MFPS, 1993.Google Scholar
  19. [NRJV90]
    X. Nicollin, J. L. Richierand, J.Sifakis, and J. Voiron. ATP: an algebra for timed processes,. In Proceedings of the IFIP TC 2 Working Conference on Programming Concepts and Methods, IFIP, 1990.Google Scholar
  20. [NSY91]
    X. Nicollin, J. Sifakis, and S. Yovine. From ATP to Timed Graphs and Hybrid Systems. volume 600 of Lecture Notes in Computer Science, 1991. In Real-Time: Theory in Practice.Google Scholar
  21. [Par89]
    J. Parrow. Submodule construction as equation solving in CCS. Theoretical Computer Science, 68, 1989.Google Scholar
  22. [Shi86]
    M.W. Shields. A note on the simple interface equation. Technical Report SE/079/1, University of Kent at Canterbury, Electronic Engineering Laboratories University, June 1986.Google Scholar
  23. [Yi90]
    W. Yi. Real-Time Behaviour of Asynchronous Agents. In Theories of Concurrency: Unification and Extension, volume 458 of Lecture Notes in Computer Science, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • JØrgen H. Andersen
    • 1
  • Kåre J. Kristoffersen
    • 1
  • Kim G. Larsen
    • 1
  • Jesper Niedermann
    • 1
  1. 1.Basic Research in Computer Science, Centre of the Danish National Research Foundation Department of Math. & Comp. Sc.Aalborg UniversityDenmark

Personalised recommendations