A case study about the improvement of business process models driven by indicators

Organizations are increasingly concerned about business process model improvement in their efforts to guarantee improved operational efficiency. Quality assurance of business process models should be addressed in the most objective manner, e.g., through the application of measures, but the assessment of measurement results is not a straightforward task and it requires the identification of relevant indicators and threshold values, which are able to distinguish different levels of process model quality. Furthermore, indicators must support the improvements of the models by using suitable guidelines. In this paper, we present a case study to evaluate the BPMIMA framework for BP model improvement. This framework is composed of empirically validated measures related to quality characteristics of the models, a set of indicators with validated thresholds associated with modeling guidelines and a prototype supporting tool. The obtained data suggest that the redesign by applying guidelines driven by the indicator results was successful, as the understandability and modifiability of the models were improved. In addition, the changes in the models according to guidelines were perceived as acceptable by the practitioners who participated in the case study.     

FLAME: a formal framework for the automated analysis of software product lines validated by automated specification testing

In a literature review on the last 20 years of automated analysis of feature models, the formalization of analysis operations was identified as the most relevant challenge in the field. This formalization could provide very valuable assets for tool developers such as a precise definition of the analysis operations and, what is more, a reference implementation, i.e., a trustworthy, not necessarily efficient implementation to compare different tools outputs. In this article, we present the FLAME framework as the result of facing this challenge. FLAME is a formal framework that can be used to formally specify not only feature models, but other variability modeling languages (VML s) as well. This reusability is achieved by its two-layered architecture. The abstract foundation layer is the bottom layer in which all VML-independent analysis operations and concepts are specified. On top of the foundation layer, a family of characteristic model layers—one for each VML to be formally specified—can be developed by redefining some abstract types and relations. The verification and validation of FLAME has followed a process in which formal verification has been performed traditionally by manual theorem proving, but validation has been performed by integrating our experience on metamorphic testing of variability analysis tools, something that has shown to be much more effective than manually designed test cases. To follow this automated, test-based validation approach, the specification of FLAME, written in Z, was translated into Prolog and 20,000 random tests were automatically generated and executed. Tests results helped to discover some inconsistencies not only in the formal specification, but also in the previous informal definitions of the analysis operations and in current analysis tools. After this process, the Prolog implementation of FLAME is being used as a reference implementation for some tool developers, some analysis operations have been formally specified for the first time with more generic semantics, and more VML s are being formally specified using FLAME.     

Consensus and disturbance attenuation in multi‐agent chains with nonlinear control and time delays

In this paper, we investigate consensus and disturbance attenuation in a chain of mobile agents, which include non‐autonomous agents, semi‐autonomous agents and autonomous agents. In particular, the nonlinear dynamics of non‐autonomous agents is given and cannot be designed, while the dynamics of semi‐autonomous and autonomous agents can be partially and fully designed, respectively. To improve the robustness of multi‐agent chains against disturbances, we propose a nonlinear control framework for semi‐autonomous and autonomous agents such that they mimic the behavior of non‐autonomous agents for compatibility while also exploiting long‐range connections with distant agents. This framework ensures the existence of a unique consensus equilibrium, which is independent of the network size, connectivity topologies, control gains and information delays. Robustness of multi‐agent chains against disturbances is investigated by evaluating the frequency response at the nonlinear level. For infinitely long multi‐agent chains with recurrent patterns, we also derive a condition that ensures the disturbance attenuation but only requires the analysis of the linearized model. A case study is conducted for a connected vehicle system where numerical simulations are used to validate the analytical results. Copyright © 2016 John Wiley & Sons, Ltd.     

Reliability and time‐to‐failure bounds for discrete‐time constrained Markov jump linear systems

