\textsc {Reach} on Register Automata via History Independence
From MaRDI portal
Publication:6487290
DOI10.1007/978-3-031-09827-7_2zbMATH Open1514.68097MaRDI QIDQ6487290FDOQ6487290
Authors: Simon Dierl, Falk Howar 
Publication date: 7 December 2022
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- LTL with the freeze quantifier and register automata
- An axiomatic basis for computer programming
- Finite-memory automata
- A Succinct Canonical Register Automaton Model
- Automata Learning through Counterexample Guided Abstraction Refinement
- A succinct canonical register automaton model for data domains with binary relations
- A taxonomy and reductions for common register automata formalisms
- Intractability of decision problems for finite-memory automata
- Automata theory in nominal sets
- Reachability in pushdown register automata
- Benchmarks for automata learning and conformance testing
- Grey-Box Learning of Register Automata
- Reachability in pushdown register automata
- Register automata with linear arithmetic
- Symbolic register automata
- SMT-based generation of symbolic automata
- Abstraction refinement for emptiness checking of alternating data automata
- Finite automata over infinite alphabets: two models with transitions for local change
- \(\mathbb {N}\)-memory automata over the alphabet \(\mathbb {N}\)
- Title not available (Why is that?)
- $$\textsc {Reach}$$ on Register Automata via History Independence
Cited In (7)
- Register automata with linear arithmetic
- On-the-fly bisimilarity checking for fresh-register automata
- Verification of dynamic register automata
- History-register automata
- $$\textsc {Reach}$$ on Register Automata via History Independence
- A taxonomy and reductions for common register automata formalisms
- History-register automata
This page was built for publication: $$\textsc {Reach}$$ on Register Automata via History Independence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487290)
