Regular model checking revisited
From MaRDI portal
Publication:6045028
DOI10.1007/978-3-030-91384-7_6zbMath1522.68332arXiv2005.00990OpenAlexW4206577354MaRDI QIDQ6045028
Anthony Widjaja Lin, Philipp Rümmer
Publication date: 26 May 2023
Published in: Model Checking, Synthesis, and Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.00990
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Elements of finite model theory.
- Learning regular sets from queries and counterexamples
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Logic and \(p\)-recognizable sets of integers
- Finite presentations of infinite structures: Automata and interpretations
- Automata, logics, and infinite games. A guide to current research
- An automaton learning approach to solving safety games over infinite graphs
- Inference of finite automata using homing sequences
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- Regular Symmetry Patterns
- Accelerating tree-automatic relations
- Dafny: An Automatic Program Verifier for Functional Correctness
- Fair Termination for Parameterized Probabilistic Concurrent Systems
- Definable relations and first-order query languages over strings
- Transition Graphs of Rewriting Systems over Unranked Trees
- Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems
- Liveness of Randomised Parameterised Systems under Arbitrary Schedulers
- Transforming structures by set interpretations
- CONCUR 2004 - Concurrency Theory
- Computer Aided Verification
- Automated Technology for Verification and Analysis
- Probabilistic bisimulation for parameterized systems (with applications to verifying anonymous protocols)
This page was built for publication: Regular model checking revisited
