http://user.it.uu.se/~jarst116/slides/week4.pdf

Graph-Based Algorithms for Boolean Function Manipulation

Alternating-time temporal logic

https://ir.nctu.edu.tw:443/bitstream/11536/100881/1/982410H009004.PDF

國際期刊 Transportation Research-Part E---Logistics and Transportation Review 特刊編輯補助

The targeted audience for this book is graduate students in engineering and medical statistics courses, and it may be useful for a senior undergraduate statistics course. To get the maximum benefit from this book, one should have a good knowledge and understanding of calculus and sufficient background in elementary probability theory to understand the central limit theorem and the law of large numbers. Some more sophisticated probability terminologies and concepts are defined for a smooth reading of the monograph. This monograph has 10 chapters, including the introduction. Chapter 2 deals with the ageing concept and some usual parametric families of probability distribution are presented in Chapter 3. Parametric and nonparametric statistical inference are nicely treated in Chapters 4 and 5. Chapter 5 also offers tests for exponentiality, which is one of the main feature of the monograph. Chapters 7 and 8 cover two-sample and regression problems, respectively. All of the preceding chapters showcase results for both complete and censored data. One of the interesting contributions is with regard to the analysis of competing risk, which is presented in Chapter 9. Finally, Chapter 10 introduces repairable systems. One of the main strengths of this book is that it introduces the public domain R software and nicely explains how it can be used in computations of methods presented in the book. This book has sufficient material and examples to cover a one semester (13week) course. However, I would be reluctant to adopt this book for one simple reason—there are no exercises. Having said that, the monograph would be useful to some applied researchers in related fields.

Handbook of Statistical Distributions with Applications

Android Open Source Projectを対象としたパッチレビュー活動の調査

Recent work on Alternating-Time Temporal Logic and Coalition Logic has allowed the expression of many interesting properties of coalitions and strategies. However, there is no natural way of expressing resource requirements in these logics. In this article, we present a Resource-Bounded Coalition Logic (RBCL) that has explicit representation of resource bounds in the language. We give a complete and sound axiomatization of RBCL, a procedure for deciding satisfiability of RBCL formulas, and a model-checking algorithm.

/pdf/logic-for-coalitions-with-bounded-resources1-kv7d0qf4vk.pdf

Logic for coalitions with bounded resources1

We describe a novel framework for modelling railway interlockings which has been developed in conjunction with railway engineers. The modelling language used is CSP $$||$$ | | B. Beyond the modelling we present a variety of abstraction techniques which make the analysis of medium- to large-scale networks feasible. The paper notably introduces a covering technique that allows railway scheme plans to be decomposed into a set of smaller scheme plans. The finitisation and topological abstraction techniques are extended from previous work and are given formal foundations. All three techniques are applicable to other modelling frameworks besides CSP $$||$$ | | B. Being able to apply abstractions and simplifications on the domain model before performing model checking is the key strength of our approach. We demonstrate the use of the framework on a real-life, medium-size scheme plan.

/pdf/techniques-for-modelling-and-verifying-railway-interlockings-28oryc1eh1.pdf

Techniques for modelling and verifying railway interlockings

The safety analysis of interlocking railway systems involves verifying collision and derailment freedom. In this paper we propose a structured way of refining track plans, in order to expand track segments so that they form collections of track segments. We show how the abstract model can be model checked to ensure the safety properties, which must also hold in the corresponding concrete track plan, so that we will never need to model check the concrete track plan directly. We also identify the minimal number of trains that needs to be considered as part of the model checking, and we demonstrate the practicality of the approach on various scenarios.

/pdf/defining-and-model-checking-abstractions-of-complex-railway-2ckd4o5dcz.pdf

Defining and model checking abstractions of complex railway models using CSP

The paper presents a tool-supported approach to graphically editing scheme plans and their safety verification. The graphical tool is based on a Domain Specific Language which is used as the basis for transformation to a CSP $$\parallel $$ —i¾? B formal model of a scheme plan. The models produced utilise a variety of abstraction techniques that make the analysis of large scale plans feasible. The techniques are applicable to other modelling languages besides CSP $$\parallel $$ —i¾? B. We use the ProB tool to ensure the safety properties of collision, derailment and run-through freedom.

/pdf/verification-of-scheme-plans-using-csp-23uccmgxp5.pdf

Verification of Scheme Plans Using CSP

Railways need to be safe and, at the same time, should offer high capacity. While the notion of safety is well understood in the railway domain, the meaning of capacity is understood only on an intuitive and informal level. In this study, we show how to define and analyse capacity in a rigorous way. Our modelling approach builds on an established modelling technique in the process algebra Csp for safety alone, provides an integrated view on safety as well as capacity, and offers proof support in terms of (untimed) model checking.

http://www.cs.swan.ac.uk/~csmarkus/ProcessesAndData/sites/default/files/uploads/papers/final_ifm2012.pdf

Hoang Nga Nguyen

Papers

Logic for coalitions with bounded resources1

Techniques for modelling and verifying railway interlockings

Defining and model checking abstractions of complex railway models using CSP

Verification of Scheme Plans Using CSP

Safety and line capacity in railways --- an approach in timed CSP