Design of reactive algorithms by solving equations over automata

DOI10.1007/s10559-012-9427-6zbMath1307.68046OpenAlexW2046836211MaRDI QIDQ2263188

Anatoli N. Chebotarev

Publication date: 18 March 2015

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-012-9427-6

zbMATH Keywords

maximal solutionreactive system\(\Sigma\)-FSMinequality over \(\Sigma\)-FSMsspecification in language Lsynchronous composition of \(\Sigma\)-FSMs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Approximation of sets of superwords by \(L\)-language formulas
• Interacting automata
• Progressive Solutions to a Parallel Automata Equation
• Inductive synthesis of an automaton from its specification in the logical language \({\mathfrak L}\)
• Unnamed Item

This page was built for publication: Design of reactive algorithms by solving equations over automata