Compositional learning for interleaving parallel automata

DOI10.1007/978-3-031-30829-1_20MaRDI QIDQ6091209zbMATH OpenFDO

Authors Faezeh Labbaf, Jan Friso Groote, Hossein Hojjat, Mohammadreza Mousavi

Publication date 24 November 2023

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

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• Compositional automata learning of synchronous systems
• Learning to complement Büchi automata
• Learning-based compositional parameter synthesis for event-recording automata
• Learning deterministic finite automata from interleaved strings
• Parallel learning of automatic classes of languages
• Parallel learning of automatic classes of languages

Cites work

• A journey from process algebra via timed automata to model learning. Essays dedicated to Frits Vaandrager on the occasion of his 60th birthday
• Benchmarking combinations of learning and testing algorithms for active automata learning
• Efficient active automata learning via mutation testing
• Fundamentals of software engineering. 8th international conference, FSEN 2019, Tehran, Iran, May 1--3, 2019. Revised selected papers
• Grey-Box Learning of Register Automata
• Inference of finite automata using homing sequences
• Learning one-clock timed automata
• Learning register automata: from languages to program structures
• Learning regular sets from queries and counterexamples
• Time to learn -- learning timed automata from tests
• Unique decomposition of processes

Cited in

(2)

• Compositional Synthesis of Piece-Wise Functions by Learning Classifiers
• Compositional automata learning of synchronous systems

This page was built for publication: Compositional learning for interleaving parallel automata

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