Using optimal simulations to reduce reachability graphs

DOI10.1007/BFB0023730MaRDI QIDQ4037381zbMATH OpenFDO

Authors Ryszard Janicki, Maciej Koutny

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0023730

zbMATH Keywords

reachability graphreductionverification of dynamic properties of concurrent systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 177250
• scientific article; zbMATH DE number 714461
• Simulation revisited
• Model checking based on simultaneous reachability analysis

Cited in

(4)

• On stubborn sets in the verification of linear time temporal properties
• Joint optimization and reachability analysis in graph transformation systems with time
• Computing bounded reach sets from sampled simulation traces
• On Stubborn Sets in the Verification of Linear Time Temporal Properties

This page was built for publication: Using optimal simulations to reduce reachability graphs

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