Symbolic Supervisory Control of Resource Allocation Systems

<p>Supervisory control theory (SCT) is a formal model-based methodology for verification and synthesis of supervisors for discrete event systems (DES). The main goal is to guarantee that the closed-loop system fulfills given specifications. SCT has great promise to assist engineers with the generation of reliable control functions. This is, for instance, beneficial to manufacturing systems where both products and production equipment might change frequently.</p> <p>The industrial acceptance of SCT, however, has been limited for at least two reasons: (i) the analysis of DES involves an intrinsic difficulty known as the state-space explosion problem, which makes the explicit enumeration of enormous state-spaces for industrial systems intractable; (ii) the synthesized supervisor, represented as a deterministic finite automaton (FA) or an extended finite automaton (EFA), is not straightforward to implement in an industrial controller.</p> <p>In this thesis, to address the aforementioned issues, we study the modeling, synthesis and supervisor representation of DES using binary decision diagrams (BDDs), a compact data structure for representing DES models symbolically. We propose different kinds of BDD-based algorithms for exploring the symbolically represented state-spaces in an effort to improve the abilities of existing supervisor synthesis approaches to handle large-scale DES and represent the obtained supervisors appropriately.</p> <p>Following this spirit, we bring the efficiencies of BDD into a particular DES application domain -- deadlock avoidance for resource allocation systems (RAS) -- a problem that arises in many technological systems including flexible manufacturing systems and multi-threaded software. We propose a framework for the effective and computationally efficient development of the maximally permissive deadlock avoidance policy (DAP) for various RAS classes. Besides the employment of symbolic computation, special structural properties that are possessed by RAS are utilized by the symbolic algorithms to gain additional efficiencies in the computation of the sought DAP. Furthermore, to bridge the gap between the BDD-based representation of the target DAP and its actual industrial realization, we extend this work by introducing a procedure that generates a set of "guard" predicates to represent the resulting DAP.</p> <p>The work presented in this thesis has been implemented in the SCT tool Supremica. Computational benchmarks have manifested the superiority of the proposed algorithms with respect to the previously published results. Hence, the work holds a strong potential for providing robust, practical and efficient solutions to a broad range of supervisory control and deadlock avoidance problems that are experienced in the considered DES application domain.</p

Towards a Formal Specification Framework for Manufacturing Execution Systems

Manufacturing Execution Systems (MES) optimize production and business processes at the same time. However, the engineering and specification of MES is a challenging, interdisciplinary process. Especially IT and production experts with different views and background have to cooperate. For successful and efficient MES software projects, misunderstandings in the specification process have to be avoided. Therefore, textual specifications need to be complemented by unambiguous graphical models, reducing the complexity by integrating interdisciplinary views and domain specific terms based on different background knowledge. Today's modeling notations focus on the detailed modeling of a certain domain specific problem area. They do not support interdisciplinary discussion adequately. To bridge this gap a novel MES Modeling Language (MES-ML) integrating all necessary views important for MES and pointing out their interdependencies has been developed. Due to its formal basis, comparable and consistent MES-models can be created for specification, standardization, testing, and documentation of MES software. In this paper, the authors present the formal basis of the modeling language and its core notation. The application of MES-ML is demonstrated taking a yogurt production as an example. Finally, the authors give some evaluation results that underline the effectiveness and efficiency of this new modeling approach with reference to four applications in industrial MES-projects in the domain of discrete and hybrid manufacturing.Comment: 10 pages, https://ieeexplore.ieee.org/abstract/document/614565

D7.5 FIRST consolidated project results

The FIRST project commenced in January 2017 and concluded in December 2022, including a 24-month suspension period due to the COVID-19 pandemic. Throughout the project, we successfully delivered seven technical reports, conducted three workshops on Key Enabling Technologies for Digital Factories in conjunction with CAiSE (in 2019, 2020, and 2022), produced a number of PhD theses, and published over 56 papers (and numbers of summitted journal papers). The purpose of this deliverable is to provide an updated account of the findings from our previous deliverables and publications. It involves compiling the original deliverables with necessary revisions to accurately reflect the final scientific outcomes of the project

Supporting compliance verification for collaborative business processes.

Collaborative business processes are the current trend of business processes supported by the advances in technology like the Internet and collaborative networks. Enterprises no longer do business in isolation. The customer demands are always changing and becoming sophisticated with dynamic requirements and the shortening period in which they must be met. Collaborative business processes must conform with not only customer demands but also with laws, standards, best practice and regulations. These impose constraints on the business process that must be satisfied otherwise they attract criminal charges or financial fines. Corporate scandals for companies like Enron, World- com, Societe General etc. were a result of non-compliance. This attracted regulations like the Sarbanese Oxley Act, Basel III, Anti money laundering act among others with articles guiding operational practice. However, non compliance is still observed especially among SMEs that do not possess the skilled man power or the funding to acquire automated compliance solutions. In this thesis, we sought to support non-expert end users through a compliance management approach that can guide the specification and verification of compliance for collaborative business process with a range of policy and regulatory requirements. Collaborative business processes differ from traditional business processes. They are characterised by specific attributes that present unique verification requirements that cannot be automatically addressed by existing verification approaches. To achieve the intended goal, design science research method was employed to develop a mechanism to elicit requirements from different sources, translate them into formal constraints based on formal semantics, and a set of algorithms were composed to support compliance verification. The algorithms provide meaningful and easy to understand feedback to the end user about the compliance or violation of the collaborative business process. Due to the fact that policies and regulations change often, we adopted simulation analysis as a technique to assess and analyse the impact of such changes to the business process before actual implementation. The thesis artifacts are evaluated based on known information systems model evaluation methods following the design science recommended steps and the Method Evaluation model (MEM). We also validate and evaluate the compliance algorithms using a different industrial use case (the car insurance trading business process) from the case used in their design (the pick and pack business process). Further more, the performance of the algorithms is evaluated based on their computation complexity

Tools and Algorithms for the Construction and Analysis of Systems

This open access book constitutes the proceedings of the 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2022, which was held during April 2-7, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 46 full papers and 4 short papers presented in this volume were carefully reviewed and selected from 159 submissions. The proceedings also contain 16 tool papers of the affiliated competition SV-Comp and 1 paper consisting of the competition report. TACAS is a forum for researchers, developers, and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference aims to bridge the gaps between different communities with this common interest and to support them in their quest to improve the utility, reliability, exibility, and efficiency of tools and algorithms for building computer-controlled systems