Skip to main content
Log in

Connection models for the Internet-of-Things

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

The Internet-of-Things (IoT) is expected to swamp the world. In order to study and understand the emergent behaviour of connected things, effective support for their modelling is needed. At the heart of IoT are flexible and adaptive connection patterns between things, which can naturally be modelled by channel-based coordination primitives, and characteristics of connection failure probabilities, execution and waiting times, as well as resource consumption. The latter is especially important in light of severely limited power and computation budgets inside the things. In this paper, we tackle the IoT modelling challenge, based on a conservative extension of channel-based Reo circuits. We introduce a model called priced probabilistic timed constraint automaton, which combines models of probabilistic and timed aspects, and integrates pricing information. An expressive logic called priced probabilistic timed scheduled data stream logic is presented, so as to enable the specification and verification of properties, which characterize data-flow streams and prices. A small but illustrative IoT case demonstrates the principal benefits of the proposed approach.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Borgia E. The Internet of Things vision: key features, applications and open issues. Computer Communications, 2014, 54: 1–31

    Article  Google Scholar 

  2. Lanese I, Bedogni L, Felice M D. Internet of Things: a process calculus approach. In: Proceedings of Annual ACM Symposium on Applied Computing. 2013, 1339–1346

  3. Lanotte R, Merro M. A semantic theory of the internet of things. Information and Computation, 2018, 259(1): 72–101

    Article  MathSciNet  MATH  Google Scholar 

  4. Arbab F. Reo: a channel-based coordination model for component composition. Mathematical Structures in Computer Science, 2004, 14(3): 329–366

    Article  MathSciNet  MATH  Google Scholar 

  5. Meng S, Arbab F. On resource-sensitive timed component connectors. In: Proceedings of International Conference on Formal Methods for Open Object-Based Distributed Systems. 2007, 301–316

    Google Scholar 

  6. Arbab F, Chothia T, Meng S, Moon Y J. Component connectors with QoS guarantees. In: Proceedings of International Conference on Coordination Models and Languages. 2007, 286–304

  7. Baier C, Sirjani M, Arbab F, Rutten J. Modeling component connectors in Reo by constraint automata. Science of Computer Programming, 2006, 61(2): 75–113

    Article  MathSciNet  MATH  Google Scholar 

  8. Jongmans S S T Q, Arbab F. Overview of thirty semantic formalisms for Reo. Scientific Annals of Computer Science, 2012, 22(1): 201–251

    Article  MathSciNet  MATH  Google Scholar 

  9. Arbab F, Baier C, de Boer F, Rutten J. Models and temporal logical specifications for timed component connectors. Software and System Modeling, 2007, 6(1): 59–82

    Article  Google Scholar 

  10. Baier C. Probabilistic models for Reo connector circuits. Journal of Universal Computer Science, 2005, 11(10): 1718–1748

    Google Scholar 

  11. Aziz A, Singhal V, Balarin F. It usually works: the temporal logic of stochastic systems. In: Proceedings of International Conference on Computer Aided Verification. 1995, 155–165

  12. He K, Hermanns H, Chen Y. Models of connected things: on priced probabilistic timed Reo. In: Proceedings of IEEE Annual Computer Software and Applications Conference. 2017, 234–243

  13. Arbab F, Rutten J J M M. A coinductive calculus of component connectors. In: Proceedings of International Workshop on Recent Trends in Algebraic Development Techniques. 2002, 34–55

    Chapter  Google Scholar 

  14. Alur R, Dill D L. A theory of timed automata. Theoretical Computer Science, 1994, 126(2): 183–235

    Article  MathSciNet  MATH  Google Scholar 

  15. Henzinger T A, Nicollin X, Sifakis J, Yovine S. Symbolic model checking for real-time systems. Information and Computation, 1994, 111(2): 193–244

    Article  MathSciNet  MATH  Google Scholar 

  16. Segala R, Lynch N A. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 1995, 2(2): 250–273

    MathSciNet  MATH  Google Scholar 

  17. Turrini A, Hermanns H. Cost preserving bisimulations for probabilistic automata. Logical Methods in Computer Science, 2014, 10(4): 1–58

    Article  MathSciNet  MATH  Google Scholar 

  18. Segala R. Modelling and verification of randomized distributed real time systems. PhD Thesis, Cambridge: Massachusetts Institute of Technology, 1995

    Google Scholar 

  19. Glabbeek R V, Smolka S A, Steffen B, Tofts C M N. Reactive, generative, and stratified models of probabilistic processes. In: Proceedings of Annual Symposium on Logic in Computer Science. 1990, 130–141

  20. Glabbeek R V, Smolka S A, Steffen B. Reactive, generative and stratified models of probabilistic processes. Information and Computation, 1995, 121(1): 59–80

    Article  MathSciNet  MATH  Google Scholar 

  21. D’ Argenio P R, Hermanns H, Katoen J P. On generative parallel composition. Electronic Notes in Theoretical Computer Science, 1999, 22: 30–54

    Article  MathSciNet  Google Scholar 

  22. Baeten J C M, Bergstra J A, Smolka S A. Axiomatizing probabilistic processes: ACP with generative probabilities. Information and Computation, 1995, 121(2): 234–255

    Article  MathSciNet  MATH  Google Scholar 

  23. Kwiatkowska M Z, Norman G, Parker D, Sproston J. Performance analysis of probabilistic timed automata using digital clocks. Formal Methods in System Design, 2006, 29(1): 33–78

    Article  MATH  Google Scholar 

  24. Halmos P R. Measure Theory. Berlin: Springer-Verlag, 1950

    Book  MATH  Google Scholar 

  25. Clarke E M, Emerson E A. Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Proceedings of Workshop on Logics of Programs. 1981, 52–71

  26. Norman G, Parker D, Sproston J. Model checking for probabilistic timed automata. Formal Methods in System Design, 2013, 43(2): 164–190

    Article  MATH  Google Scholar 

  27. Baier C, Haverkort B R, Hermanns H, Katoen J P. Performance evaluation and model checking join forces. Communications of the ACM, 2010, 53(9): 76–85

    Article  Google Scholar 

  28. Bianco A, Alfaro L D. Model checking of probabilistic and nondeterministic systems. In: Proceedings of International Conference on Foundations of Software Technology and Theoretical Computer Science. 1995, 499–513

    Google Scholar 

  29. Asarin E, Caspi P, Maler O. Timed regular expressions. Journal of the ACM, 2002, 49(2): 172–206

    Article  MathSciNet  MATH  Google Scholar 

  30. Hansson H, Jonsson B. A logic for reasoning about time and reliability. Formal Aspects of Computing, 1994, 6(5): 512–535

    Article  MATH  Google Scholar 

  31. Bianco A, Alfaro L D. Model checking of probabalistic and nondeterministic systems. In: Proceedings of International Conference on Foundations of Software Technology and Theoretical Computer Science. 1995, 499–513

    Google Scholar 

  32. Li L, Jin Z, Li G, Zheng L, Wei Q. Modeling and analyzing the reliability and cost of service composition in the IoT: a probabilistic approach. In: Proceedings of International Conference on Web Services. 2012, 584–591

  33. Li G, Wei Q, Li X, Jin Z, Xu Y, Zheng L. Environment based modeling approach for services in the internet of things. Scientia Sinica, 2013, 43(10): 1198–1218

    Google Scholar 

  34. Martinez B, Montón M, Vilajosana I, Prades J D. The power of models: modeling power consumption for IoT devices. IEEE Sensors Journal, 2015, 15(10): 5777–5789

    Article  Google Scholar 

  35. Costa B, Pires P F, Delicato F C, Li W, Zomaya A Y. Design and analysis of iot applications: a model-driven approach. In: Proceedings of the 14th International Conference on Dependable, Autonomic and Secure Computing, the 14th International Conference on Pervasive Intelligence and Computing, the 2nd International Conference on Big Data Intelligence and Computing and Cyber Science and Technology Congress. 2016, 392–399

  36. Lee E A. Cyber physical systems: design challenges. In: Proceedings of IEEE International Symposium on Object-Oriented Real-Time Distributed Computing. 2008, 363–369

  37. Palomar E, Chen X, Liu Z, Maharjan S, Bowen J P. Component-based modelling for scalable smart city systems interoperability: a case study on integrating energy demand response systems. Sensors, 2016, 16(11): 1810

    Article  Google Scholar 

  38. Baier C, Wolf V. Stochastic reasoning aboutchannel-based component connectors. In: Proceedings of International Conference on Coordination Models and Languages. 2006, 1–15

  39. Moon Y J, Silva A, Krause C, Arbab F. A compositional semantics for stochastic Reo connectors. In: Proceedings of International Workshop on the Foundations of Coordination Languages and Software Architectures. 2010, 93–107

    Article  Google Scholar 

  40. Oliveira N, Silva A, Barbosa L A. IMCReo: interactive Markov chains for stochastic Reo. Journal of Internet Services and Information Security, 2015, 5(1): 3–28

    Google Scholar 

  41. Pnueli A. The temporal logic of programs. In: Proceedings of Annual Symposium on Foundations of Computer Science. 1977, 46–57

  42. Bohnenkamp H C, D’Argenio P R, Hermanns H, Katoen J P. Modest: a compositional modeling formalism for hard and softly timed systems. IEEE Transactions on Software Engineering, 2006, 32(10): 812–830

    Article  Google Scholar 

  43. Hahn E M, Hartmanns A, Hermanns H, Katoen J P. A compositional modelling and analysis framework for stochastic hybrid systems. Formal Methods in System Design, 2013, 43(2): 191–232

    Article  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Grant Nos. 61370100, 61321064 and 61773019), Shanghai Knowledge Service Platform for Trustworthy Internet of Things (ZF1213), Shanghai Municipal Science and Technology Commission Project (1451100400), and Defense Industrial Technology Development Program JCKY 2016212B004-2, by the ERC Advanced Grant 695614 (POWVER), and by the Sino-German Center for Research Project CAP (GZ 1023).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yixiang Chen.

