Aspect Oriented Behavioral Synthesis

Modern modularization techniques such as Aspect Orientation require powerful and expressive enough specification languages in order to conceive the development of a system as the combination of the different views it is composed of. In this work we present FVS as an aspect oriented language where the composition of individual aspects is achieved employing behavioral synthesis. As a distinctive feature, our approach can handle properties denoted by non deterministic Büchi automata. A case of study is introduced to show our approach in action.XVI Workshop Ingeniería de Software.Red de Universidades con Carreras en Informátic

Aspect Oriented Behavioral Synthesis

Modern modularization techniques such as Aspect Orientation require powerful and expressive enough specification languages in order to conceive the development of a system as the combination of the different views it is composed of. In this work we present FVS as an aspect oriented language where the composition of individual aspects is achieved employing behavioral synthesis. As a distinctive feature, our approach can handle properties denoted by non deterministic Büchi automata. A case of study is introduced to show our approach in action.XVI Workshop Ingeniería de Software.Red de Universidades con Carreras en Informátic

Aspect Oriented Behavioral Synthesis

Modern modularization techniques such as Aspect Orientation require powerful and expressive enough specification languages in order to conceive the development of a system as the combination of the different views it is composed of. In this work we present FVS as an aspect oriented language where the composition of individual aspects is achieved employing behavioral synthesis. As a distinctive feature, our approach can handle properties denoted by non deterministic Büchi automata. A case of study is introduced to show our approach in action.XVI Workshop Ingeniería de Software.Red de Universidades con Carreras en Informátic

LOTOSphere:software development with LOTOS

LOTOS (Language Of Temporal Ordering Specification) became an international standard in 1989, although application of preliminary versions of the language to communication services and protocols of the ISO/OSI family dates back to 1984. This history of the use of LOTOS made it apparent that more advantages than the pure production of standard reference documents were to be expected from the use of such formal description techniques. LOTOSphere: Software Development with LOTOS describes in depth a five year project that moved LOTOS out of the ISO tower into software engineering practice. LOTOS became a vehicle for efficient, yet formally based industrial software specification, design, verification, implementation and testing. LOTOSphere: Software Development with LOTOS is divided into six parts. The first introduces the reader to LOTOS and the project LOTOSphere. The five remaining each treat an important part of the software development life cycle using LOTOS. This is the first book to give a comprehensive treatment of the use of these formal description techniques in a software engineering environment. It will thus be a valuable reference for researchers and software developers and can also be used as a text for an advanced course on the subject

Synthesis from multi-paradigm specifications

This work proposes a language for describing reactive synthesis problems that integrates imperative and declarative elements. The semantics is defined in terms of two-player turn-based infinite games with full information. Currently, synthesis tools accept linear temporal logic (LTL) as input, but this description is less structured and does not facilitate the expression of sequential constraints. This motivates the use of a structured programming language to specify synthesis problems. Transition systems and guarded commands serve as imperative constructs, expressed in a syntax based on that of the modeling language Promela. The syntax allows defining which player controls data and control flow, and separating a program into assumptions and guarantees. These notions are necessary for input to game solvers. The integration of imperative and declarative paradigms allows using the paradigm that is most appropriate for expressing each requirement. The declarative part is expressed in the LTL fragment of generalized reactivity(1), which admits efficient synthesis algorithms. The implementation translates Promela to input for the Slugs synthesizer and is written in Python

A comparative reliability analysis of ETCS train radio communications

StoCharts have been proposed as a UML statechart extension for performance and dependability evaluation, and were applied in the context of train radio reliability assessment to show the principal tractability of realistic cases with this approach. In this paper, we extend on this bare feasibility result in two important directions. First, we sketch the cornerstones of a mechanizable translation of StoCharts to MoDeST. The latter is a process algebra-based formalism supported by the Motor/Möbius tool tandem. Second, we exploit this translation for a detailed analysis of the train radio case study

From StoCharts to MoDeST: a comparative reliability analysis of train radio communications

StoCharts have been proposed as a UML statechart extension for performance and dependability evaluation, and have been applied in the context of train radio reliability assessment to show the principal tractability of realistic cases with this approach. In this paper, we extend on this bare feasibility result in two important directions. First, we sketch the cornerstones of a mechanizable translation of StoCharts to MoDeST. The latter is a process algebra-based formalism supported by the Motor/Möbius tool tandem. Second, we exploit this translation for a detailed analysis of the train radio case study

A Core Reference Hierarchical Primitive Ontology for Electronic Medical Records Semantics Interoperability

Currently, electronic medical records (EMR) cannot be exchanged among hospitals, clinics, laboratories, pharmacies, and insurance providers or made available to patients outside of local networks. Hospital, laboratory, pharmacy, and insurance provider legacy databases can share medical data within a respective network and limited data with patients. The lack of interoperability has its roots in the historical development of electronic medical records. Two issues contribute to interoperability failure. The first is that legacy medical record databases and expert systems were designed with semantics that support only internal information exchange. The second is ontological commitment to the semantics of a particular knowledge representation language formalism. This research seeks to address these interoperability failures through demonstration of the capability of a core reference, hierarchical primitive ontological architecture with concept primitive attributes definitions to integrate and resolve non-interoperable semantics among and extend coverage across existing clinical, drug, and hospital ontologies and terminologies