Compositional approach to the development of reactive algorithms
DOI10.1007/S10559-013-9552-XzbMATH Open1371.68177OpenAlexW1985977070MaRDI QIDQ465979FDOQ465979
Authors: A. N. Chebotarev 
Publication date: 24 October 2014
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-013-9552-x
Recommendations
language L\(\omega\)-word\(\sigma\)-FSMcompositional specificationdesignation of a statemodule of an algorithmoperation of connecting modules
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Statecharts: a visual formalism for complex systems
- Modular refinement of hierarchic reactive machines
- Improved method of synthesis of an automaton from its specification in the language \(L\)
- On an approach to functional specification of automata systems. III
- On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines
- Title not available (Why is that?)
Cited In (6)
- Title not available (Why is that?)
- Solving inequalities over finite state machines in the reactive systems design
- On transcendental functions arising from integrating differential equations in finite terms
- Design of reactive algorithms by solving equations over automata
- Harmonization of interacting automata
- Generating FSMs from interworkings
This page was built for publication: Compositional approach to the development of reactive algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q465979)
