Using approximation for the verification of token-scaling models

DOI10.1007/978-3-662-65303-6_4zbMath1499.68230OpenAlexW4225701800MaRDI QIDQ2163772

Torsten Liebke, Karsten Schmidt

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)

Cites Work

• Unnamed Item
• Unnamed Item
• A partial approach to model checking
• How to calculate symmetries of Petri nets
• Simplification of CTL formulae for efficient model checking of Petri nets
• Handbook of Model Checking
• Applying CEGAR to the Petri Net State Equation
• Taking Some Burden Off an Explicit CTL Model Checker

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