View in EDS PDF Full Text

Best Fairness Hierarchy in Elementary Nets.

Saved in:
Bibliographic Details
Title: Best Fairness Hierarchy in Elementary Nets.
Authors: Ochmanski, Edward1 edoch@mat.uni.torun.pl
Source: Fundamenta Informaticae. Apr2004, Vol. 60 Issue 1-4, p237-250. 14p. 7 Diagrams.
Subjects: Computer multitasking, Sequential processing (Computer science), Electronic data processing, Computer programming, Nets (Mathematics)
Abstract: The fairness hierarchy and conspiracies, the notions introduced by Best, are studied in the context of elementary nets. Proving that sequential as well as persistent systems are conspiracy-free, we indicate two main roots of conspiracies: distributed memory and conflicts. Using the notion of marking-fairness, due to Merceron, we prove that T0-fairness + M0-fairness = T∞-fairness. This result gives a method of a local control ensuring globally fair executions. Next we show how to check, if a given elementary net is conspiracy-free, and prove the obtained criterion to be effectively decidable. Finally, we give a characterization of live concurrent systems, using the notion of ∞-fairness. [ABSTRACT FROM AUTHOR]
Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 13974821
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Best Fairness Hierarchy in Elementary Nets.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Ochmanski%2C+Edward%22">Ochmanski, Edward</searchLink><relatesTo>1</relatesTo><i> edoch@mat.uni.torun.pl</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Fundamenta+Informaticae%22">Fundamenta Informaticae</searchLink>. Apr2004, Vol. 60 Issue 1-4, p237-250. 14p. 7 Diagrams.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Computer+multitasking%22">Computer multitasking</searchLink><br /><searchLink fieldCode="DE" term="%22Sequential+processing+%28Computer+science%29%22">Sequential processing (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+data+processing%22">Electronic data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Nets+%28Mathematics%29%22">Nets (Mathematics)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The fairness hierarchy and conspiracies, the notions introduced by Best, are studied in the context of elementary nets. Proving that sequential as well as persistent systems are conspiracy-free, we indicate two main roots of conspiracies: distributed memory and conflicts. Using the notion of marking-fairness, due to Merceron, we prove that T0-fairness + M0-fairness = T∞-fairness. This result gives a method of a local control ensuring globally fair executions. Next we show how to check, if a given elementary net is conspiracy-free, and prove the obtained criterion to be effectively decidable. Finally, we give a characterization of live concurrent systems, using the notion of ∞-fairness. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=13974821
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 14
        StartPage: 237
    Subjects:
      – SubjectFull: Computer multitasking
        Type: general
      – SubjectFull: Sequential processing (Computer science)
        Type: general
      – SubjectFull: Electronic data processing
        Type: general
      – SubjectFull: Computer programming
        Type: general
      – SubjectFull: Nets (Mathematics)
        Type: general
    Titles:
      – TitleFull: Best Fairness Hierarchy in Elementary Nets.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Ochmanski, Edward
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr2004
              Type: published
              Y: 2004
          Identifiers:
            – Type: issn-print
              Value: 01692968
          Numbering:
            – Type: volume
              Value: 60
            – Type: issue
              Value: 1-4
          Titles:
            – TitleFull: Fundamenta Informaticae
              Type: main
ResultId 1