Loading...

A protocol for constraint automata execution in a synchronous network of processors

Farhadi, A ; Sharif University of Technology | 2018

860 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-030-00359-3_6
  3. Publisher: Springer Verlag , 2018
  4. Abstract:
  5. In service oriented computing we encounter the problem of coordinating autonomous services (e.g., micro-services) communicate within the deployment environments (e.g., multi-cloud infrastructures) but participate for the functional requirements. While the environments have the deployment concerns like real-time, security, privacy or even energy consumption constraints, for the sake of brevity, the formal models of coordination in service oriented systems generally abstract away these concerns and focus on the functional ones such as synchronization, data and context dependency constraints. In this paper, we consider Constraint Automata (CA) as a formal model of the functional behaviours for the Reo coordination networks without any buffered channel. We devise a distributed protocol to model execution the CA subject to the deployment constraints on the messaging within a network of processors derived from the Reo network structure. We assume the constraints are satisfied while the protocol messages go through the shortest paths in the network. The protocol itself is modelled by another formal model Network of Timed Automata (NTA) with the untimed transitions implemented by the Uppaal tool. Our protocol models the message passing along the shortest paths for performing a CA’s transition by all the participant processors. The protocol guarantees all the processors do the same CA’s transition as a consensus in the same round of execution. © Springer Nature Switzerland AG 2018
  6. Keywords:
  7. Constraint Automata ; Deployment constraints ; Reo coordination language ; UPPAAL tool ; Automata theory ; Energy utilization ; Graph theory ; Large scale systems ; Message passing ; Real time systems ; Coordination language ; Coordination networks ; Energy consumption constraints ; Functional requirement ; Service oriented computing ; Service Oriented Systems ; Internet protocols
  8. Source: 12th International Conference on Verification and Evaluation of Computer and Communication Systems, VECoS 2018, 26 September 2018 through 28 September 2018 ; Volume 11181 LNCS , 2018 , Pages 80-94 ; 03029743 (ISSN); 9783030003586 (ISBN)
  9. URL: https://www.springerprofessional.de/en/a-protocol-for-constraint-automata-execution-in-a-synchronous-ne/16133448