Skip to main content

On Fixed Points of Strictly Causal Functions

  • Conference paper
Book cover Formal Modeling and Analysis of Timed Systems (FORMATS 2013)

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

Abstract

We ask whether strictly causal components form well defined systems when arranged in feedback configurations. The standard interpretation for such configurations induces a fixed-point constraint on the function modelling the component involved. We define strictly causal functions formally, and show that the corresponding fixed-point problem does not always have a well defined solution. We examine the relationship between these functions and the functions that are strictly contracting with respect to a generalized distance function on signals, and argue that these strictly contracting functions are actually the functions that one ought to be interested in. We prove a constructive fixed-point theorem for these functions, and introduce a corresponding induction principle.

This work was supported in part by the Center for Hybrid and Embedded Software Systems (CHESS) at UC Berkeley, which receives support from the National Science Foundation (NSF awards #0720882 (CSR-EHS: PRET), #0931843 (CPS: Large: ActionWebs), and #1035672 (CPS: Medium: Ptides)), the Naval Research Laboratory (NRL #N0013-12-1-G015), and the following companies: Bosch, National Instruments, and Toyota.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.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. Zeigler, B.P.: Theory of Modeling and Simulation. John Wiley & Sons (1976)

    Google Scholar 

  2. Matsikoudis, E., Lee, E.A.: The fixed-point theory of strictly causal functions. Technical Report UCB/EECS-2013-122, EECS Department, University of California, Berkeley (June 2013)

    Google Scholar 

  3. Naundorf, H.: Strictly causal functions have a unique fixed point. Theoretical Computer Science 238(1-2), 483–488 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Liu, X., Matsikoudis, E., Lee, E.A.: Modeling timed concurrent systems. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 1–15. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Priess-Crampe, S., Ribenboim, P.: Fixed points, combs and generalized power series. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 63(1), 227–244 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  6. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press (2002)

    Google Scholar 

  7. Lee, E.A., Sangiovanni-Vincentelli, A.: A framework for comparing models of computation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 17(12), 1217–1229 (1998)

    Article  Google Scholar 

  8. Lee, E.A.: Modeling concurrent real-time processes using discrete events. Annals of Software Engineering 7(1), 25–45 (1999)

    Article  Google Scholar 

  9. Liu, J., Lee, E.A.: On the causality of mixed-signal and hybrid models. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol. 2623, pp. 328–342. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Hitzler, P., Seda, A.K.: Generalized metrics and uniquely determined logic programs. Theoretical Computer Science 305(1-3), 187–219 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Yates, R.K., Gao, G.R.: A Kahn principle for networks of nonmonotonic real-time processes. In: Bode, A., Reeve, M., Wolf, G. (eds.) PARLE 1993. LNCS, vol. 694, pp. 209–227. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  12. Yates, R.K.: Networks of real-time processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 384–397. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  13. Broy, M.: Refinement of time. Theoretical Computer Science 253(1), 3–26 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lee, E.A., Varaiya, P.: Structure and Interpretation of Signals and Systems, 2nd edn. (2011), http://LeeVariaya.org

  15. Enderton, H.B.: Elements of Set Theory. Academic Press (1977)

    Google Scholar 

  16. Cousot, P., Cousot, R.: Constructive versions of Tarski’s fixed point theorems. Pacific J. of Math. 82(1), 43–57 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  17. Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. of Math. 5(2), 285–309 (1955)

    Article  MathSciNet  MATH  Google Scholar 

  18. Markowsky, G.: Chain-complete posets and directed sets with applications. Algebra Universalis 6(1), 53–68 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  19. Scott, D.S., de Bakker, J.W.: A theory of programs. Unpublished notes, Seminar on Programming, IBM Research Center, Vienna, Austria (1969)

    Google Scholar 

  20. Reed, G.M., Roscoe, A.W.: A timed model for communicating sequential processes. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 314–323. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  21. Rounds, W.C.: Applications of topology to semantics of communicating processes. In: Brookes, S., Roscoe, A.W., Winskel, G. (eds.) Seminar on Concurrency. LNCS, vol. 197, pp. 360–372. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  22. Roscoe, A.W.: Topology, computer science, and the mathematics of convergence. In: Reed, G.M., Roscoe, A.W., Wachter, R.F. (eds.) Topology and Category Theory in Computer Science, pp. 1–27. Oxford University Press, Inc., New York (1991)

    Google Scholar 

  23. Kozen, D., Ruozzi, N.: Applications of metric coinduction. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 327–341. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  24. Reed, G.M., Roscoe, A.W.: Metric spaces as models for real-time concurrency. In: Main, M.G., Mislove, M.W., Melton, A.C., Schmidt, D. (eds.) MFPS 1987. LNCS, vol. 298, pp. 331–343. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  25. Müller, O., Scholz, P.: Functional specification of real-time and hybrid systems. In: Maler, O. (ed.) HART 1997. LNCS, vol. 1201, pp. 273–285. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  26. Krötzsch, M.: Generalized ultrametric spaces in quantitative domain theory. Theoretical Computer Science 368(1-2), 30–49 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  27. Liu, X., Lee, E.A.: CPO semantics of timed interactive actor networks. Theoretical Computer Science 409(1), 110–125 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  28. Caspi, P., Benveniste, A., Lublinerman, R., Tripakis, S.: Actors without directors: A Kahnian view of heterogeneous systems. In: Majumdar, R., Tabuada, P. (eds.) HSCC 2009. LNCS, vol. 5469, pp. 46–60. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matsikoudis, E., Lee, E.A. (2013). On Fixed Points of Strictly Causal Functions. In: Braberman, V., Fribourg, L. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2013. Lecture Notes in Computer Science, vol 8053. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40229-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40229-6_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40228-9

  • Online ISBN: 978-3-642-40229-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics