Reduction and Simplification of Explicit LTL Model Checking via an Abstraction Method

An abstraction method developed for the explicit linear temporal logic model checking was geared towards reducing the useless part of the state space during the abstraction period.This reduces the cost during the abstraction period relative to models requiring many useless states.A dining-philosophers example comparing this abstraction method with conventional methods indicates that a large proportion of the state space has been reduced by this abstraction method.Finally,the abstract method is shown to be correct and an analysis is given to show how such a large proportion of states can be reduced.     

线性时序逻辑转换Büchi自动机的按需即时算法

将线性时序逻辑公式转换成Büchi自动机是显式模型检测中的关键环节,Tableau规则是常用转换算法。该文提出了基于Tableau规则的改进算法,将线性时序逻辑公式转换成基于迁移的Büchi自动机。通过在状态和迁移中加入∪公式的满足信息,实现了用一个接受条件集合判断执行序列是否可接受,避免了使用多个接受条件集合进行判断。改进算法引入了按需即时(on-the-fly)去扩展化机制,算法展开状态节点的同时进行状态有效性检测,删除无效节点,合并等价状态和迁移,避免了后置化简。与其他转换工具进行比较实验表明,该算法具有执行速度快、生成自动机的状态数和迁移数少的特征。     

Optimization of Unbalanced Multi-stage Logistics Systems Based on Prüfer Number and Effective Capacity Coding

Introduction Logistics is the technique of bringing the right amount of the right product to the right place at the right time with the lowest cost. If several facilities, such as plants or regional distribution centers (DCs), are sited be- tween the supp…