Interpolation Based Unbounded Model Checking for Time Petri Nets

Igawa, Nao; Yokogawa, Tomoyuki; Amasaki, Sousuke; Komoku, Kiyotaka; Sato, Yoichiro; Arimoto, Kazutami

doi:10.1109/gcce.2018.8574651

Search citation statements

Order By: Relevance

Paper Sections

Select...

Summary and Future Work1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An experiment with practical TPNs and a comparison with other tools such as TINA and Romeo are on our future research direction. We will extend this work to apply interpolation based unbounded model checking (UBMC) [12], [21]. Future work is an application the effective UBMC algorithm [22] to our encoding.…”

Section: Summary and Future Workmentioning

confidence: 99%

See 1 more Smart Citation

Symbolic Representation of Time Petri Nets for Efficient Bounded Model Checking

Igawa

Yokogawa

Amasaki

et al. 2020

IEICE Trans. Inf. & Syst.

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Summary and Future Workmentioning

confidence: 99%

“…a) E-mail: t-yokoga@cse.oka-pu.ac.jp DOI: 10.1587/transinf.2019EDL8086 constraints in difference logic (DL) [12] in a similar manner to [8], and an efficient satisfiability solving algorithm for formulas described in DL [13] could be applicable.…”

Section: Introductionmentioning

confidence: 99%