Skip to main content
SpringerLink
Log in

Automatic synthesis of real time systems

  • Foundations of Programming
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1995)

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

Included in the following conference series:

This work has been partially supported by the European Communities under CON-CUR2, BRA 7166.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. R. Alur and D. Dill. Automata for Modelling Real-Time Systems. Theoretical Computer Science, 126(2): 183–236, April 1994.

    Google Scholar 

  3. 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. 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. 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. J. C. Godskesen. Timed Modal Specifications — A theory for verification of real-time concurrent systems. PhD thesis, Aalborg University, 1994.

    Google Scholar 

  7. G. E. Hughes and M. J. Cresswell. An Introduction to Modal Logic. Methuen and Co., 1968.

    Google Scholar 

  8. 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. 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. 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. 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. 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. 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. 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. K. G. Larsen and L. Xinxin. Equation Solving Using Modal Transition systems. In Proceedings of Logic in Computer Science, 1990.

    Google Scholar 

  16. 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. 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. K. G. Larsen and W. Yi. Time Abstracted Bisimulation: Implicit Specifications and Decidability. In Proceedings of MFPS, 1993.

    Google Scholar 

  19. 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. 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. J. Parrow. Submodule construction as equation solving in CCS. Theoretical Computer Science, 68, 1989.

    Google Scholar 

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

Download references

Author information

Authors and Affiliations

  1. Basic Research in Computer Science, Centre of the Danish National Research Foundation Department of Math. & Comp. Sc., Aalborg University, Denmark

    JØrgen H. Andersen, Kåre J. Kristoffersen, Kim G. Larsen & Jesper Niedermann

Authors
  1. JØrgen H. Andersen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kåre J. Kristoffersen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kim G. Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jesper Niedermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Fülöp Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andersen, J.H., Kristoffersen, K.J., Larsen, K.G., Niedermann, J. (1995). Automatic synthesis of real time systems. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_103

Download citation

  • DOI: https://doi.org/10.1007/3-540-60084-1_103

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60084-8

  • Online ISBN: 978-3-540-49425-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation