Titlebook: Structured Object-Oriented Formal Language and Method; 7th International Wo Cong Tian,Fumiko Nagoya,Zhenhua Duan Conference proceedings 201

淡紫色花

严重伤害

The Complexity of Linear-Time Temporal Logic Model Repairke structure ., whose modification can make the given LTL formula satisfiable. We will examplify the application of the model and study the computational complexity of the problem. We will show the problem can be solved in exponential time but remains NP-hard even if . is a constant.

Lament

Extending UML for Model CheckingML4MC, is defined by extending the activity diagram with accurate syntax and semantics to model the activities of an object. Besides, the technique for automatical transformation of xUML4MC model into MSVL (Modeling, Simulation and Verification Language) model is also presented, which in turn can be

anthropologist

Host142

An Improved Reliability Testing Model Based on SOFLich can quantify and assess software reliability by establishing the model of software reliability, is an important method to verify software reliability. SOFL is an object-oriented structured formal language and engineering approach. SOFL consists of Condition Data Flow Diagram (CDFD) and formal de

反叛者

A Framework Based on MSVL for Verifying Probabilistic Properties in Social Networksn this work, a framework based on MSVL (Modeling, Simulation and Verification Language) for verifying probabilistic properties in social networks is proposed. First, a hidden Markov model (HMM) is trained with the real social network dataset and implemented by MSVL. Then, an observed sequence is inp

切碎

颂扬国家

MAPLE

A Proof Score Approach to Formal Verification of an Imperative Programming Language Compilerso have a virtually machine (VM) and a compiler. The compiler transforms a Minila program into an instruction sequence processed by the VM. Since the formal specifications are executable, it is doable to test if for any concrete terminating program . the result of interpreting . is the same as the o

持久

On the Cooperative Graph Searching Problemed after each searching step. Therefore, we can make sure that every searcher can be cooperated by another searcher. We prove that the cooperative graph searching problem is NP-complete on general graphs and propose polynomial-time algorithms for the problem on grid graphs.