Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-14T09:54:17.879Z Has data issue: false hasContentIssue false
  • English
  • Français

Dynamic networks of heterogeneous timed machines

Published online by Cambridge University Press:  24 May 2017

JOSÉ FIADEIRO,
ANTÓNIA LOPES,
BENOÎT DELAHAYE and
AXEL LEGAY
JOSÉ FIADEIRO
Affiliation:
Department of Computer Science, Royal Holloway University of London, London, UK Email: jose.fiadeiro@rhul.ac.uk
ANTÓNIA LOPES
Affiliation:
Departamento de Informática, Faculdade de Ciências, Universidade de Lisboa, Lisbon, Portugal Email: malopes@ciencias.ulisboa.pt
BENOÎT DELAHAYE
Affiliation:
Université de Nantes/LINA, Nantes, France Email: benoit.delahaye@univ-nantes.fr
AXEL LEGAY
Affiliation:
INRIA/IRISA, Rennes, France Email: axel.legay@irisa.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We present an algebra of discrete timed input/output automata that may execute in the context of different clock granularities – which we call timed machines; this algebra includes a refinement operator through which a machine can be extended with new states and transitions in order to accommodate a finer clock granularity as required to interoperate with other machines, and an extension of the traditional product of timed input–output automata to the situation in which the granularities of the two machines are not the same. Over this algebra, we then define an algebra of networks of timed machines that includes operations through which networks can be modified at run time, thus offering a model for systems of interconnected components that can dynamically bind to other systems and, therefore, cannot be adjusted at design time to ensure that they operate in a timed homogeneous setting. We investigate important properties of timed machines such as consistency – in the sense that a machine can be ensured to generate a non-empty language, and feasibility – in the sense that a machine can be ensured to generate a non-empty language no matter what inputs it receives, and propose techniques for checking if timed machines are consistent or are feasible. We generalise those properties to networks of timed machines, and investigate how consistency and feasibility of networks can be proved through properties that can be checked at design time without having to compute, at run time, the product of the machines that operate on those networks, which would not be practical.

Information

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 28 , Issue 6 , June 2018, pp. 800 - 855
Copyright
Copyright © Cambridge University Press 2017 

References

Abadi, M. and Lamport, L. (1991). The existence of refinement mappings. Theoretical Computer Science 82 (2) 253–284.Google Scholar
Alur, R. and Henzinger, T.A. (1999). Reactive modules. Formal Methods in System Design 15 (1) 7–48.Google Scholar
Attie, P.C. and Lynch, N.A. (2001). Dynamic input/output automata: A formal model for dynamic systems. In: Proceedings of the CONCUR 2001 – Concurrency Theory, 12th International Conference, Aalborg, Denmark, 137–151.Google Scholar
Attie, P.C. and Lynch, N.A. (2016). Dynamic input/output automata: A formal and compositional model for dynamic systems. Information and Computation 249 28–75.CrossRefGoogle Scholar
Basu, A., Bensalem, S., Bozga, M., Combaz, J., Jaber, M., Nguyen, T.-H. and Sifakis, J. (2011). Rigorous component-based system design using the BIP framework. IEEE Software 28 (3) 41–48.Google Scholar
Benveniste, A., Caillaud, B., Carloni, L.P. and Sangiovanni-Vincentelli, A.L. (2005). Tag machines. In: EMSOFT, ACM, 255–263.Google Scholar
Bliudze, S. and Krob, D. (2009). Modelling of complex systems: Systems as dataflow machines. Fundamenta Informaticae 91 (2) 251–274.Google Scholar
Bozga, M., Jaber, M., Maris, N. and Sifakis, J. (2012). Modeling dynamic architectures using dy-BIP. In: Proceedings of the 11th International Conference on Software Composition, SC'12, Berlin, Heidelberg: Springer-Verlag, 1–16.Google Scholar
Broy, M. and Stølen, K. (2001). Specification and Development of Interactive Systems: Focus on Streams, Interfaces, and Refinement. Springer-Verlag, New York, Inc., Secaucus, NJ, USA.Google Scholar
Buck, J.T., Ha, S., Lee, E.A. and Messerschmitt, D.G. (1994). Ptolemy: A framework for simulating and prototyping heterogenous systems. International Journal in Computer Simulation 4 (2) 155–182.Google Scholar
Burns, A. and Hayes, I.J. (2010). A timeband framework for modelling real-time systems. Real-Time System 45 (1–2) 106–142.Google Scholar
Chauchat, P. (2015). Asynchronous relational networks. Rapport de M2, Université Paris 7 – Denis-Diderot.Google Scholar
Chen, Y., Chen, Y. and Madelaine, E. (2015). Timed-pNets: A communication behavioural semantic model for distributed systems. Frontiers of Computer Science 9 (1) 87–110.Google Scholar
David, A., Larsen, K.G., Legay, A., Nyman, U. and Wasowski, A. (2010). Timed I/O automata: A complete specification theory for real-time systems. In: HSCC, ACM, pp. 91–100.Google Scholar
Delahaye, B., Fiadeiro, J.L., Legay, A. and Lopes, A. (2013). A timed component algebra for services. In: Beyer, D. and Boreale, M. (eds.) FORTE, Lecture Notes in Computer Science, vol. 7892, Springer, pp. 242–257.Google Scholar
Delahaye, B., Fiadeiro, J.L., Legay, A. and Lopes, A. (2014). Heterogeneous timed machines. In: Gabriel, C. and Dominique, M. (eds.) ICTAC, Lecture Notes in Computer Science, vol. 8687, Springer, pp. 115–132.Google Scholar
Fiadeiro, J.L. and Lopes, A. (2010). A model for dynamic reconfiguration in service-oriented architectures. In: Babar, M.A. and Gorton, I. (eds.) ECSA, Lecture Notes in Computer Science, vol. 6285, Springer, pp. 70–85.Google Scholar
Fiadeiro, J.L. and Lopes, A. (2013). An interface theory for service-oriented design. Theoretical Computer Science 503 1–30.Google Scholar
Fiadeiro, J.L. and Lopes, A. (2017). Heterogeneous and asynchronous networks of timed systems. Theoretical Computer Science 663 1–33.Google Scholar
Fiadeiro, J.L., Lopes, A. and Bocchi, L. (2011). An abstract model of service discovery and binding. Formal Aspects of Computing 23 (4) 433–463.Google Scholar
Fisher, J., Henzinger, T.A., Nickovic, D., Piterman, N., Singh, A.V. and Vardi, M.Y. (2011). Dynamic reactive modules. In: Katoen, J. and König, B. (eds.) CONCUR 2011, Lecture Notes in Computer Science, vol. 6901, Springer, pp. 404–418.Google Scholar
Forget, J., Boniol, F., Lesens, D. and Pagetti, C. (2008). A multi-periodic synchronous data-flow language. In: HASE, IEEE Computer Society, pp. 251–260.Google Scholar
Golden, B., Aiguier, M. and Krob, D. (2012). Modeling of complex systems II: A minimalist and unified semantics for heterogeneous integrated systems. Applied Mathematics and Computation 218 (16) 8039–8055.Google Scholar
Gößler, G. and Sangiovanni-Vincentelli, A.L. (2002). Compositional modeling in metropolis. In: EMSOFT, Lecture Notes in Computer Science, vol. 2491, Springer, pp. 93–107.Google Scholar
Grötker, T. (2002). System Design with SystemC, Springer.Google Scholar
Henzinger, T.A., Manna, Z. and Pnueli, A. (1991). Timed transition systems. In: de Bakker, J.W., Huizing, C., de Roever, W.P. and Rozenberg, G. (eds.) REX Workshop, Lecture Notes in Computer Science, vol. 600, Springer, pp. 226–251.Google Scholar
Kaynar, D.K., Lynch, N., Segala, R. and Vaandrager, F. (2006). The Theory of Timed I/O Automata, Morgan & Claypool Publishers.Google Scholar
Le, T., Passerone, R., Fahrenberg, U. and Legay, A. (2013). A tag contract framework for heterogeneous systems. In: Canal, C. and Villari, M. (eds.) ESOCC Workshops, CCIS, vol. 393, Springer, pp. 204–217.Google Scholar
Lee, E.A. and Zheng, H. (2007). Leveraging synchronous language principles for heterogeneous modeling and design of embedded systems. In: EMSOFT, ACM, pp. 114–123.Google Scholar
Papazoglou, M.P., Traverso, P., Dustdar, S. and Leymann, F. (2007). Service-oriented computing: State of the art and research challenges. IEEE Computer 40 (11) 38–45.Google Scholar
Sander, I. and Jantsch, A. (2004). System modeling and transformational design refinement in ForSyDe [formal system design]. IEEE Transaction on CAD of Integrated Circuits and Systems 23 (1) 17–32.CrossRefGoogle Scholar