How hard is smart play-out? On the complexity of verification-driven execution

MaRDI QIDQ5190780zbMATH OpenFDO

Authors David Harel, Hillel Kugler, Shahar Maoz, Itai Segall

Publication date 27 July 2009

zbMATH Keywords

live sequence chartsmodel checking

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• On the power of play-out for scenario-based programs
• scientific article; zbMATH DE number 1979562
• scientific article; zbMATH DE number 2017339
• Some Results on the Expressive Power and Complexity of LSCs
• scientific article; zbMATH DE number 2016062

Cited in

(3)

• scientific article; zbMATH DE number 1979562 (Why is no real title available?)
• scientific article; zbMATH DE number 2016062 (Why is no real title available?)
• On the power of play-out for scenario-based programs

This page was built for publication: How hard is smart play-out? On the complexity of verification-driven execution

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