scholarly journals Model Checking Temporal Logic Formulas Using Sticker Automata

2017 ◽  
Vol 2017 ◽  
pp. 1-33 ◽  
Author(s):  
Weijun Zhu ◽  
Changwei Feng ◽  
Huanmei Wu
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Complex Problem ◽  
Finite State Automaton ◽  
Dna Molecules ◽  
Single Stranded Dna ◽  
Finite State ◽  
Input Strings ◽  
Logic Model Checking ◽  
The Given

As an important complex problem, the temporal logic model checking problem is still far from being fully resolved under the circumstance of DNA computing, especially Computation Tree Logic (CTL), Interval Temporal Logic (ITL), and Projection Temporal Logic (PTL), because there is still a lack of approaches for DNA model checking. To address this challenge, a model checking method is proposed for checking the basic formulas in the above three temporal logic types with DNA molecules. First, one-type single-stranded DNA molecules are employed to encode the Finite State Automaton (FSA) model of the given basic formula so that a sticker automaton is obtained. On the other hand, other single-stranded DNA molecules are employed to encode the given system model so that the input strings of the sticker automaton are obtained. Next, a series of biochemical reactions are conducted between the above two types of single-stranded DNA molecules. It can then be decided whether the system satisfies the formula or not. As a result, we have developed a DNA-based approach for checking all the basic formulas of CTL, ITL, and PTL. The simulated results demonstrate the effectiveness of the new method.

Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments

2016 ◽  
pp. 389-405 ◽  
Author(s):  
Laura Bozzelli ◽  
Alberto Molinari ◽  
Angelo Montanari ◽  
Adriano Peron ◽  
Pietro Sala
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Logic Model ◽  
Interval Temporal Logic ◽  
Logic Model Checking

scholarly journals PAYNT: A Tool for Inductive Synthesis of Probabilistic Programs

2021 ◽  
pp. 856-869
Author(s):  
Roman Andriushchenko ◽  
Milan Češka ◽  
Sebastian Junges ◽  
Joost-Pieter Katoen ◽  
Šimon Stupinský
Keyword(s):  
Model Checking ◽  
Case Studies ◽  
Temporal Logic ◽  
Probabilistic Model ◽  
Finite Family ◽  
Probabilistic Model Checking ◽  
Inductive Synthesis ◽  
Finite State ◽  
Alternative Approaches ◽  
Probabilistic Programs

AbstractThis paper presents PAYNT, a tool to automatically synthesise probabilistic programs. PAYNT enables the synthesis of finite-state probabilistic programs from a program sketch representing a finite family of program candidates. A tight interaction between inductive oracle-guided methods with state-of-the-art probabilistic model checking is at the heart of PAYNT. These oracle-guided methods effectively reason about all possible candidates and synthesise programs that meet a given specification formulated as a conjunction of temporal logic constraints and possibly including an optimising objective. We demonstrate the performance and usefulness of PAYNT using several case studies from different application domains; e.g., we find the optimal randomized protocol for network stabilisation among 3M potential programs within minutes, whereas alternative approaches would need days to do so.

scholarly journals A Transformation-Based Approach to Implication of GSTE Assertion Graphs

2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Guowu Yang ◽  
William N. N. Hung ◽  
Xiaoyu Song ◽  
Wensheng Guo
Keyword(s):  
Model Checking ◽  
Directed Graphs ◽  
Classical Model ◽  
Regular Languages ◽  
Finite State Automaton ◽  
Finite State Automata ◽  
Symbolic Trajectory Evaluation ◽  
Finite State ◽  
Symbolic Trajectory ◽  
Language Containment

Generalized symbolic trajectory evaluation (GSTE) is a model checking approach and has successfully demonstrated its powerful capacity in formal verification of VLSI systems. GSTE is an extension of symbolic trajectory evaluation (STE) to the model checking ofω-regular properties. It is an alternative to classical model checking algorithms where properties are specified as finite-state automata. In GSTE, properties are specified as assertion graphs, which are labeled directed graphs where each edge is labeled with two labeling functions: antecedent and consequent. In this paper, we show the complement relation between GSTE assertion graphs and finite-state automata with the expressiveness of regular languages andω-regular languages. We present an algorithm that transforms a GSTE assertion graph to a finite-state automaton and vice versa. By applying this algorithm, we transform the problem of GSTE assertion graphs implication to the problem of automata language containment. We demonstrate our approach with its application to verification of an FIFO circuit.

Symmetry in temporal logic model checking

2006 ◽  
Vol 38 (3) ◽  
pp. 8 ◽  
Author(s):  
Alice Miller ◽  
Alastair Donaldson ◽  
Muffy Calder
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Logic Model ◽  
Logic Model Checking

scholarly journals An Approach of XML Query Evaluation Based Model Checking

2016 ◽  
Vol 16 (4) ◽  
pp. 45-54
Author(s):  
Li Yan-Mei ◽  
Huang Shao-Bin ◽  
Li Ya ◽  
Xu Li
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Structured Data ◽  
Formal Specifications ◽  
Query Execution ◽  
Semantic Description ◽  
Data Query ◽  
Execution Strategy ◽  
Path Queries ◽  
Logic Model Checking

Abstract In this paper, we show the process inspired by model checking which integrate temporal logic to the application of semi-structured data query. We investigate the potential ofatechnique based on CTL (Computation Tree Logic) model checking for evaluating queries expressed in (a subset of) XPath. Our research consists of query algebra, constraint understanding and expression mapping. The core of research is mapping the XMLquery algebra to an expression collection of temporal logic. We tryanew kind of query execution strategy to enhance the accuracy of semantic description of the XMLquery. For the purpose of supporting the generation of the formal specifications and reducing the mapping processing, the XMLquery constraint can be converted toaspecification of SPS (Specification Pattern System) through which we get the formula set to evaluate path queries directly on CTLformula.

Sign in / Sign up

Export Citation Format

Share Document