Design of reactive algorithms by solving equations over automata

DOI10.1007/S10559-012-9427-6MaRDI QIDQ2263188zbMATH OpenOpenAlexFDO

Authors A. 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

\(\Sigma\)-FSMinequality over \(\Sigma\)-FSMsmaximal solutionreactive systemspecification 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)

Recommendations

• Solving inequalities over finite state machines in the reactive systems design
• scientific article; zbMATH DE number 2000429
• Algebraic specification of reactive systems
• Reactive automata
• The automata-theoretic approach to verification of reactive systems
• Reaction automata
• Theory of reaction automata: a survey
• scientific article; zbMATH DE number 1638655
• Compositional approach to the development of reactive algorithms
• Progressive solutions to a parallel automata equation

Cites work

• Approximation of sets of superwords by L-language formulas
• scientific article; zbMATH DE number 3930354 (Why is no real title available?)
• Inductive synthesis of an automaton from its specification in the logical language \({\mathfrak L}\)
• Interacting automata
• Progressive solutions to a parallel automata equation

Cited in

(4)

• Compositionally progressive solutions of synchronous FSM equations
• Progressive Solutions to FSM Equations
• Describing progressive solutions to a parallel FSM equation
• Solving inequalities over finite state machines in the reactive systems design

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

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