Compositional active learning of synchronizing systems through automated alphabet refinement

DOI10.4230/LIPICS.CONCUR.2025.20MaRDI QIDQ7310291zbMATH OpenFDO

Authors Léo Henry, Mohammad Mousavi, Thomas Neele, Matteo Sammartino

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2025.20

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A new approach for active automata learning based on apartness
• Active learning of deterministic timed automata with Myhill-Nerode style characterization
• Complexity of automaton identification from given data
• Composition and decomposition of multiparty sessions
• Compositional automata learning of synchronous systems
• Compositional learning for interleaving parallel automata
• scientific article; zbMATH DE number 1820085 (Why is no real title available?)
• scientific article; zbMATH DE number 1500652 (Why is no real title available?)
• Learning regular sets from queries and counterexamples
• Model-based testing of reactive systems. Advanced lectures.
• Partial (set) 2-structures. II: State spaces of concurrent systems
• Unique parallel decomposition in branching and weak bisimulation semantics

Cited in

(1)

• Active learning techniques for pomset recognizers

This page was built for publication: Compositional active learning of synchronizing systems through automated alphabet refinement

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