Skip to main content
    • Aa
    • Aa

Dynamic networks of heterogeneous timed machines


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.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

A. Basu , S. Bensalem , M. Bozga , J. Combaz , M. Jaber , T.-H. Nguyen and J. Sifakis (2011). Rigorous component-based system design using the BIP framework. IEEE Software 28 (3) 4148.

M. Broy and K. Stølen (2001). Specification and Development of Interactive Systems: Focus on Streams, Interfaces, and Refinement. Springer-Verlag, New York, Inc., Secaucus, NJ, USA.

J.L. Fiadeiro , A. Lopes and L. Bocchi (2011). An abstract model of service discovery and binding. Formal Aspects of Computing 23 (4) 433463.

B. Golden , M. Aiguier and D. Krob (2012). Modeling of complex systems II: A minimalist and unified semantics for heterogeneous integrated systems. Applied Mathematics and Computation 218 (16) 80398055.

I. Sander and A. Jantsch (2004). System modeling and transformational design refinement in ForSyDe [formal system design]. IEEE Transaction on CAD of Integrated Circuits and Systems 23 (1) 1732.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 9 *
Loading metrics...

Abstract views

Total abstract views: 86 *
Loading metrics...

* Views captured on Cambridge Core between 24th May 2017 - 23rd September 2017. This data will be updated every 24 hours.