Entry Hennessy:1995:SB 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{Hennessy:1995:SB,
  author =       "M. Hennessy and H. Lin",
  title =        "Symbolic bisimulations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "138",
  number =       "2",
  pages =        "353--389",
  day =          "20",
  month =        feb,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:51 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=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=1995&volume=138&issue=2&aid=1806",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210L (Formal
                 languages and computational linguistics)",
  conflocation = "Oxford, UK; April 1992",
  conftitle =    "Mathematical Foundations of Programming Semantics",
  corpsource =   "Sch. of Cognitive and Comput. Sci., Sussex Univ.,
                 Brighton, UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "arbitrary finite symbolic trees; bisimulation
                 equivalence; Boolean algebra; Boolean expressions;
                 finite symbolic transition graphs; formal languages;
                 graph theory; infinite value set; labelled transition
                 graph; labelled transitions graph; operational
                 semantics; process algebra; symbolic actions; symbolic
                 bisimulations; symbolic transition graph; symbolic
                 transition graphs; value passing process languages",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries