Showing cs.FLShow all
2 papers · 1 filter
cs.FL2025
Regular Model Checking for Systems with Effectively Regular Reachability Relation
Javier Esparza, Valentin Krasotin
Regular model checking is a well-established technique for the verification of regular transition systems (RTS): transition systems whose initial configurations and transition rela…
cs.FL2024
Computing Inductive Invariants of Regular Abstraction Frameworks
Philipp Czerner, Javier Esparza, Valentin Krasotin +1
Regular transition systems (RTS) are a popular formalism for modeling infinite-state systems in general, and parameterised systems in particular. In a CONCUR 22 paper, Esparza et a…