Verifying the Correctness of UML Statechart Outpatient Clinic Based on Common Modeling Language and SMV

Unified-modelling language (UML) is a standard general purpose modelling language, which is widely, used in system design of banking, biological, plantation and healthcare. Recently, there are many systems of healthcare are modeled using behavioral diagram such as UML statechart for design purposes. However, the behavior of healthcare statechart is rarely verified to ensure it is behaving as we needed. In software engineering, a software should be verified before it is transform to the further phases. In this paper, a statechart of outpatient clinic is verified to ensuring the correctness of its design. Therefore, to achieve our objective, we have applied Common Modeling Language (CML) and SMV model checker for verification formal system modeling and specification of property of statechart outpatient clinic. The result shows that the statechart of outpatient clinic is behave as required and the statechart is allowable to transform to the next phase

Trust Requirements in E-Health System: A Conceptual Framework

Resulting from the development of new technology, conventional scientific practices have migrated into computer-based infrastructures, called e-science. Specifically, escience applied in health discipline is called e-health. It is an organized system that deals to diagnose and treat patients. Considering trust is an important role and fundamental for the provision of effective healthcare service, this paper discusses trust requirement in e-health. To highlight the importance of trust in e-health system, a conceptual framework of trust requirements in e-health system is developed. Drawn from literature search framed by STARLITE, a conceptual framework that addresses trust resulting from relationships of various actors based on two perspectives: sociotechnical and technical perspectives are presented. This framework suggests that e-health system must build a trust relationship between actors and understand trust based on sociotechnical and technical perspectives. Further, security and privacy that protect the confidentiality of patient’s data, especially m-health (mobile health) also need trust in resource sharing. It can be concluded that trust requirements in e-health depend on how the media transmits a social experience, patient-system relationship, and collaboration of software engineering and healthcare professionals. The implementation of trust requirements has the potential to produce well-engineered software in a healthcare organization, resulting in the use of software for effective diagnosis and treatment of patients

A Theory of Interface Modeling of Component-Based Software

Abstract, rCOS Automata-based Model of Components, Trace-based Model of Components Coordination, Conclusion and Futur Wor

Graphs and Graph Transformations for Object-Oriented and Service-Oriented Systems

Theories of graphs and graph transformations form an important part of the mathematical foundations of computing, and have been applied in a wide range of areas from the design and analysis of algorithms to the formalization of various computer systems and programs. In this thesis, we study how graphs and graph transformations can be used to model the static structure and dynamic behavior of object-orientated and service-oriented systems. Our work is mainly motivated by the difficulty in understanding and reasoning about objectorientated and service-oriented programs, which have more sophisticated features compared with traditional procedural programs. We show that the use of graphs and graphs transformations provides both an intuitive visualization and a formal representation of object-orientated and serviceoriented programs with these features, improving people’s understanding of the execution states and behaviors of these programs. We provide a graph-based type system, operational semantics and refinement calculus for an object-oriented language. In this framework, we define class structures and execution states of oo programs as directed and labeled graphs, called class graphs and state graphs, respectively. The type system checks whether a program is well-typed based on its class graph, while the operational semantics defines each step of program execution as a simple graph transformations between state graphs. We show the operational semantics is type-safe in that the execution of a well-typed program does not “go wrong”. Based on the operational semantics, we study the notion of structure refinement of oo programs as graph transformations between their class graphs. We provide a few groups of refinement rules for various purposes such as class expansion and polymorphism elimination and prove their soundness and relative completeness. We also propose a graph-based representation of service-oriented systems specified in a serviceoriented process calculus. In this framework, we define states of service-oriented systems as hier- archical graphs that naturally capture the hierarchical nature of service structures. For this, we exploit a suitable graph algebra and set up a hierarchical graph model, in which graph transformations are studied following the well-known Double-Pushout approach. Based on this model, we provide a graph transformation system with a few sets of graph transformation rules for various purposes such as process copy and process reduction. We prove that the graph transformation system is sound and complete with respect to the reduction semantics of the calculus