\textsc {Reach} on Register Automata via History Independence
From MaRDI portal
Publication:6487290
Recommendations
Cites work
- scientific article; zbMATH DE number 1973375 (Why is no real title available?)
- scientific article; zbMATH DE number 7559500 (Why is no real title available?)
- $$\textsc {Reach}$$ on Register Automata via History Independence
- A Succinct Canonical Register Automaton Model
- A succinct canonical register automaton model for data domains with binary relations
- A taxonomy and reductions for common register automata formalisms
- Abstraction refinement for emptiness checking of alternating data automata
- An axiomatic basis for computer programming
- Automata Learning through Counterexample Guided Abstraction Refinement
- Automata theory in nominal sets
- Benchmarks for automata learning and conformance testing
- Finite automata over infinite alphabets: two models with transitions for local change
- Finite-memory automata
- Grey-Box Learning of Register Automata
- Intractability of decision problems for finite-memory automata
- LTL with the freeze quantifier and register automata
- Reachability in pushdown register automata
- Reachability in pushdown register automata
- Register automata with linear arithmetic
- SMT-based generation of symbolic automata
- Symbolic register automata
- \(\mathbb {N}\)-memory automata over the alphabet \(\mathbb {N}\)
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)
