Skip to main content

Research in One Area Benefits Another

  • Chapter
  • First Online:
Real Time and Such

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

  • 49 Accesses

Abstract

Wang Yi at Uppsala University in Sweden is well-known for his contributions to formal methods (FMs), creating the most widely used model checker for timed automata. I imagine most participants at ISoLA 2024 view him from that perspective. However, with this note, I want to highlight another perspective: his contributions to real-time scheduling (RTS) theory, how his research in FMs benefits RTS theory, and how he serves as a bridge between FMs and RTS theory. The aim of this note is neither to cover all of Wang Yi’s scientific contributions (which are numerous) nor to present his most famous (or most highly cited) works nor to present the works that he had done as a single author; instead, the aim is to present the bridge between FM and RTS theory.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Norström, C., Wall A., Yi W.: Timed automata as task models for event-driven systems. In: 6th International Workshop on Real-Time Computing and Applications Symposium. IEEE, Hong Kong, China, pp. 182–189 (1999)

    Google Scholar 

  2. Stigge, M., Ekberg P., Guan N., Yi W.: The digraph real-time task model. In: 17th IEEE Real-Time and Embedded Technology and Applications Symposium. IEEE, Chicago, pp. 71–80 (2011)

    Google Scholar 

  3. Fersman, E., Krcál, P., Pettersson, P., Yi, W.: Task automata: schedulability, decidability and undecidability. Inf. Comput. 205(8), 1149–1172 (2007)

    Article  MathSciNet  Google Scholar 

  4. Guan, N., Ekberg, P., Stigge, M., Yi, W.: Resource sharing protocols for real-time task graph systems. In: 23rd Euromicro Conference on Real-Time Systems, IEEE, Porto, Portugal, pp. 272–281 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bjorn Andersson .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Andersson, B. (2025). Research in One Area Benefits Another. In: Graf, S., Pettersson, P., Steffen, B. (eds) Real Time and Such. Lecture Notes in Computer Science, vol 15230. Springer, Cham. https://doi.org/10.1007/978-3-031-73751-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-73751-0_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-73750-3

  • Online ISBN: 978-3-031-73751-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics