A note on fairness in I O automata:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Amsterdam
1995
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
95,79 |
| Schlagwörter: | |
| Abstract: | Abstract: "Notions of weak and strong fairness are studied in the setting of the I/O automaton model of Lynch & Tuttle. The concept of a fair I/O automaton is introduced and it is shown that a fair I/O automaton paired with the set of its fair executions is a live I/O automaton provided that (1) in each reachable state at most countably many fairness sets are enabled, and (2) input actions cannot disable strong fairness sets. This result, which generalizes previous results known from the literature, was needed to solve a problem posed by Broy & Lamport for the Dagstuhl Workshop on Reactive Systems." |
| Umfang: | 8 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011065166 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 961118s1995 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)35649310 | ||
| 035 | |a (DE-599)BVBBV011065166 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Romijn, Judi M. T. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A note on fairness in I O automata |c J. M. T. Romijn ; F. W. Vaandrager |
| 264 | 1 | |a Amsterdam |c 1995 | |
| 300 | |a 8 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 95,79 | |
| 520 | 3 | |a Abstract: "Notions of weak and strong fairness are studied in the setting of the I/O automaton model of Lynch & Tuttle. The concept of a fair I/O automaton is introduced and it is shown that a fair I/O automaton paired with the set of its fair executions is a live I/O automaton provided that (1) in each reachable state at most countably many fairness sets are enabled, and (2) input actions cannot disable strong fairness sets. This result, which generalizes previous results known from the literature, was needed to solve a problem posed by Broy & Lamport for the Dagstuhl Workshop on Reactive Systems." | |
| 650 | 4 | |a Computer input-output equipment | |
| 650 | 4 | |a Computer multitasking | |
| 700 | 1 | |a Vaandrager, Frits W. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 95,79 |w (DE-604)BV008928356 |9 95,79 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007411033 | |
Datensatz im Suchindex
| _version_ | 1818953401477627904 |
|---|---|
| any_adam_object | |
| author | Romijn, Judi M. T. Vaandrager, Frits W. |
| author_facet | Romijn, Judi M. T. Vaandrager, Frits W. |
| author_role | aut aut |
| author_sort | Romijn, Judi M. T. |
| author_variant | j m t r jmt jmtr f w v fw fwv |
| building | Verbundindex |
| bvnumber | BV011065166 |
| ctrlnum | (OCoLC)35649310 (DE-599)BVBBV011065166 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01653nam a2200301 cb4500</leader><controlfield tag="001">BV011065166</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">961118s1995 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35649310</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011065166</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Romijn, Judi M. T.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A note on fairness in I O automata</subfield><subfield code="c">J. M. T. Romijn ; F. W. Vaandrager</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">95,79</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Notions of weak and strong fairness are studied in the setting of the I/O automaton model of Lynch & Tuttle. The concept of a fair I/O automaton is introduced and it is shown that a fair I/O automaton paired with the set of its fair executions is a live I/O automaton provided that (1) in each reachable state at most countably many fairness sets are enabled, and (2) input actions cannot disable strong fairness sets. This result, which generalizes previous results known from the literature, was needed to solve a problem posed by Broy & Lamport for the Dagstuhl Workshop on Reactive Systems."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer input-output equipment</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer multitasking</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vaandrager, Frits W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">95,79</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">95,79</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007411033</subfield></datafield></record></collection> |
| id | DE-604.BV011065166 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T10:05:41Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007411033 |
| oclc_num | 35649310 |
| open_access_boolean | |
| physical | 8 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Romijn, Judi M. T. Verfasser aut A note on fairness in I O automata J. M. T. Romijn ; F. W. Vaandrager Amsterdam 1995 8 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,79 Abstract: "Notions of weak and strong fairness are studied in the setting of the I/O automaton model of Lynch & Tuttle. The concept of a fair I/O automaton is introduced and it is shown that a fair I/O automaton paired with the set of its fair executions is a live I/O automaton provided that (1) in each reachable state at most countably many fairness sets are enabled, and (2) input actions cannot disable strong fairness sets. This result, which generalizes previous results known from the literature, was needed to solve a problem posed by Broy & Lamport for the Dagstuhl Workshop on Reactive Systems." Computer input-output equipment Computer multitasking Vaandrager, Frits W. Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 95,79 (DE-604)BV008928356 95,79 |
| spellingShingle | Romijn, Judi M. T. Vaandrager, Frits W. A note on fairness in I O automata Computer input-output equipment Computer multitasking |
| title | A note on fairness in I O automata |
| title_auth | A note on fairness in I O automata |
| title_exact_search | A note on fairness in I O automata |
| title_full | A note on fairness in I O automata J. M. T. Romijn ; F. W. Vaandrager |
| title_fullStr | A note on fairness in I O automata J. M. T. Romijn ; F. W. Vaandrager |
| title_full_unstemmed | A note on fairness in I O automata J. M. T. Romijn ; F. W. Vaandrager |
| title_short | A note on fairness in I O automata |
| title_sort | a note on fairness in i o automata |
| topic | Computer input-output equipment Computer multitasking |
| topic_facet | Computer input-output equipment Computer multitasking |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT romijnjudimt anoteonfairnessinioautomata AT vaandragerfritsw anoteonfairnessinioautomata |