• DocumentCode
    2038361
  • Title

    The Ordinal Recursive Complexity of Lossy Channel Systems

  • Author

    Chambart, P. ; Schnoebelen, Ph

  • Author_Institution
    LSV, ENS Cachan & CNRS, Cachan
  • fYear
    2008
  • fDate
    24-27 June 2008
  • Firstpage
    205
  • Lastpage
    216
  • Abstract
    We show that reachability and termination for lossy channel systems is exactly at level Fomegaomega in the fast-growing hierarchy of recursive functions, the first level that dominates all multiply-recursive functions.
  • Keywords
    recursive functions; telecommunication channels; lossy channel systems; ordinal recursive complexity; Automata; Computational modeling; Computer science; Logic; Robustness; Size control; Size measurement; Upper bound; Fast-Growing Hierarchy; complexity; lossy channel systems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 2008. LICS '08. 23rd Annual IEEE Symposium on
  • Conference_Location
    Pittsburgh, PA
  • ISSN
    1043-6871
  • Print_ISBN
    978-0-7695-3183-0
  • Type

    conf

  • DOI
    10.1109/LICS.2008.47
  • Filename
    4557912
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2038361