Model Checking of Non-Finite State Processes by Finite Approximations
No abstract available.
Related papers
- Timed Automata Verification and Synthesis via Finite Automata Learning TACAS 2023
- Data Flow Analysis of Communicating Finite State Machines TOPLAS 1991
- An Automaton Learning Approach to Solving Safety Games over Infinite Graphs TACAS 2016
- Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results TOPLAS 1999
- Property Checking Array Programs Using Loop Shrinking TACAS 2018
- CTL* Model Checking on Infinite Families of Finite-State Labeled Transition Systems TACAS 2026
- FAUST 2 : Formal Abstractions of Uncountable-STate STochastic Processes TACAS 2015
- Symmetry Reduction for the Local Mu-Calculus TACAS 2018