Sharif Digital Repository

The prevalence of complex Cyber-Physical Systems (CPS) as an increasingly ubiquitous technology, necessitates the incorporation of component based and compositional design methods for the development and deployment of such systems. In this paper, we introduce a hybrid coordination framework to specify CPSs with components and use the resulting models to simulate, validate and verify those systems, using UPPAAL statistical model checker (SMC). We use SMC because with a level of uncertainty and unpredictability (e.g., the physical environment with which a CPS interacts), simulation-based verification approaches, where properties are guaranteed with a degree of confidence, produce more... 

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... 

Assessment of architectural evolution is a challenge and plays a significant role in system evolution management. Although the evolution rules of the software architecture are defined by some expert engineers or architects, there is no guarantee that applying them will end to the desired change. So, having a reliable assessment technique promotes the overall accuracy and quality of the evolution process. Compliance checking with expert-defined rules is a well-known assessment approach that can be applied in architectural evolution. In this paper, an approach is proposed for compliance checking of evolution processes. To this end, evolution paths and processes are modeled by Reo coordination... 

Constraint automata are the first-proposed operational semantics of Reo coordination language. They can be composed not only by all well-defined composition operators of labeled transition systems but also by two new operators. The new operators are joining of constraint automata with respect to their common port names and hiding a port name in all transition labels. The operations of these two extra operators depend on the internal structures of the transition labels, while in the others each transition label is considered as a simple entity. An equivalence relation between transition systems is a congruence relation if the replacement of the components of a model by the equivalent ones... 

Reo is a coordination language for modeling component connectors of component-based computing systems. We show that the failure-based equivalences NDFD and CFFD are congruences with respect to composition operators of Reo. Copyright 2007 ACM  

Reo is an exogenous coordination language for synthesizing components participating in a component-based system. The notion of Bchi automaton over streams of records (BAR for short) is a proposed operational semantics for Reo that covers several aspects of coordination strategies such as synchronization, context dependencies and fairness constraints. In this paper and for the purpose of modeling real-time coordination systems specified by Reo, we present a timed version of BARs as the acceptors of timed streams of records. We show that timed BAR and its streams of records based semantics are more standard and also more expressive than timed constraint automaton which is the first proposed... 

Reo is an exogenous coordination language for component connectors extending data flow networks with synchronization and context-dependent behavior. We propose an operational model of Reo based on Büchi automata in which port synchronization is modeled by records labeling the transitions, whereas context dependencies are stored in the states. We provide a composition operator which models the joining of two connectors, and show that it can be obtained by using two standard operators: alphabet extension and automata product. Our semantics has the advantage over previous models in that it is based on standard automata theory, so that existing theories and tools can be easily reused. Moreover,... 

Reo is an exogenous coordination language for synchronizing components participating in a component-based system. In this paper we provide a verification framework for model checking of Reo connectors. The proposed framework applies an extension of Büchi automata as the operational semantic model for Reo connectors and a record-based extension of linear time temporal logic (LTL) for expressing properties. Several aspects of Reo connectors, specially synchronization, context dependencies and fairness constraints, are addressed by this model checker due to its supported underlying model. The main ideas behind this implementation are to introduce a symbolic representation for the main elements... 

Reo is an exogenous coordination language for compositional construction of the coordinating subsystem of a component-based software. Constraint automaton is defined as the operational semantics of Reo. The main goal of this work is to prepare a model checking based verification environment for component-based systems, which their component connectors are modeled by Reo networks and Constraint Automata. We use compositional minimization and abstraction methods of model checking for verification of component-based systems and their component connectors modeled by Reo