Additional information

Kangli He is a PhD student in the School of Computer Science and Software Engineering in the East China Normal University, China. He received the BS degree from East China Normal University, China in 2009. His research interests include formal methods, Internet of Things and Bisimulation. Now his research topic concerns the formal modelling and verification of Internet of Things.

Holger Hermanns is a full professor at Saarland University, Saarbrücken, Germany, holding the chair of Dependable Systems and Software on Saarland Informatics Campus. He is an ERC Advanced Grantee and member of Academia Europaea. His research interests include perspicuous computing, modeling and verification of concurrent systems, resource-aware embedded systems, compositional performance and dependability evaluation, and their applications to energy informatics. Holger Hermanns has co-authored more than 200 peer-reviewed scientific papers (ha-index 92, h-index 50). He co-chaired the program committees of major international conferences such as CAV, CONCUR, TACAS, and QEST, and delivered keynotes at about a dozen international conferences and symposia. He serves on the steering committees of ETAPS and TACAS. He is president of the association “Friends of Dagstuhl”.

Hengyang Wu received the BS degree from Xuzhou Normal University, China in 1996, and the MS and PhD degrees from Shanghai Normal University, China in 2004 and 2007, respectively, all in mathematics. From 2008 to 2011, he was a postdoctoral researcher with East China Normal University, China, where he is currently an associate research fellow. From 2011 to July 2016, he was an associate professor of computer science with Hangzhou Dianzi University, China. His current research interests include formal methods and domain theory. He serves on the thechnical committees of Fuzzy Systems and Mathemantics and CCF Theoretical Computer Science.

Yixiang Chen is a full professor in the School of Computer Science and Software Engineering, East China Normal University, China. Where he is coordinating trustworthy software, Internet of Things and Human-Cyber-Physical System related research activities. Professor Chen is the director of the MoE Engineering Research Center for Software/Hardware Co-design Technology and Application. He is a vice-chairman of technical committee of Embedded System of China Computer Federation, Fuzzy Systems and Mathemantics, Chinese Association for Artificial Intelligence.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

He, K., Hermanns, H., Wu, H. et al. Connection models for the Internet-of-Things. Front. Comput. Sci. 14, 143401 (2020). https://doi.org/10.1007/s11704-018-7395-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-018-7395-3

Keywords

Navigation