Model-Checking of Infinite Graphs Defined by Graph Grammars

2000 ◽  
Vol 5 ◽  
pp. 1 ◽  
Author(s):  
O BURKART ◽  
Y QUEMENER
Keyword(s):  
Model Checking ◽  
Infinite Graphs ◽  
Graph Grammars

VERIFICATION OF EMBEDDED SUPERVISORY CONTROLLERS CONSIDERING HYBRID PLANT DYNAMICS

2005 ◽  
Vol 15 (02) ◽  
pp. 307-312 ◽  
Author(s):  
SEBASTIAN ENGELL ◽  
SVEN LOHMANN ◽  
OLAF STURSBERG
Keyword(s):  
Model Checking ◽  
Embedded Systems ◽  
Timed Automata ◽  
Processing System ◽  
Hybrid Plant ◽  
Graph Grammars ◽  
Safety Properties ◽  
Hybrid Automaton ◽  
Plant Behavior ◽  
Hybrid Dynamics

This contribution proposes a link between the specification of supervisory controllers by Sequential Function Charts (SFC) and the verification of embedded systems with hybrid dynamics. The SFC are transformed into modular timed automata using a procedure based on graph grammars. The resulting controller model is composed with a hybrid automaton (with possibly nonlinear continuous dynamics) that models the plant behavior. In order to verify safety properties of the composed system algorithmically, a tool implementing the recently proposed approach of counterexample guided model checking is employed. The procedure is illustrated for a processing system example.

scholarly journals Software model-checking as cyclic-proof search

2022 ◽  
Vol 6 (POPL) ◽  
pp. 1-29
Author(s):  
Takeshi Tsukada ◽  
Hiroshi Unno
Keyword(s):  
Model Checking ◽  
Search Strategies ◽  
Infinite Graphs ◽  
Proof System ◽  
Software Model Checking ◽  
Proof Search ◽  
Software Model ◽  
Logical Foundation ◽  
Efficient Solver

This paper shows that a variety of software model-checking algorithms can be seen as proof-search strategies for a non-standard proof system, known as a cyclic proof system . Our use of the cyclic proof system as a logical foundation of software model checking enables us to compare different algorithms, to reconstruct well-known algorithms from a few simple principles, and to obtain soundness proofs of algorithms for free. Among others, we show the significance of a heuristics based on a notion that we call maximal conservativity ; this explains the cores of important algorithms such as property-directed reachability (PDR) and reveals a surprising connection to an efficient solver of games over infinite graphs that was not regarded as a kind of PDR.

Model Checking Control Software for Nonlinear Dynamic Systems

2008 ◽  
Author(s):  
James Kapinski ◽  
Alexandre Donze ◽  
Flavio Lerda ◽  
Hitashyam Maka ◽  
Edmund Clarke ◽  
...  
Keyword(s):  
Model Checking ◽  
Dynamic Systems ◽  
Nonlinear Dynamic ◽  
Nonlinear Dynamic Systems ◽  
Control Software

REQUIREMENT FORMALIZATION FOR MODEL CHECKING USING EXTENDED BACKUS NAUR FORM

2019 ◽  
Vol 13 (3) ◽  
pp. 1
Author(s):  
ALIYU E. O. ◽  
ADEWALE O. S. ◽  
ADETUNMBI A. O. ◽  
OJOKOH B. A. ◽  
◽  
...  
Keyword(s):  
Model Checking
Sign in / Sign up

Export Citation Format

Share Document