Skip to main content

Approximation, Sampling and Voting in Hybrid Computing Systems

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

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3927))

Included in the following conference series:

Abstract

This paper addresses the question of extending the usual approximation and sampling theory of continuous signals and systems to those encompassing discontinuities, such as found in modern distributed control systems. We provide a topological framework dealing with continuous, discrete and mixed systems in a uniform manner. We show how this theoretical framework can be used for voting on hybrid signals in critical real-time systems.

This work has been supported by the European Network of Excellence Artist and by the Airbus-Verimag CIFRE grant 2003-2006.

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

Access this chapter

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. Chutinan, A., Krogh, B.H.: Computing approximating automata for a class of hybrid systems. Mathematical and Computer Modeling of Dynamical Systems 6, 30–50 (2000); Special Issue on Discrete Event Models of Continuous Systems

    Article  MATH  Google Scholar 

  2. Avizienis, A.: The methodology of n-version programming. In: Lyu, M.R. (ed.) Software Fault Tolerance, pp. 23–46. John Wiley, Chichester (1995)

    Google Scholar 

  3. Billingsley, P.: Convergence of probability measures. John Wiley & Sons, Chichester (1999)

    Book  MATH  Google Scholar 

  4. Branicky, M.S.: Topology of hybrid systems. In: 32nd Conference on Decision and Control, pp. 2309–2311. IEEE, Los Alamitos (1993)

    Google Scholar 

  5. Caspi, P., Benveniste, A.: Toward an approximation theory for computerised control. In: Sangiovanni-Vincentelli, A.L., Sifakis, J. (eds.) EMSOFT 2002. LNCS, vol. 2491, Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Caspi, P., Mazuet, C., Salem, R., Weber, D.: Formal design of distributed control systems with Lustre. In: Felici, M., Kanoun, K., Pasquini, A. (eds.) SAFECOMP 1999. LNCS, vol. 1698, Springer, Heidelberg (1999)

    Google Scholar 

  7. Caspi, P., Salem, R.: Threshold and bounded-delay voting in critical control systems. In: Joseph, M. (ed.) FTRTFT 2000. LNCS, vol. 1926, pp. 68–81. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Asarin, E., Maler, O., Pnueli, A.: On discretization of delays in timed automata and digital circuits. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 470–484. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Gupta, V., Henzinger, T.A., Jagadeesan, R.: Robust timed automata. In: Maler, O. (ed.) HART 1997. LNCS, vol. 1201, pp. 331–345. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  10. Ouaknine, J.: Digitisation and full abstraction for dense-time model checking. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol. 2280, pp. 37–51. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Kopetz, H.: Real-Time Systems Design Principles for Distributed Embedded Applications. Kluwer, Dordrecht (1997)

    MATH  Google Scholar 

  12. Kossentini, C., Caspi., P.: Mixed delay and threshold voters in critical real-time systems. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol. 3253, Springer, Heidelberg (2004)

    Google Scholar 

  13. Kossentini, C., Caspi, P.: Approximation, sampling and voting in hybrid computing systems. Research Report TR-2005-19, Verimag (December 2005), Available at: http://www-verimag.imag.fr/TR/TR-2005-17.pdf

  14. Broucke, M.: Regularity of solutions and homotopic equivalence for hybrid systems. In: Proceedings of the 37th IEEE Conference on Decision and Control, vol. 4, pp. 4283–4288 (1998)

    Google Scholar 

  15. Alur, R., Henzinger, T.A., Lafferriere, G., Pappas, G.J.: Discrete abstractions of hybrid systems. Proceedings of the IEEE 88, 971–984 (2000)

    Article  Google Scholar 

  16. Wensley, J.H., Lamport, L., Goldberg, J., Green, M.W., Lewitt, K.N., Melliar-Smith, P.M., Shostak, R.E.: SIFT: Design and analysis of a fault-tolerant computer for aircraft control. Proceedings of the IEEE 66(10), 1240–1255 (1978)

    Article  Google Scholar 

  17. Kohn, W., Nerode, A.: Models for hybrid systems: automata, topologies, controllability and observability. In: Dal Cin, M., Bode, A. (eds.) Parallel Computer Architectures. LNCS, vol. 732, Springer, Heidelberg (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kossentini, C., Caspi, P. (2006). Approximation, Sampling and Voting in Hybrid Computing Systems. In: Hespanha, J.P., Tiwari, A. (eds) Hybrid Systems: Computation and Control. HSCC 2006. Lecture Notes in Computer Science, vol 3927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11730637_28

Download citation

  • DOI: https://doi.org/10.1007/11730637_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33170-4

  • Online ISBN: 978-3-540-33171-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics