Factorization for component-interaction automata

DOI10.1007/978-3-642-27660-6_45MaRDI QIDQ2891388zbMATH OpenOpenAlexFDO

Authors Nikola Beneš, Filip Štefaňák, I. Černá

Publication date 15 June 2012

Published in SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-27660-6_45

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Factorisation of finite state machines under strong and observational equivalences
• Compositionally progressive solutions of synchronous FSM equations
• Progressive solutions to a parallel automata equation
• Progressive solutions to a parallel automata equation
• Automata-based component composition analysis

Cites work

• A calculus of communicating systems
• FM 2005: Formal Methods
• scientific article; zbMATH DE number 1638655 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Submodule construction as equation solving in CCS
• Synthesis from Component Libraries

Cited in

(1)

• Factorisation of finite state machines under strong and observational equivalences

This page was built for publication: Factorization for component-interaction automata

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