Learning realtime one-counter automata
From MaRDI portal
Publication:6535566
DOI10.1007/978-3-030-99524-9_13zbMATH Open1547.68284MaRDI QIDQ6535566FDOQ6535566
Authors: Véronique Bruyère, G. A. Pérez, Gaëtan Staquet
Publication date: 23 January 2024
Recommendations
Cites Work
- Title not available (Why is that?)
- Learning regular sets from queries and counterexamples
- Generating models of infinite-state communication protocols using regular inference with abstraction
- Programs with lists are counter automata
- Inference of finite automata using homing sequences
- Deterministic one-counter automata
- Title not available (Why is that?)
- Grey-Box Learning of Register Automata
- Active learning of sequential transducers with side information about the domain
- Learning deterministic automata on infinite words
- One-counter automata with counter observability
- Adaptive Model Checking
- Bisimulation equivalence and regularity for real-time one-counter automata
- Negation-closure for JSON schema
- Efficient learning of real time one-counter automata
Cited In (1)
This page was built for publication: Learning realtime one-counter automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535566)