Symbolic Representation of Time Petri Nets for Efficient Bounded Model Checking

Nao IGAWA, Tomoyuki YOKOGAWA, Sousuke AMASAKI, Masafumi KONDO, Yoichiro SATO, Kazutami ARIMOTO
2020 IEICE transactions on information and systems  
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.
doi:10.1587/transinf.2019edl8086 fatcat:6frvwb6xwrcpxnkwfjkzq542da