Using approximation for the verification of token-scaling models

DOI10.1007/978-3-662-65303-6_4MaRDI QIDQ2163772zbMATH OpenOpenAlexFDO

Authors Torsten Liebke, Karsten Wolf

Publication date 11 August 2022

Full work available at URL https://doi.org/10.1007/978-3-662-65303-6_4

zbMATH Keywords

model checkingunder-approximationwitness path

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets
• Symbolic and structural model-checking
• scientific article; zbMATH DE number 2080053
• Model Checking – My 27-Year Quest to Overcome the State Explosion Problem
• Simplification of CTL formulae for efficient model checking of Petri nets

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 3800934 (Why is no real title available?)
• A partial approach to model checking
• Applying CEGAR to the Petri net state equation
• Handbook of model checking
• How to calculate symmetries of Petri nets
• Simplification of CTL formulae for efficient model checking of Petri nets
• Taking Some Burden Off an Explicit CTL Model Checker

This page was built for publication: Using approximation for the verification of token-scaling models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163772)