Design of reactive algorithms by solving equations over automata

The problem of solving inequalities over finite state machines (FSMs) is considered. This problem arises in the compositional approach to the design of reactive systems. The problem is formulated and solved at the level of FSM specifications in the logical language L. It is shown how to compute the...

Full description

Saved in:
Bibliographic Details
Published in:Cybernetics and systems analysis Vol. 48; no. 4; pp. 479 - 488
Main Author: Chebotarev, A. N.
Format: Journal Article
Language:English
Published: Boston Springer US 01.07.2012
Springer
Springer Nature B.V
Subjects:
Algorithms
Artificial Intelligence
Automation
Control
Control systems
Cybernetics
Design engineering
Finite state machines
Inequalities
Language
Mathematical analysis
Mathematics
Mathematics and Statistics
Processor Architectures
Programming languages
Robots
Semantics
Software Engineering/Programming and Operating Systems
Specifications
Studies
Synchronous
Systems Theory
Ukraine
synchronous composition of Σ-FSMs
inequality over Σ-FSMs
Σ-FSM
maximal solution
eactive system
specification in the language L
ISSN:1060-0396, 1573-8337
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem of solving inequalities over finite state machines (FSMs) is considered. This problem arises in the compositional approach to the design of reactive systems. The problem is formulated and solved at the level of FSM specifications in the logical language L. It is shown how to compute the maximal solution to an inequality with respect to the operation of synchronous composition of FSMs.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-012-9427-6