Logic in Computer Science (LICS 2000)

Paper: Precongruence Formats for Decorated Trace Preorders (at LICS 2000)

Authors: Bard Bloom Wan Fokkink Rob Van Glabbeek

Abstract

This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labeled transition systems, and formats of transition system specifications using Plotkin's structural approach. For several preorders in the linear time - branching time spectrum a format is given, as general as possible, such that this preorder is a precongruence for all operators specifiable in that format. The formats are derived using the modal characterizations of the corresponding preorders.

BibTeX

  @InProceedings{BloomFokkinkVanGlab-PrecongruenceFormat,
    author = 	 {Bard Bloom and Wan Fokkink and Rob Van Glabbeek},
    title = 	 {Precongruence Formats for Decorated Trace Preorders},
    booktitle =  {Proceedings of the Fifteenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 2000},
    year =	 2000,
    editor =	 {Martin Abadi},
    month =	 {June}, 
    pages =      {107--118},
    location =   {Santa Barbara, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }