Entry Desel:1993:RCE from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                Valid HTML 4.0!

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{Desel:1993:RCE,
  author =       "J{\"o}rg Desel and Javier Esparza",
  title =        "Reachability in cyclic extended free-choice systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "114",
  number =       "1",
  pages =        "93--118",
  day =          "14",
  month =        jun,
  year =         "1993",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:17:17 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=114&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=114&issue=1&aid=1308",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  conflocation = "Goslar, Germany; 5-8 March 1991",
  conftitle =    "3rd Workshop on Concurrency and Compositionality",
  corpsource =   "Inst. f{\"u}r Inf., Tech. Univ., Munchen, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "boundedness; computational complexity; cyclic extended
                 free-choice systems; cyclicity; decidability; extended
                 free-choice Petri nets; liveness; Petri nets;
                 polynomial algorithm; reachability problem; reachable
                 states; S-invariants; structural characterisation",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries