Computing observers from observation policies in discrete-event systems
Abstract This paper considers partially-observed discrete-event systems modeled by finite-state automata. The observation of event occurrences is associated with the transitions of the automaton model. That is, whether or not an event occurrence is observed is state-dependent, i.e., it depends on th...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Sears, David [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2018 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC, part of Springer Nature 2018 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Discrete event dynamic systems - Springer US, 1991, 28(2018), 4 vom: 17. Sept., Seite 509-537 |
|---|---|
| Übergeordnetes Werk: |
volume:28 ; year:2018 ; number:4 ; day:17 ; month:09 ; pages:509-537 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10626-018-0272-2 |
|---|
| Katalog-ID: |
OLC2027359591 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2027359591 | ||
| 003 | DE-627 | ||
| 005 | 20230503041404.0 | ||
| 007 | tu | ||
| 008 | 200819s2018 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10626-018-0272-2 |2 doi | |
| 035 | |a (DE-627)OLC2027359591 | ||
| 035 | |a (DE-He213)s10626-018-0272-2-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |q VZ |
| 084 | |a 17,1 |2 ssgn | ||
| 100 | 1 | |a Sears, David |e verfasserin |0 (orcid)0000-0002-2054-8327 |4 aut | |
| 245 | 1 | 0 | |a Computing observers from observation policies in discrete-event systems |
| 264 | 1 | |c 2018 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC, part of Springer Nature 2018 | ||
| 520 | |a Abstract This paper considers partially-observed discrete-event systems modeled by finite-state automata. The observation of event occurrences is associated with the transitions of the automaton model. That is, whether or not an event occurrence is observed is state-dependent, i.e., it depends on the transition in which the event label appears. This is in contrast to the case when observations are static and an event is either observed or not observed at every state in which it can occur. We refer to the set of transitions whose associated events are observed as an observation policy. Given an automaton model and an observation policy, we consider the problem of computing a deterministic generator of the language of event sequences that are observed using the automaton model and observation policy (i.e., an observer). Such a generator is useful, e.g., in problems of sensor activation for providing a deterministic mapping from event observations to sensor activation decisions when the decision to activate an event’s sensor is initially modeled as an observation policy. We propose an abstraction of the automaton model that may be used to represent an observer in certain cases. We illustrate cases where this abstraction accurately represents an observer when there is no ambiguity as to which event occurrences are observed following two observationally-identical strings. For the most general case considered, we demonstrate that verifying if the case holds is PSPACE-complete. | ||
| 650 | 4 | |a Discrete event systems | |
| 650 | 4 | |a Partial observation | |
| 650 | 4 | |a Observers | |
| 700 | 1 | |a Rudie, Karen |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Discrete event dynamic systems |d Springer US, 1991 |g 28(2018), 4 vom: 17. Sept., Seite 509-537 |w (DE-627)130988766 |w (DE-600)1079508-X |w (DE-576)029154278 |x 0924-6703 |7 nnns |
| 773 | 1 | 8 | |g volume:28 |g year:2018 |g number:4 |g day:17 |g month:09 |g pages:509-537 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10626-018-0272-2 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 951 | |a AR | ||
| 952 | |d 28 |j 2018 |e 4 |b 17 |c 09 |h 509-537 | ||
| author_variant |
d s ds k r kr |
|---|---|
| matchkey_str |
article:09246703:2018----::optnosresrmbevtoplceid |
| hierarchy_sort_str |
2018 |
| publishDate |
2018 |
| allfields |
10.1007/s10626-018-0272-2 doi (DE-627)OLC2027359591 (DE-He213)s10626-018-0272-2-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Sears, David verfasserin (orcid)0000-0002-2054-8327 aut Computing observers from observation policies in discrete-event systems 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract This paper considers partially-observed discrete-event systems modeled by finite-state automata. The observation of event occurrences is associated with the transitions of the automaton model. That is, whether or not an event occurrence is observed is state-dependent, i.e., it depends on the transition in which the event label appears. This is in contrast to the case when observations are static and an event is either observed or not observed at every state in which it can occur. We refer to the set of transitions whose associated events are observed as an observation policy. Given an automaton model and an observation policy, we consider the problem of computing a deterministic generator of the language of event sequences that are observed using the automaton model and observation policy (i.e., an observer). Such a generator is useful, e.g., in problems of sensor activation for providing a deterministic mapping from event observations to sensor activation decisions when the decision to activate an event’s sensor is initially modeled as an observation policy. We propose an abstraction of the automaton model that may be used to represent an observer in certain cases. We illustrate cases where this abstraction accurately represents an observer when there is no ambiguity as to which event occurrences are observed following two observationally-identical strings. For the most general case considered, we demonstrate that verifying if the case holds is PSPACE-complete. Discrete event systems Partial observation Observers Rudie, Karen aut Enthalten in Discrete event dynamic systems Springer US, 1991 28(2018), 4 vom: 17. Sept., Seite 509-537 (DE-627)130988766 (DE-600)1079508-X (DE-576)029154278 0924-6703 nnns volume:28 year:2018 number:4 day:17 month:09 pages:509-537 https://doi.org/10.1007/s10626-018-0272-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 28 2018 4 17 09 509-537 |
| spelling |
10.1007/s10626-018-0272-2 doi (DE-627)OLC2027359591 (DE-He213)s10626-018-0272-2-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Sears, David verfasserin (orcid)0000-0002-2054-8327 aut Computing observers from observation policies in discrete-event systems 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract This paper considers partially-observed discrete-event systems modeled by finite-state automata. The observation of event occurrences is associated with the transitions of the automaton model. That is, whether or not an event occurrence is observed is state-dependent, i.e., it depends on the transition in which the event label appears. This is in contrast to the case when observations are static and an event is either observed or not observed at every state in which it can occur. We refer to the set of transitions whose associated events are observed as an observation policy. Given an automaton model and an observation policy, we consider the problem of computing a deterministic generator of the language of event sequences that are observed using the automaton model and observation policy (i.e., an observer). Such a generator is useful, e.g., in problems of sensor activation for providing a deterministic mapping from event observations to sensor activation decisions when the decision to activate an event’s sensor is initially modeled as an observation policy. We propose an abstraction of the automaton model that may be used to represent an observer in certain cases. We illustrate cases where this abstraction accurately represents an observer when there is no ambiguity as to which event occurrences are observed following two observationally-identical strings. For the most general case considered, we demonstrate that verifying if the case holds is PSPACE-complete. Discrete event systems Partial observation Observers Rudie, Karen aut Enthalten in Discrete event dynamic systems Springer US, 1991 28(2018), 4 vom: 17. Sept., Seite 509-537 (DE-627)130988766 (DE-600)1079508-X (DE-576)029154278 0924-6703 nnns volume:28 year:2018 number:4 day:17 month:09 pages:509-537 https://doi.org/10.1007/s10626-018-0272-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 28 2018 4 17 09 509-537 |
| allfields_unstemmed |
10.1007/s10626-018-0272-2 doi (DE-627)OLC2027359591 (DE-He213)s10626-018-0272-2-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Sears, David verfasserin (orcid)0000-0002-2054-8327 aut Computing observers from observation policies in discrete-event systems 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract This paper considers partially-observed discrete-event systems modeled by finite-state automata. The observation of event occurrences is associated with the transitions of the automaton model. That is, whether or not an event occurrence is observed is state-dependent, i.e., it depends on the transition in which the event label appears. This is in contrast to the case when observations are static and an event is either observed or not observed at every state in which it can occur. We refer to the set of transitions whose associated events are observed as an observation policy. Given an automaton model and an observation policy, we consider the problem of computing a deterministic generator of the language of event sequences that are observed using the automaton model and observation policy (i.e., an observer). Such a generator is useful, e.g., in problems of sensor activation for providing a deterministic mapping from event observations to sensor activation decisions when the decision to activate an event’s sensor is initially modeled as an observation policy. We propose an abstraction of the automaton model that may be used to represent an observer in certain cases. We illustrate cases where this abstraction accurately represents an observer when there is no ambiguity as to which event occurrences are observed following two observationally-identical strings. For the most general case considered, we demonstrate that verifying if the case holds is PSPACE-complete. Discrete event systems Partial observation Observers Rudie, Karen aut Enthalten in Discrete event dynamic systems Springer US, 1991 28(2018), 4 vom: 17. Sept., Seite 509-537 (DE-627)130988766 (DE-600)1079508-X (DE-576)029154278 0924-6703 nnns volume:28 year:2018 number:4 day:17 month:09 pages:509-537 https://doi.org/10.1007/s10626-018-0272-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 28 2018 4 17 09 509-537 |
| allfieldsGer |
10.1007/s10626-018-0272-2 doi (DE-627)OLC2027359591 (DE-He213)s10626-018-0272-2-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Sears, David verfasserin (orcid)0000-0002-2054-8327 aut Computing observers from observation policies in discrete-event systems 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract This paper considers partially-observed discrete-event systems modeled by finite-state automata. The observation of event occurrences is associated with the transitions of the automaton model. That is, whether or not an event occurrence is observed is state-dependent, i.e., it depends on the transition in which the event label appears. This is in contrast to the case when observations are static and an event is either observed or not observed at every state in which it can occur. We refer to the set of transitions whose associated events are observed as an observation policy. Given an automaton model and an observation policy, we consider the problem of computing a deterministic generator of the language of event sequences that are observed using the automaton model and observation policy (i.e., an observer). Such a generator is useful, e.g., in problems of sensor activation for providing a deterministic mapping from event observations to sensor activation decisions when the decision to activate an event’s sensor is initially modeled as an observation policy. We propose an abstraction of the automaton model that may be used to represent an observer in certain cases. We illustrate cases where this abstraction accurately represents an observer when there is no ambiguity as to which event occurrences are observed following two observationally-identical strings. For the most general case considered, we demonstrate that verifying if the case holds is PSPACE-complete. Discrete event systems Partial observation Observers Rudie, Karen aut Enthalten in Discrete event dynamic systems Springer US, 1991 28(2018), 4 vom: 17. Sept., Seite 509-537 (DE-627)130988766 (DE-600)1079508-X (DE-576)029154278 0924-6703 nnns volume:28 year:2018 number:4 day:17 month:09 pages:509-537 https://doi.org/10.1007/s10626-018-0272-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 28 2018 4 17 09 509-537 |
| allfieldsSound |
10.1007/s10626-018-0272-2 doi (DE-627)OLC2027359591 (DE-He213)s10626-018-0272-2-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Sears, David verfasserin (orcid)0000-0002-2054-8327 aut Computing observers from observation policies in discrete-event systems 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract This paper considers partially-observed discrete-event systems modeled by finite-state automata. The observation of event occurrences is associated with the transitions of the automaton model. That is, whether or not an event occurrence is observed is state-dependent, i.e., it depends on the transition in which the event label appears. This is in contrast to the case when observations are static and an event is either observed or not observed at every state in which it can occur. We refer to the set of transitions whose associated events are observed as an observation policy. Given an automaton model and an observation policy, we consider the problem of computing a deterministic generator of the language of event sequences that are observed using the automaton model and observation policy (i.e., an observer). Such a generator is useful, e.g., in problems of sensor activation for providing a deterministic mapping from event observations to sensor activation decisions when the decision to activate an event’s sensor is initially modeled as an observation policy. We propose an abstraction of the automaton model that may be used to represent an observer in certain cases. We illustrate cases where this abstraction accurately represents an observer when there is no ambiguity as to which event occurrences are observed following two observationally-identical strings. For the most general case considered, we demonstrate that verifying if the case holds is PSPACE-complete. Discrete event systems Partial observation Observers Rudie, Karen aut Enthalten in Discrete event dynamic systems Springer US, 1991 28(2018), 4 vom: 17. Sept., Seite 509-537 (DE-627)130988766 (DE-600)1079508-X (DE-576)029154278 0924-6703 nnns volume:28 year:2018 number:4 day:17 month:09 pages:509-537 https://doi.org/10.1007/s10626-018-0272-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 28 2018 4 17 09 509-537 |
| language |
English |
| source |
Enthalten in Discrete event dynamic systems 28(2018), 4 vom: 17. Sept., Seite 509-537 volume:28 year:2018 number:4 day:17 month:09 pages:509-537 |
| sourceStr |
Enthalten in Discrete event dynamic systems 28(2018), 4 vom: 17. Sept., Seite 509-537 volume:28 year:2018 number:4 day:17 month:09 pages:509-537 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Discrete event systems Partial observation Observers |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Discrete event dynamic systems |
| authorswithroles_txt_mv |
Sears, David @@aut@@ Rudie, Karen @@aut@@ |
| publishDateDaySort_date |
2018-09-17T00:00:00Z |
| hierarchy_top_id |
130988766 |
| dewey-sort |
3510 |
| id |
OLC2027359591 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2027359591</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503041404.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2018 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10626-018-0272-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2027359591</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10626-018-0272-2-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">17,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sears, David</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-2054-8327</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computing observers from observation policies in discrete-event systems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC, part of Springer Nature 2018</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper considers partially-observed discrete-event systems modeled by finite-state automata. The observation of event occurrences is associated with the transitions of the automaton model. That is, whether or not an event occurrence is observed is state-dependent, i.e., it depends on the transition in which the event label appears. This is in contrast to the case when observations are static and an event is either observed or not observed at every state in which it can occur. We refer to the set of transitions whose associated events are observed as an observation policy. Given an automaton model and an observation policy, we consider the problem of computing a deterministic generator of the language of event sequences that are observed using the automaton model and observation policy (i.e., an observer). Such a generator is useful, e.g., in problems of sensor activation for providing a deterministic mapping from event observations to sensor activation decisions when the decision to activate an event’s sensor is initially modeled as an observation policy. We propose an abstraction of the automaton model that may be used to represent an observer in certain cases. We illustrate cases where this abstraction accurately represents an observer when there is no ambiguity as to which event occurrences are observed following two observationally-identical strings. For the most general case considered, we demonstrate that verifying if the case holds is PSPACE-complete.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete event systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Partial observation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Observers</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rudie, Karen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Discrete event dynamic systems</subfield><subfield code="d">Springer US, 1991</subfield><subfield code="g">28(2018), 4 vom: 17. Sept., Seite 509-537</subfield><subfield code="w">(DE-627)130988766</subfield><subfield code="w">(DE-600)1079508-X</subfield><subfield code="w">(DE-576)029154278</subfield><subfield code="x">0924-6703</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:28</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:4</subfield><subfield code="g">day:17</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:509-537</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10626-018-0272-2</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">28</subfield><subfield code="j">2018</subfield><subfield code="e">4</subfield><subfield code="b">17</subfield><subfield code="c">09</subfield><subfield code="h">509-537</subfield></datafield></record></collection>
|
| author |
Sears, David |
| spellingShingle |
Sears, David ddc 510 ssgn 17,1 misc Discrete event systems misc Partial observation misc Observers Computing observers from observation policies in discrete-event systems |
| authorStr |
Sears, David |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)130988766 |
| format |
Article |
| dewey-ones |
510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0924-6703 |
| topic_title |
510 VZ 17,1 ssgn Computing observers from observation policies in discrete-event systems Discrete event systems Partial observation Observers |
| topic |
ddc 510 ssgn 17,1 misc Discrete event systems misc Partial observation misc Observers |
| topic_unstemmed |
ddc 510 ssgn 17,1 misc Discrete event systems misc Partial observation misc Observers |
| topic_browse |
ddc 510 ssgn 17,1 misc Discrete event systems misc Partial observation misc Observers |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Discrete event dynamic systems |
| hierarchy_parent_id |
130988766 |
| dewey-tens |
510 - Mathematics |
| hierarchy_top_title |
Discrete event dynamic systems |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)130988766 (DE-600)1079508-X (DE-576)029154278 |
| title |
Computing observers from observation policies in discrete-event systems |
| ctrlnum |
(DE-627)OLC2027359591 (DE-He213)s10626-018-0272-2-p |
| title_full |
Computing observers from observation policies in discrete-event systems |
| author_sort |
Sears, David |
| journal |
Discrete event dynamic systems |
| journalStr |
Discrete event dynamic systems |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2018 |
| contenttype_str_mv |
txt |
| container_start_page |
509 |
| author_browse |
Sears, David Rudie, Karen |
| container_volume |
28 |
| class |
510 VZ 17,1 ssgn |
| format_se |
Aufsätze |
| author-letter |
Sears, David |
| doi_str_mv |
10.1007/s10626-018-0272-2 |
| normlink |
(ORCID)0000-0002-2054-8327 |
| normlink_prefix_str_mv |
(orcid)0000-0002-2054-8327 |
| dewey-full |
510 |
| title_sort |
computing observers from observation policies in discrete-event systems |
| title_auth |
Computing observers from observation policies in discrete-event systems |
| abstract |
Abstract This paper considers partially-observed discrete-event systems modeled by finite-state automata. The observation of event occurrences is associated with the transitions of the automaton model. That is, whether or not an event occurrence is observed is state-dependent, i.e., it depends on the transition in which the event label appears. This is in contrast to the case when observations are static and an event is either observed or not observed at every state in which it can occur. We refer to the set of transitions whose associated events are observed as an observation policy. Given an automaton model and an observation policy, we consider the problem of computing a deterministic generator of the language of event sequences that are observed using the automaton model and observation policy (i.e., an observer). Such a generator is useful, e.g., in problems of sensor activation for providing a deterministic mapping from event observations to sensor activation decisions when the decision to activate an event’s sensor is initially modeled as an observation policy. We propose an abstraction of the automaton model that may be used to represent an observer in certain cases. We illustrate cases where this abstraction accurately represents an observer when there is no ambiguity as to which event occurrences are observed following two observationally-identical strings. For the most general case considered, we demonstrate that verifying if the case holds is PSPACE-complete. © Springer Science+Business Media, LLC, part of Springer Nature 2018 |
| abstractGer |
Abstract This paper considers partially-observed discrete-event systems modeled by finite-state automata. The observation of event occurrences is associated with the transitions of the automaton model. That is, whether or not an event occurrence is observed is state-dependent, i.e., it depends on the transition in which the event label appears. This is in contrast to the case when observations are static and an event is either observed or not observed at every state in which it can occur. We refer to the set of transitions whose associated events are observed as an observation policy. Given an automaton model and an observation policy, we consider the problem of computing a deterministic generator of the language of event sequences that are observed using the automaton model and observation policy (i.e., an observer). Such a generator is useful, e.g., in problems of sensor activation for providing a deterministic mapping from event observations to sensor activation decisions when the decision to activate an event’s sensor is initially modeled as an observation policy. We propose an abstraction of the automaton model that may be used to represent an observer in certain cases. We illustrate cases where this abstraction accurately represents an observer when there is no ambiguity as to which event occurrences are observed following two observationally-identical strings. For the most general case considered, we demonstrate that verifying if the case holds is PSPACE-complete. © Springer Science+Business Media, LLC, part of Springer Nature 2018 |
| abstract_unstemmed |
Abstract This paper considers partially-observed discrete-event systems modeled by finite-state automata. The observation of event occurrences is associated with the transitions of the automaton model. That is, whether or not an event occurrence is observed is state-dependent, i.e., it depends on the transition in which the event label appears. This is in contrast to the case when observations are static and an event is either observed or not observed at every state in which it can occur. We refer to the set of transitions whose associated events are observed as an observation policy. Given an automaton model and an observation policy, we consider the problem of computing a deterministic generator of the language of event sequences that are observed using the automaton model and observation policy (i.e., an observer). Such a generator is useful, e.g., in problems of sensor activation for providing a deterministic mapping from event observations to sensor activation decisions when the decision to activate an event’s sensor is initially modeled as an observation policy. We propose an abstraction of the automaton model that may be used to represent an observer in certain cases. We illustrate cases where this abstraction accurately represents an observer when there is no ambiguity as to which event occurrences are observed following two observationally-identical strings. For the most general case considered, we demonstrate that verifying if the case holds is PSPACE-complete. © Springer Science+Business Media, LLC, part of Springer Nature 2018 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 |
| container_issue |
4 |
| title_short |
Computing observers from observation policies in discrete-event systems |
| url |
https://doi.org/10.1007/s10626-018-0272-2 |
| remote_bool |
false |
| author2 |
Rudie, Karen |
| author2Str |
Rudie, Karen |
| ppnlink |
130988766 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10626-018-0272-2 |
| up_date |
2024-07-03T15:00:34.123Z |
| _version_ |
1803570469013553152 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2027359591</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503041404.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2018 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10626-018-0272-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2027359591</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10626-018-0272-2-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">17,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sears, David</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-2054-8327</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computing observers from observation policies in discrete-event systems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC, part of Springer Nature 2018</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper considers partially-observed discrete-event systems modeled by finite-state automata. The observation of event occurrences is associated with the transitions of the automaton model. That is, whether or not an event occurrence is observed is state-dependent, i.e., it depends on the transition in which the event label appears. This is in contrast to the case when observations are static and an event is either observed or not observed at every state in which it can occur. We refer to the set of transitions whose associated events are observed as an observation policy. Given an automaton model and an observation policy, we consider the problem of computing a deterministic generator of the language of event sequences that are observed using the automaton model and observation policy (i.e., an observer). Such a generator is useful, e.g., in problems of sensor activation for providing a deterministic mapping from event observations to sensor activation decisions when the decision to activate an event’s sensor is initially modeled as an observation policy. We propose an abstraction of the automaton model that may be used to represent an observer in certain cases. We illustrate cases where this abstraction accurately represents an observer when there is no ambiguity as to which event occurrences are observed following two observationally-identical strings. For the most general case considered, we demonstrate that verifying if the case holds is PSPACE-complete.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete event systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Partial observation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Observers</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rudie, Karen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Discrete event dynamic systems</subfield><subfield code="d">Springer US, 1991</subfield><subfield code="g">28(2018), 4 vom: 17. Sept., Seite 509-537</subfield><subfield code="w">(DE-627)130988766</subfield><subfield code="w">(DE-600)1079508-X</subfield><subfield code="w">(DE-576)029154278</subfield><subfield code="x">0924-6703</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:28</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:4</subfield><subfield code="g">day:17</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:509-537</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10626-018-0272-2</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">28</subfield><subfield code="j">2018</subfield><subfield code="e">4</subfield><subfield code="b">17</subfield><subfield code="c">09</subfield><subfield code="h">509-537</subfield></datafield></record></collection>
|
| score |
7.400977 |