This paper presents a methodology to obtain a guaranteed‐reliability controller for constrained linear systems, which switch between different modes according to a Markov chain (Markov jump linear systems). Inside the classical maximal robust controllable set, there is 100% guarantee of never violating constraints at future time. However, outside such set, some sequences might make hitting constraints unavoidable for some disturbance realisations. A guaranteed‐reliability controller based on a greedy heuristic approach was proposed in an earlier work for disturbance‐free, robustly stabilisable Markov jump linear systems. Here, extensions are presented by, first, considering bounded disturbances and, second, presenting an iterative algorithm based on dynamic programming. In non‐stabilisable systems, reliability is zero; therefore, prior results cannot be applied; in this case, optimisation of a mean‐time‐to‐failure bound is proposed, via minor algorithm modifications. Optimality can be proved in the disturbance‐free, finitely generated case. Copyright © 2016 John Wiley & Sons, Ltd.     

Solving differential matrix Riccati equations by a piecewise-linearized method based on diagonal Padé approximants

Differential Matrix Riccati Equations (DMREs) appear in several branches of science such as applied physics and engineering. For example, these equations play a fundamental role in control theory, optimal control, filtering and estimation, decoupling and order reduction, etc. In this paper a new method based on a theorem proved in this paper is described for solving DMREs by a piecewise-linearized approach. This method is applied for developing two block-oriented algorithms based on diagonal Padé approximants. MATLAB versions of the above algorithms are developed, comparing, under equal conditions, accuracy and computational costs with other piecewise-linearized algorithms implemented by the authors. Experimental results show the advantages of solving stiff or non-stiff DMREs by the implemented algorithms.     

An integration experience of a software architecture and a monitoring infrastructure to deploy applications with non‐functional requirements in computing grids

Resource management is an important aspect to consider regarding applications that might have different non‐functional or operational requirements, when running in distributed and heterogeneous environments. In this context, it is necessary to provide the means to specify the required resource constraints and an infrastructure that can adapt the applications in light of the changes in resource availability. We adopted a contract‐based approach to describe and maintain parallel applications that have non‐functional requirements in a Computing Grid context, called ZeliGrid. To form the supporting infrastructure we have designed a software architecture that integrates some of the Globus services, the LDAP and the NWS monitoring services. Some modules that map the contract approach into software artifacts were also integrated to this architecture. This paper addresses the architecture and integration issues of our approach, as well as how we put the pieces together highlighting deployment and implementation details, which have to consider diverse aspects such as monitoring, security and dynamic reconfiguration. Copyright © 2010 John Wiley & Sons, Ltd.     

Fracture analysis of plane piezoelectric/piezomagnetic multiphase composites under transient loading

The transient response of cracked composite materials made of piezoelectric and piezomagnetic phases, when subjected to in-plane magneto-electro-mechanical dynamic loads, is addressed in this paper by means of a mixed boundary element method (BEM) approach. Both the displacement and traction boundary integral equations (BIEs) are used to develop a single-domain formulation. The convolution integrals arising in the time-domain BEM are numerically computed by Lubich’s quadrature, which determines the integration weights from the Laplace transformed fundamental solution and a linear multistep method. The required Laplace-domain fundamental solution is derived by means of the Radon transform in the form of line integrals over a unit circumference. The singular and hypersingular BIEs are numerically evaluated in a precise and efficient manner by a regularization procedure based on a simple change of variable, as previously proposed by the authors for statics. Discontinuous quarter-point elements are used to properly capture the behavior of the extended crack opening displacements (ECOD) around the crack-tip and directly evaluate the field intensity factors (stress, electric displacement and magnetic induction intensity factors) from the computed nodal data. Numerical results are obtained to validate the formulation and illustrate its capabilities. The effect of the combined application of electric, magnetic and mechanical loads on the dynamic field intensity factors is analyzed in detail for several crack configurations under impact loading.     

Using meta‐modeling in design and implementation of component‐based systems: the SOFA case study

To allow efficient and user‐friendly development of a component‐based application, component systems have to provide a rather complex development infrastructure, including a tool for component composition, component repository, and a run‐time infrastructure. In this paper, we present and evaluate benefits of using meta‐modeling during the process of defining a component system and also during creation of the development and run‐time infrastructures. Most of the presented arguments are based on a broad practical experience with designing the component systems SOFA and SOFA 2; the former designed in a classical ad hoc ‘manual’ way, whereas the latter with the help of meta‐modeling. Copyright © 2010 John Wiley & Sons, Ltd.