Entry Baier:1997:TS from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Baier:1997:TS,
  author =       "Christel Baier",
  title =        "Trees and semantics",
  journal =      j-THEOR-COMP-SCI,
  volume =       "179",
  number =       "1--2",
  pages =        "217--250",
  day =          "01",
  month =        jun,
  year =         "1997",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=179&issue=1-2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=179&issue=1-2&aid=2310",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic)",
  corpsource =   "Fakultat f{\"u}r Math. und Inf., Mannheim Univ.,
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bisimulation equivalence classes; calculus of
                 communicating systems; CCS; derivation trees; domain
                 equation; equivalence classes; fully abstract
                 denotational semantics; infinitely branching trees;
                 metrics; nondeterministic process behaviour modelling;
                 partial order; process algebra; semantic domains; sets;
                 transition system-based operational semantics; trees
                 (mathematics); unbounded nondeterminism",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries