Slicing behavior tree models for verification

DOI10.1007/978-3-642-15240-5_10MaRDI QIDQ3163878zbMATH OpenOpenAlexFDO

Authors Nisansala Yatapanage, Kirsten Winter, Saad Zafar

Publication date 27 October 2010

Published in IFIP Advances in Information and Communication Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15240-5_10

zbMATH Keywords

Program slicing

Mathematics Subject Classification ID

Theory of software (68N99) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 2104628
• Dynamic slicing techniques for Petri nets
• Slicing software for model construction
• Approach of concurrent object-oriented program slicing based on LTL property
• Slicing for modern program structures: a theory for eliminating irrelevant loops

Cited in

(4)

• Next-preserving branching bisimulation
• Slicing techniques for verification re-use
• Lazy slicing for state-space exploration
• Dynamic slicing techniques for Petri nets

This page was built for publication: Slicing behavior tree models for verification

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