Preface (R.J. Aumann, S. Hart). Strategic equilibrium (E. van Damme). Foundations of strategic equilibrium (J. Hillas, E. Kohlberg). Incomplete information (R.J. Aumann, A. Heifetz). Non-zero-sum two-person games (T.E.S. Raghavan). Computing equilibria for two-person games (B. von Stengel). Non-cooperative games with many players (M. Ali Khan, Y. Sun). Stochastic games (J-F. Mertens). Stochastic games: recent results (N. Vieille). Game theory and industrial organization (K. Bagwell, A. Wolinsky). Bargaining with incomplete information (L.M. Ausubel, P. Cramton, R.J. Deneckere). Inspection Games (R. Avenhaus, B.V. Stengel, S.Zamir). Economic history and game theory (A. Greif). The shapley value (E. Winter). Variations on the shapley value (D. Monderer, D. Samet). Values of non-transferable utility games (R. McLean). Values of games with infinitely many players (A. Neyman). Values of perfectly competitive economies (S. Hart). Some other economic applications of the value (J-F. Mertens). Strategic aspects of political systems (J. Banks). Game-theoretic analysis of legal rules and institutions (J-P. Benoit, L.A. Kornhauser). Implementation Theory (T. Palfrey). Game Theory and experimental Gaming (M. Shubik).

Handbook of game theory with economic applications

The analysis of complex distributed systems requires dedicated software tools. The mCRL language and toolset have been developed to support such analysis. We highlight changes and improvements made to the toolset in recent years. On the one hand, these affect the scope of application, which has been broadened with extended support for data structures like infinite sets and functions. On the other hand, considerable progress has been made regarding the performance of our tools for state space generation and model checking, due to improvements in symbolic reduction techniques and due to a shift towards parity game-based solving. We also discuss the software architecture of the toolset, which was well suited to accommodate the above changes, and we address a number of case studies to illustrate the approach.

/pdf/an-overview-of-the-mcrl2-toolset-and-its-recent-advances-34iu08bn4k.pdf

An overview of the mCRL2 toolset and its recent advances

Process mining techniques attempt to extract nontrivial and useful information from event logs. For example, there are many process mining techniques to automatically discover a process model describing the causal dependencies between activities. Several successful case studies have been reported in literature, all demonstrating the applicability of process mining. However, these case studies refer to rather structured administrative processes. In this paper, we investigate the applicability of process mining to less structured processes. We report on a case study where the process mining (ProM) framework has been applied to the test processes of ASML (the leading manufacturer of wafer scanners in the world).This case study provides many interesting insights. On the one hand, process mining is also applicable to the less structured processes of ASML. On the other hand, the case study also shows the need for alternative mining approaches.

Process Mining Applied to the Test Process of Wafer Scanners in ASML

ion: Suppose 〈 p, σ 〉 p d −→〈 pd, σd 〉 and 〈 p, σ 〉 p d ′ −−→〈 pd′, σd′ 〉, where p ≡ π(x) and d′ < d. Using Rule 44 we obtain 〈x, σ 〉 p d −→ 〈xd, σd 〉 and we can conclude that pd ≡ τA(xd). Also, 〈x, σ 〉 p d ′ −−→ 〈xd′ , σd′ 〉 and we can conclude that pd′ ≡ τA(xd′). Induction on x gives us 1. 〈xd′ , σd′ 〉 p d−d ′ −−−→ 〈xd, σd 〉, 2. ∀xd′,a, σd′,a, a : 〈xd′ , σd′ 〉 a −→〈xd′,a, σd′,a 〉 ⇒ ∃xa, σa, xd,a, σd,a : 〈x, σ 〉 a −→ 〈xa, σa 〉 ∧ 〈xd, σd 〉 a −→ 〈 xd,a, σd,a 〉, 3. 〈xd′ , σd′ 〉6 ↓. Lemma 4.53 is easily proved since we already derived that pd ≡ τA(xd) and pd′ ≡ τA(xd′). Rule 40 and result 1 of the induction on x give 〈 pd′, σd′ 〉 p d−d ′ −−−→ 〈 pd, σd 〉. To prove Lemma 4.55, we assume 〈 pd′ , σd′ 〉 a −→ 〈 pd′,a, σd′,a 〉 for some pd′,a, σd′,a, and a. Since pd′ ≡ τA(xd′), we find using Rule 42 or 43 and result 2 of the induction on x that pd′,a ≡ τA(xd′,a). We can distinguish two cases: a 6≡ τ or a ≡ τ . Suppose a 6≡ τ , then we know by result 2 of the induction on x that there are xa, σa, xd,a, and σd,a such that 〈x, σ 〉 a −→〈 xa, σa 〉, 〈xd, σd 〉 a −→ 〈xd,a, σd,a 〉, and a 6∈ A. Using Rule 42 we obtain 〈 τA(x), σ 〉 a −→ 〈 τA(xa), σa 〉 and 〈 τA(xd), σd 〉 a −→ 〈 τA(xd,a), σd,a 〉. So, we have 〈 p, σ 〉 a −→ 〈 pa, σa 〉 and 〈 pd, σd 〉 a −→ 〈 pd,a, σd,a 〉 with pa ≡ τA(xa) and pd,a ≡ τA(xd,a). In case a ≡ τ , we know by result 2 of the induction on x that there are xa′ and xd,a′ , such that 〈x, σ 〉 a ′ −−→ 〈xa′ , σa′ 〉, 〈xd, σd 〉 a ′ −−→ 〈xd,a′ , σd,a′ 〉, and a′ ∈ A. Using Rule 43 we obtain 〈 τA(x), σ 〉 τ −→ 〈 τA(xτ ), στ 〉 and 〈 τA(xd), σd 〉 τ −→ 〈 τA(xd,τ ), σd,τ 〉. So, we have 〈 p, σ 〉 a −→〈 pa, σa 〉 and 〈 pd, σd 〉 a −→〈 pd,a, σd,a 〉 with pa ≡ τA(xa), pd,a ≡ τA(xd,a), and a ≡ τ . To prove Lemma 4.56 we use result 3 of the induction on x, which tells us that 〈xd′ , σd′ 〉6 ↓. Since pd′ ≡ τA(xd′), Rule 41 does not apply to pd′ and we obtain 〈 pd′ , σd′ 〉6 ↓. 132 The specification language χσ 4 4.18 Process specifications in χσ In this section, we describe how process specifications can be written in χσ. It is important to know that the process specification mechanism of χσ is based on syntactic replacement. So, formal parameters are replaced by actual parameters. Furthermore, it is assumed that instantiation is finite and therefore, recursive process specifications are not allowed. However, infinite behaviour can be specified by the repetition operator as discussed in Section 4.9. In χσ, process specifications are equations. The general form is P (x1, . . . , xn) = p, where P is an identifier, x1, . . . , xn are programming variables, and p is a χσ process possibly containing the programming variables x1, . . . , xn. An example is presented in Chapter 8.

/pdf/formal-specification-and-analysis-of-industrial-systems-fq8huy9bbt.pdf

Formal specification and analysis of industrial systems

This paper gives an overview of a Ph.D.-project that investigates approaches to support the evolution of software architectures. Particularly, we focus on the use of model-driven techniques in the context of software product-lines. We recognize four tasks related to software evolution: evaluation, conformance checking, migration, and documentation. We propose model-driven solutions for these tasks. By their application in industrial case studies we investigate the extent to which the evolution tasks can be automated, the impact of the use of software product lines, and the possibilities and difficulties to integrate these solutions in industrial practice

/pdf/model-driven-evolution-of-software-architectures-4v23d4olxk.pdf

Model-Driven Evolution of Software Architectures

Formal methods help in coping with the growing functionality and complexity, time-to-market and costs in cyber-physical systems (CPSs). Supervisory control synthesis (SCS) is such a method. It can be used to synthesize a controller for a CPS from the uncontrolled system model (plant) and the specification model (requirements). While SCS is an active research topic, reports on industrial applications are rare. In this paper, we show the applicability of SCS to the design of controllers for waterway locks. The following steps in the development process are discussed: modeling the plant and the requirements, synthesizing the supervisor, validating the supervisor, generating a real-time controller and implementing this controller on a PLC. Following this way of working, a supervisory controller for a real waterway lock has been successfully developed and analyzed. The real-time controller is implemented in an experimental set-up. The state-space size of the uncontrolled plant is 6.0 χ 1032 and the number of state-based requirements involved in the specification is 234. The synthesized controller is automatically translated into 1.2 χ 104 lines of structured text, executable by a PLC. This case study delivers a proof of concept for the applicability of the procedure for supervisor synthesis and automatic PLC code generation to industrial-size systems.

Supervisory control synthesis for a waterway lock

https://www.win.tue.nl/~awijs/articles/turntable_techreport.pdf

Analyzing a Chi model of a turntable system using Spin, CADP and Uppaal

Because of the growing complexity, the design of and reasoning about modern industrial systems becomes increasingly difficulty. In order to understand and estimate the dynamic system behaviour, appropriate models have to be used. In many cases, existing mathematical models like queuing networks, Markov chain models, or perturbation analysis cannot be applied. In such cases, usually a model is constructed that can be validated by means of computer simulation. Since industrial systems exhibit concurrency, formalisms developed to reason about con current systems are also well suited for developing models in this specific application area. Models of systems can be expressed, for instance, in terms of Petri nets or in terms of programs written in a concurrent programming language, like Timed CSP. Both approaches, originating from computer science, are increasingly often applied in modelling of manufacturing systems. In this paper, we present a simple modular approach to the specification of (discrete) industri...

/pdf/specification-of-a-flexible-manufacturing-system-using-q2lzbyt9hf.pdf

Specification of a Flexible Manufacturing System Using Concurrent Programming.

A Model-based Integration and Testing Method to Reduce System Development Effort⋆

Testing complex manufacturing systems, such as an ASML lithographic machine, takes up to 45% of the total development time of a system. The problem of which tests must be executed in what sequence to ensure in the shortest possible test time that the system works, which is the test-sequencing problem, was already solved by Pattipati et al. for the diagnosis of systems during operation. Test-sequencing problems during the development and manufacturing phases of systems, however, require a different approach than the test-sequencing problems during operation. In this paper, the test problem description and algorithms developed by Pattipati et al. are extended to solve test-sequencing problems for the development and manufacturing of manufacturing systems. For a case study in the manufacturing process of an ASML lithographic machine, it is shown that solving a test-sequencing problem with this method can reduce the test time by 15% to 30% compared to experts that solve this problem manually.

http://www.mate.tue.nl/mate/pdfs/7001.pdf

J.M. van de Mortel-Fronczak

Papers

Supervisory control synthesis for a waterway lock

Analyzing a Chi model of a turntable system using Spin, CADP and Uppaal

Specification of a Flexible Manufacturing System Using Concurrent Programming.

A Model-based Integration and Testing Method to Reduce System Development Effort⋆

Test Sequencing in Complex Manufacturing Systems