Symbolic Representation of Time Petri Nets for Efficient Bounded Model Checking

Safety critical systems are often modeled using Time Petri Nets (TPN) for analyzing their reliability with formal verification methods. This paper proposed an efficient verification method for TPN introducing bounded model checking based on satisfiability solving. The proposed method expresses time...

Full description

Saved in:
Bibliographic Details
Published inIEICE Transactions on Information and Systems Vol. E103.D; no. 3; pp. 702 - 705
Main Authors IGAWA, Nao, YOKOGAWA, Tomoyuki, AMASAKI, Sousuke, KONDO, Masafumi, SATO, Yoichiro, ARIMOTO, Kazutami
Format Journal Article
LanguageEnglish
Published Tokyo The Institute of Electronics, Information and Communication Engineers 01.03.2020
Japan Science and Technology Agency
Subjects
difference logic
formal verification
Petri nets
Reliability analysis
Safety critical
SMT Solver
Solvers
Time Petri Net
Verification
Online AccessGet full text

Cover

More Information
Summary:Safety critical systems are often modeled using Time Petri Nets (TPN) for analyzing their reliability with formal verification methods. This paper proposed an efficient verification method for TPN introducing bounded model checking based on satisfiability solving. The proposed method expresses time constraints of TPN by Difference Logic (DL) and uses SMT solvers for verification. Its effectiveness was also demonstrated with an experiment.
ISSN:0916-8532
1745-1361
DOI:10.1587/transinf.2019EDL8086