2022 · 19 citations · 14 references
ComputingComputer ScienceComputer SystemsDatabasesFormal MethodsTheory Of ComputationFinite State Machine ModelingFinite-state MachinesModel CheckingTemporal LogicDecidabilityDecidability ProblemsDynamic Systems ApproachFinite-state VerificationLinear ArithmeticModularityState AbstractionState-space Abstraction
Combined modeling and verification of dynamic systems and the data they operate on has gained momentum in AI and in several application domains. We investigate the expressive yet concise framework of data-aware dynamic systems (DDS), extending it with linear arithmetic, and providing the following contributions. First, we introduce a new, semantic property of “finite summary”, which guarantees the existence of a faithful finite-state abstraction. We rely on this to show that checking whether a witness exists for a linear-time, finite-trace property is decidable for DDSs with finite summary. Second, we demonstrate that several decidability conditions studied in formal methods and database theory can be seen as concrete, checkable instances of this property. This also gives rise to new decidability results. Third, we show how the abstract, uniform property of finite summary leads to modularity results: a system enjoys finite summary if it can be partitioned appropriately into smaller systems that possess the property. Our results allow us to analyze systems that were out of reach in earlier approaches. Finally, we demonstrate the feasibility of our approach in a prototype implementation.
14
Balanced multi-perspective checking of process conformance
Felix Mannhardt, Massimiliano de Leoni, Hajo A. Reijers et al. · Computing · 2015 · 214 citations · Full text
Business, Information Systems, Business Process Management +10
Predicate Abstraction of ANSI-C Programs Using SAT
Edmund M. Clarke, Daniel Kroening, Natasha Sharygina et al. · Formal Methods in System Design · 2004 · 190 citations · Full text