1994
DOI: 10.1137/s0363012991217536
|View full text |Cite
|
Sign up to set email alerts
|

Control of Infinite Behavior of Finite Automata

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
57
0

Year Published

1995
1995
2019
2019

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 96 publications
(57 citation statements)
references
References 23 publications
0
57
0
Order By: Relevance
“…One key characteristic of such logics is that they are declarative and involve simple syntax and semantics. Although mostly used in the verification of concurrent systems, temporal logics have been applied to supervisory control theory (e.g., [21], [26], [27], [32], [33], [41] for linear temporal logic frameworks and [5] for a branching temporal logic framework). Real-time interval logics have also been used in the verification of control systems (e.g., [38]).…”
Section: Introductionmentioning
confidence: 99%
“…One key characteristic of such logics is that they are declarative and involve simple syntax and semantics. Although mostly used in the verification of concurrent systems, temporal logics have been applied to supervisory control theory (e.g., [21], [26], [27], [32], [33], [41] for linear temporal logic frameworks and [5] for a branching temporal logic framework). Real-time interval logics have also been used in the verification of control systems (e.g., [38]).…”
Section: Introductionmentioning
confidence: 99%
“…For treating liveness goals, supervisory controller synthesis literature commonly represents the "legal" specification language as a deterministic Rabin automaton. The problem of synthesis boils down to force that automata to accepts its language [26]. This disallows the use of adhoc procedures for logic fragments like we do for GR [22].…”
Section: Discussion and Related Workmentioning
confidence: 99%
“…The language generated by is denoted by ( ) [102]. Language is defined as the set of all possible trajectories over ∑.…”
Section: Mathematical Backgroundmentioning
confidence: 99%
“…We will use the following notations in our work: The set of all possible infinite strings/trajectories of is denoted by ( ) [19,102]. For a string ∈ ( ), we denote the set of all its prefixes by ( ).…”
Section: =Dl(obs( )) Of Examplementioning
confidence: 99%