Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking

Abstract

In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often quite manageable, and symbolic representations of the system, whose state space is typically exceedingly large. We compare the effects of using, respectively, (i) a purely… (More)
DOI: 10.1007/s10009-010-0168-4

Topics

43 Figures and Tables

Statistics

0510'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

fewer than 50 Citations

Semantic Scholar estimates that this publication has 50 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics