Skip to main content
SpringerLink
Log in

Non-deterministic Temporal Logics for General Flow Systems

  • Conference paper
Hybrid Systems: Computation and Control (HSCC 2004)

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

Included in the following conference series:

Abstract

In this paper, we use the constructs of branching temporal logic to formalize reasoning about a class of general flow systems, including discrete-time transition systems, continuous-time differential inclusions, and hybrid-time systems such as hybrid automata. We introduce Full General Flow Logic, GFL  ⋆ , which has essentially the same syntax as the well-known Full Computation Tree Logic, CTL  ⋆ , but generalizes the semantics to general flow systems over arbitrary time-lines. We propose an axiomatic proof system for GFL  ⋆  and establish its soundness w.r.t. the general flow semantics.

Research support from Australian Research Council, Grants DP0208553 & LX0242359, and CNRS France, Embassy of France in Australia, & Aust. Academy of Science, Grant DEMRIX236. The work has benefited from discussions with participants of the Logic Seminar at the University of Melbourne, particularly B. Humberstone, L. Humberstone and G. Restall.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Henzinger, T.A., Ho, P.-H.: Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering 22, 181–201 (1996)

    Article  Google Scholar 

  2. Alur, R., Henzinger, T.A., Lafferriere, G., Pappas, G.: Discrete abstractions of hybrid systems. Proceedings of the IEEE 88 (July 2000)

    Google Scholar 

  3. Aubin, J.-P.: Viability kernels and capture basins of sets under differential inclusions. Siam Journal of Control 40, 853–881 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Aubin, J.-P.: Viability kernels and capture basins: Lecture notes. Technical report, Universidad Politecnica de Cartagena, Spain (April-May 2002)

    Google Scholar 

  5. Aubin, J.-P., Dordan, O.: Dynamical qualitative analysis of evolutionary systems. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol. 2289, pp. 62–75. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Aubin, J.-P., Frankowska, H.: Set-Valued Analysis. Birkhauser, Boston (1990)

    MATH  Google Scholar 

  7. Aubin, J.-P., Lygeros, J., Quincampoix, M., Sastry, S., Seube, N.: Impulse differential inclusions:A viability approach to hybrid systems. IEEE Transactions on Automatic Control 47, 2–20 (2002)

    Article  MathSciNet  Google Scholar 

  8. Burgess, J.P.: Axioms for tense logic I: “Since” and “Until”. Notre Dame Journal of Formal Logic 23, 367–374 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  9. Coulthard, V.: Temporal Logics of Dynamical Systems in Discrete and Dense Time. PhD thesis, RSISE, The Australian National University (2004) (in preparation)

    Google Scholar 

  10. Emerson, E.A., Halpern, J.Y.: “Sometimes” and “Not Never” revisited: on branching versus linear time. Journal of the Association of Computing Machinery 33, 151–178 (1986)

    MATH  MathSciNet  Google Scholar 

  11. Emerson, E.A., Jutla, C.: Complexity of tree automata and modal logics of programs. In: Proc. 29th IEEE Foundations of Computer Science (FOCS 1988), IEEE, Los Alamitos (1988)

    Google Scholar 

  12. Emerson, E.A., Sistla, A.: Deciding Full Branching Time Logic. Information and Control 61, 175–201 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gabbay, D.M., Hodkinson, I., Reynolds, M.: Temporal Logic: Mathematical Foundations and Computational Aspects, vol. 1. Clarendon Press, Oxford (1994)

    MATH  Google Scholar 

  14. Henzinger, T.A.: The theory of hybrid automata. In: Proc. of 11th Annual IEEE Symposium on Logic in Computer Science, pp. 278–292 (1996)

    Google Scholar 

  15. Lygeros, J., Henrik, K.H., Simić, S.N., Sastry, S.S.: Dynamical properties of hybrid automata. IEEE Transactions on Automatic Control 48, 2–17 (2003)

    Article  Google Scholar 

  16. Reynolds, M.: An Axiomatization of Full Computation Tree Logic. J. Symbolic Logic 66, 1011–1057 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  17. Stirling, C.: Modal and temporal logics. In: Handbook of Logic in Computer Science, vol. 2, pp. 477–563. Oxford University Press, Oxford (1992)

    Google Scholar 

  18. Willems, J.C.: Paradigms and puzzles in the theory of dynamical systems. IEEE Transactions on Automatic Control 36, 259–294 (1991)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical & Electronic Engineering, The University of Melbourne, VIC 3010, AUSTRALIA

    Jennifer M. Davoren & Vangham Coulthard

  2. Computer Sciences Laboratory, RSISE, The Australian National University, Canberra, ACT 0200, AUSTRALIA

    Vangham Coulthard

  3. Département d’Informatique, Université Libre de Bruxelles, 1050, BELGIUM

    Nicolas Markey

  4. Lehrstuhl für Regelungstechnik, Friedrich-Alexander-Universität, Erlangen, D-91058, GERMANY

    Thomas Moor

Authors
  1. Jennifer M. Davoren
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vangham Coulthard
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicolas Markey
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Thomas Moor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Pennsylvania,  

    Rajeev Alur

  2. School of Engineering and Applied Science, University of Pennsylvania,  

    George J. Pappas

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Davoren, J.M., Coulthard, V., Markey, N., Moor, T. (2004). Non-deterministic Temporal Logics for General Flow Systems. In: Alur, R., Pappas, G.J. (eds) Hybrid Systems: Computation and Control. HSCC 2004. Lecture Notes in Computer Science, vol 2993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24743-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24743-2_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21259-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation