Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Detectability of finite-state automata
KTH, School of Electrical Engineering and Computer Science (EECS), Centres, ACCESS Linnaeus Centre.
2020 (English)In: Communications and Control Engineering, Springer International Publishing , 2020, p. 179-192Chapter in book (Refereed)
Abstract [en]

A finite-state automaton (FSA) (see Sect. 2.3) is obtained from a standard nondeterministic finite automaton (NFA, see Sect. 1.3) by removing all accepting states and also replacing the unique initial state by a set of initial states. Such a modification can be used to better describe discrete-event systems (DESs) (Wonham and Cai 2019; Cassandras and Lafortune 2010). DESs usually refer to as event-driven processes that cannot be described by differential equations, where the latter usually represent time-driven processes. The FSA-based DESs are usually simple and many properties of FSAs are decidable, so FSAs are rather welcome in engineering-oriented studies. However, despite being simple, FSAs can also perform many good properties that are of both theoretical and practical importance. During the past three decades, plenty of properties and their verification or synthesis techniques on DESs in the framework of FSAs have been proposed and developed, e.g., controllability and observability (The notion of observability in the supervisory control framework is totally different from that studied in this book (see Chaps. 4, 5, 7).) (Ramadge and Wonham 1987; Ramadge 1986; Lin and Wonham 1988), diagnosability (Lin 1994; Sampath 1995), detectability (Shu et al. 2007; Shu and Lin 2011; Zhang 2017), opacity (Saboori and Hadjicostis 2014, 2012, 2011, 2013; Lin 2011), etc., where controllability and observability are defined on formal languages, diagnosability is defined on events, but the others are defined on states (except for that the result of Lin (2011) is defined on formal languages).

Place, publisher, year, edition, pages
Springer International Publishing , 2020. p. 179-192
Keywords [en]
Differential equations, Discrete event simulation, Finite automata, Formal languages, Observability, Controllability and observabilities, Diagnosability, Engineering-oriented, Initial state, Nondeterministic finite automaton, Practical importance, Supervisory control, Synthesis techniques, Pipeline processing systems
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-263445DOI: 10.1007/978-3-030-25972-3_9Scopus ID: 2-s2.0-85070561505OAI: oai:DiVA.org:kth-263445DiVA, id: diva2:1375999
Note

QC 20191206

Available from: 2019-12-06 Created: 2019-12-06 Last updated: 2019-12-06Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Zhang, Kuize

Search in DiVA

By author/editor
Zhang, Kuize
By organisation
ACCESS Linnaeus Centre
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 44 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf