A Timed Component Algebra for Services

Delahaye, Benoît;Fiadeiro, José;Legay, Axel;Lopes, Antónia
(2013) 15th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOOODS) / 33th International Conference on Formal Techniques for Networked and Distributed Systems (FORTE) (3.June.2013)

Files

No attached file found for this publication.

Details

Authors
  • Delahaye, Benoît
    Author
  • Fiadeiro, José
    Author
  • Legay, AxelUCLouvain
    Author
  • Lopes, Antónia
    Author
Abstract
We present a component algebra for services that can guarantee time-related properties. The components of this algebra are networks of processes that execute according to time constraints and communicate asynchronously through channels that can delay messages. We characterise a sub-class of consistent networks give sufficient conditions for that class to be closed under composition. Finally, we show how those conditions can be checked, at design time, over timed I/O automata as orchestrations of services, thus ensuring that, when binding a client with a supplier service at run time, the orchestrations of the two services can work together as interconnected without further checks.

Citations

  • APA
  • Chicago
  • FWB

Delahaye, B., Fiadeiro, J., Legay, A., & Lopes, A. (2013). A Timed Component Algebra for Services. Formal Techniques for Distributed Systems Lecture Notes in Computer Science. 15th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOOODS) / 33th International Conference on Formal Techniques for Networked and Distributed Systems (FORTE). https://doi.org/10.1007/978-3-642-38592-6_17