Entry Seidel:1995:PCP 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{Seidel:1995:PCP,
  author =       "Karen Seidel",
  title =        "Probabilistic communicating processes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "152",
  number =       "2",
  pages =        "219--249",
  day =          "25",
  month =        dec,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:35 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=152&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=152&issue=2&aid=1920",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  corpsource =   "Comput. Lab., Oxford Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic axiomatisation; communicating sequential
                 processes; conditional probability measures;
                 deterministic properties; fairness; inference
                 mechanisms; infinite traces; probabilistic algorithms;
                 probabilistic algorithms correctness; probabilistic
                 communicating processes; probability measures; proof
                 rules; random algorithms; reasoning;
                 self-stabilisation; self-stabilising token ring;
                 semantic spaces",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries