A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Infinite State Model Checking by Learning Transitive Relations
A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
-
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.