@inproceedings{conf/fmcad/BrimCMS04,
  author = {Brim, Lubos and Cerná, Ivana and Moravec, Pavel and Simsa, Jirí},
  booktitle = {FMCAD},
  crossref = {conf/fmcad/2004},
  editor = {Hu, Alan J. and Martin, Andrew K.},
  ee = {http://dx.doi.org/10.1007/978-3-540-30494-4_25},
  interhash = {d29a81034207857f9c9e5e94674e1276},
  intrahash = {f46c670cda53e0c6574462b0acd3150e},
  isbn = {3-540-23738-0},
  pages = {352-366},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Accepting Predecessors Are Better than Back Edges in Distributed LTL Model-Checking.},
  url = {http://dblp.uni-trier.de/db/conf/fmcad/fmcad2004.html#BrimCMS04},
  volume = 3312,
  year = 2004
}

{"_id":"nSXBdSnmmKAWbC5jF","bibbaseid":"brim-cern-moravec-simsa-acceptingpredecessorsarebetterthanbackedgesindistributedltlmodelchecking-2004","downloads":0,"creationDate":"2017-04-26T09:41:24.138Z","title":"Accepting Predecessors Are Better than Back Edges in Distributed LTL Model-Checking.","author_short":["Brim, L.","Cerná, I.","Moravec, P.","Simsa, J."],"year":2004,"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/Lubos Brim?items=1000","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Brim"],"firstnames":["Lubos"],"suffixes":[]},{"propositions":[],"lastnames":["Cerná"],"firstnames":["Ivana"],"suffixes":[]},{"propositions":[],"lastnames":["Moravec"],"firstnames":["Pavel"],"suffixes":[]},{"propositions":[],"lastnames":["Simsa"],"firstnames":["Jirí"],"suffixes":[]}],"booktitle":"FMCAD","crossref":"conf/fmcad/2004","editor":[{"propositions":[],"lastnames":["Hu"],"firstnames":["Alan","J."],"suffixes":[]},{"propositions":[],"lastnames":["Martin"],"firstnames":["Andrew","K."],"suffixes":[]}],"ee":"http://dx.doi.org/10.1007/978-3-540-30494-4_25","interhash":"d29a81034207857f9c9e5e94674e1276","intrahash":"f46c670cda53e0c6574462b0acd3150e","isbn":"3-540-23738-0","pages":"352-366","publisher":"Springer","series":"Lecture Notes in Computer Science","title":"Accepting Predecessors Are Better than Back Edges in Distributed LTL Model-Checking.","url":"http://dblp.uni-trier.de/db/conf/fmcad/fmcad2004.html#BrimCMS04","volume":"3312","year":"2004","bibtex":"@inproceedings{conf/fmcad/BrimCMS04,\n author = {Brim, Lubos and Cerná, Ivana and Moravec, Pavel and Simsa, Jirí},\n booktitle = {FMCAD},\n crossref = {conf/fmcad/2004},\n editor = {Hu, Alan J. and Martin, Andrew K.},\n ee = {http://dx.doi.org/10.1007/978-3-540-30494-4_25},\n interhash = {d29a81034207857f9c9e5e94674e1276},\n intrahash = {f46c670cda53e0c6574462b0acd3150e},\n isbn = {3-540-23738-0},\n pages = {352-366},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n title = {Accepting Predecessors Are Better than Back Edges in Distributed LTL Model-Checking.},\n url = {http://dblp.uni-trier.de/db/conf/fmcad/fmcad2004.html#BrimCMS04},\n volume = 3312,\n year = 2004\n}\n\n","author_short":["Brim, L.","Cerná, I.","Moravec, P.","Simsa, J."],"editor_short":["Hu, A. J.","Martin, A. K."],"key":"conf/fmcad/BrimCMS04","id":"conf/fmcad/BrimCMS04","bibbaseid":"brim-cern-moravec-simsa-acceptingpredecessorsarebetterthanbackedgesindistributedltlmodelchecking-2004","role":"author","urls":{"Link":"http://dx.doi.org/10.1007/978-3-540-30494-4_25","Paper":"http://dblp.uni-trier.de/db/conf/fmcad/fmcad2004.html#BrimCMS04"},"downloads":0},"search_terms":["accepting","predecessors","better","back","edges","distributed","ltl","model","checking","brim","cerná","moravec","simsa"],"keywords":[],"authorIDs":[],"dataSources":["p3eYfeCrFbWKtvZc8"]}