Solving inequalities over finite state machines in the reactive systems design

zbMATH Open1472.68078MaRDI QIDQ5147341FDOQ5147341

Authors: A. N. Chebotarev 

Publication date: 26 January 2021

Full work available at URL: http://mathnet.ru/eng/pdm236

Recommendations

• Design of reactive algorithms by solving equations over automata
• Progressive Solutions to FSM Equations
• Compositionally progressive solutions of synchronous FSM equations
• Compositional approach to the development of reactive algorithms
• Describing progressive solutions to a parallel FSM equation

zbMATH Keywords

maximal solutionreactive system\( \Sigma \)-automatoninequality over \(\Sigma \)-automatalanguage \(L\) specificationsynchronous composition of \(\Sigma \)-automata

Mathematics Subject Classification ID

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

Cites Work

• Interacting automata
• Title not available (Why is that?)
• Approach to functional specification of automaton systems. I
• Inductive synthesis of an automaton from its specification in the logical language \({\mathfrak L}\)
• Progressive solutions to a parallel automata equation
• Approximation of sets of superwords by \(L\)-language formulas

Cited In (1)

• Design of reactive algorithms by solving equations over automata

This page was built for publication: Solving inequalities over finite state machines in the reactive systems design

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