Entry Jategaonkar:1996:DTC 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{Jategaonkar:1996:DTC,
  author =       "Lalita Jategaonkar and Albert R. Meyer",
  title =        "Deciding true concurrency equivalences on safe, finite
                 nets",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "1",
  pages =        "107--143",
  day =          "22",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:40 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&issue=1;
                 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=1996&volume=154&issue=1&aid=2073",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4220 (Automata theory); C4240C (Computational
                 complexity)",
  conflocation = "Lund, Sweden; 5-9 July 1993",
  conftitle =    "ICALP 93. 20th International Colloquium on Automata,
                 Languages and Programming",
  corpsource =   "AT and T Bell Labs., Naperville, IL, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "1- safe; complete; computation theory; computation
                 time; computational complexity; computational
                 complexity bound; decidability; decidable; DEXPTIME;
                 EXPSPACE; finite automata; finite net; finite Petri
                 net; hidden transitions; history-preserving
                 bisimulation; interleaving equivalence; multiprocessing
                 programs; Petri nets; pomset-trace equivalence problem;
                 safe finite nets; true concurrency; true concurrency
                 equivalence",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries