Entry Gouda:1985:PVF from compnetisdn.bib

Last update: Fri Jan 5 02:05:58 MST 2018                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{Gouda:1985:PVF,
  author =       "Mohamed G. Gouda and Ji-Yun Han",
  title =        "Protocol Validation by Fair Progress State
                 Exploration",
  journal =      j-COMP-NET-ISDN,
  volume =       "9",
  number =       "5",
  pages =        "353--361",
  month =        may,
  year =         "1985",
  CODEN =        "CNISE9",
  ISSN =         "0169-7552 (print), 1879-2324 (electronic)",
  ISSN-L =       "0169-7552",
  bibdate =      "Sat Sep 25 23:08:50 MDT 1999",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/compnetisdn.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Austin, Austin, TX, USA",
  classification = "718; 723; 921",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01697552",
  journalabr =   "Comput Networks ISDN Syst",
  keywords =     "automata theory --- Finite Automata; computer
                 networks; decision of node reachability; fair
                 reachability graphs; mathematical techniques --- Graph
                 Theory; validation of protocols",
}

Related entries