From languages to behaviors and back

DOI10.1007/978-3-031-15629-8_11MaRDI QIDQ6163885zbMATH OpenFDO

Authors Markus Frohme, Bernhard Steffen

Publication date 26 July 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-15629-8_11

zbMATH Keywords

active automata learningbehaviorcontext-free languagesinstrumentationprocedural systems

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A Context-Free Symbiosis of Runtime Verification and Automata Learning
• Compositional automata learning of synchronous systems
• Never-stop context-free learning
• Learning deterministic probabilistic automata from a model checking perspective
• Automata learning with automated alphabet abstraction refinement

Cites work

• Automata Learning through Counterexample Guided Abstraction Refinement
• Automata learning with automated alphabet abstraction refinement
• Automata, Languages and Programming
• Domain-specific optimization in automata learning.
• scientific article; zbMATH DE number 2087532 (Why is no real title available?)
• Improving active Mealy machine learning for protocol conformance testing
• Learning I/O automata
• Learning register automata with fresh value generation
• Learning register automata: from languages to program structures
• Learning regular sets from queries and counterexamples
• Minimization, Learning, and Conformance Testing of Boolean Programs
• Never-stop context-free learning
• Visibly pushdown languages

This page was built for publication: From languages to behaviors and back

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163885)