Approximating event system abstractions by covering their states and transitions

DOI10.1007/978-3-319-74313-4_16zbMATH Open1461.68114OpenAlexW2619059191MaRDI QIDQ4989673FDOQ4989673

Authors Jacques Julliand, Pierre-Alain Masson, G. Voiron, Olga Kouchnarenko

Publication date 26 May 2021

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

Full work available at URL https://doi.org/10.1007/978-3-319-74313-4_16

zbMATH Keywords

predicate abstractionunder-approximationevent systems

Mathematics Subject Classification ID

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

Recommendations

• Test generation from event system abstractions to cover their states and transitions
• Under-approximation generation driven by relevance predicates and variants
• An approximation algorithm for box abstraction of transition systems on real state spaces
• Better Under-Approximation of Programs by Hiding Variables
• Predicate Abstraction with Under-approximation Refinement

Cited in

(4)

• Context-dependent minimization of state/event systems
• Under-approximation generation driven by relevance predicates and variants
• Test generation from event system abstractions to cover their states and transitions
• Folk Theorems on the Correspondence between State-Based and Event-Based Systems

This page was built for publication: Approximating event system abstractions by covering their states and transitions

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