Predicate abstraction of max-plus linear systems enables bounded model checking for time-difference specifications with an explicit completeness threshold bound based on transient and cyclicity.
Formal Methods in System Design 25(2-3), 105–127 (2004)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Bounded Model Checking of Max-Plus Linear Systems via Predicate Abstractions
Predicate abstraction of max-plus linear systems enables bounded model checking for time-difference specifications with an explicit completeness threshold bound based on transient and cyclicity.