Synthesis of Σ-Automata Specified in the First Order Logical Languages LP and LF

Synthesis of Σ-Automata Specified in the First Order Logical Languages LP and LF

This paper presents methods for synthesizing Σ-automata from specifications in the language LP with deterministic semantics and in the language LF with nondeterministic semantics. These methods are based on the equivalent transformation of a formula of the form ∀ tF ( t ) into the so-called normal f...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Cybernetics and systems analysis 2018-07, Vol.54 (4), p.527-540
1. Verfasser: Chebotarev, A. N.
Format: Artikel
Sprache:eng
Schlagworte:
Artificial Intelligence
Control
Mathematics
Mathematics and Statistics
Processor Architectures
Semantics
Software Engineering/Programming and Operating Systems
Systems Theory
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents methods for synthesizing Σ-automata from specifications in the language LP with deterministic semantics and in the language LF with nondeterministic semantics. These methods are based on the equivalent transformation of a formula of the form ∀ tF ( t ) into the so-called normal form whose structure corresponds to the state transition graph of a specified Σ-automaton.
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-018-0054-8