Reachability, confluence, and termination analysis with state-compatible automata. Felgenhauer, B. & Thiemann, R. Inf. Comput., 253:467-483, 2017. Link Paper bibtex @article{journals/iandc/FelgenhauerT17,
added-at = {2020-02-04T00:00:00.000+0100},
author = {Felgenhauer, Bertram and Thiemann, René},
biburl = {https://www.bibsonomy.org/bibtex/237453c6b1feecd4207a284cd0b1bc353/dblp},
ee = {https://doi.org/10.1016/j.ic.2016.06.011},
interhash = {72fe6390cb55507d38803a60fa6ba8eb},
intrahash = {37453c6b1feecd4207a284cd0b1bc353},
journal = {Inf. Comput.},
keywords = {dblp},
pages = {467-483},
timestamp = {2020-02-05T11:44:38.000+0100},
title = {Reachability, confluence, and termination analysis with state-compatible automata.},
url = {http://dblp.uni-trier.de/db/journals/iandc/iandc253.html#FelgenhauerT17},
volume = 253,
year = 2017
}
Downloads: 0
{"_id":"rdgzhjfnQECJEAxEw","bibbaseid":"felgenhauer-thiemann-reachabilityconfluenceandterminationanalysiswithstatecompatibleautomata-2017","authorIDs":[],"author_short":["Felgenhauer, B.","Thiemann, R."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-02-04T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Felgenhauer"],"firstnames":["Bertram"],"suffixes":[]},{"propositions":[],"lastnames":["Thiemann"],"firstnames":["René"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/237453c6b1feecd4207a284cd0b1bc353/dblp","ee":"https://doi.org/10.1016/j.ic.2016.06.011","interhash":"72fe6390cb55507d38803a60fa6ba8eb","intrahash":"37453c6b1feecd4207a284cd0b1bc353","journal":"Inf. Comput.","keywords":"dblp","pages":"467-483","timestamp":"2020-02-05T11:44:38.000+0100","title":"Reachability, confluence, and termination analysis with state-compatible automata.","url":"http://dblp.uni-trier.de/db/journals/iandc/iandc253.html#FelgenhauerT17","volume":"253","year":"2017","bibtex":"@article{journals/iandc/FelgenhauerT17,\n added-at = {2020-02-04T00:00:00.000+0100},\n author = {Felgenhauer, Bertram and Thiemann, René},\n biburl = {https://www.bibsonomy.org/bibtex/237453c6b1feecd4207a284cd0b1bc353/dblp},\n ee = {https://doi.org/10.1016/j.ic.2016.06.011},\n interhash = {72fe6390cb55507d38803a60fa6ba8eb},\n intrahash = {37453c6b1feecd4207a284cd0b1bc353},\n journal = {Inf. Comput.},\n keywords = {dblp},\n pages = {467-483},\n timestamp = {2020-02-05T11:44:38.000+0100},\n title = {Reachability, confluence, and termination analysis with state-compatible automata.},\n url = {http://dblp.uni-trier.de/db/journals/iandc/iandc253.html#FelgenhauerT17},\n volume = 253,\n year = 2017\n}\n\n","author_short":["Felgenhauer, B.","Thiemann, R."],"key":"journals/iandc/FelgenhauerT17","id":"journals/iandc/FelgenhauerT17","bibbaseid":"felgenhauer-thiemann-reachabilityconfluenceandterminationanalysiswithstatecompatibleautomata-2017","role":"author","urls":{"Link":"https://doi.org/10.1016/j.ic.2016.06.011","Paper":"http://dblp.uni-trier.de/db/journals/iandc/iandc253.html#FelgenhauerT17"},"keyword":["dblp"],"downloads":0},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Bertram?items=1000","creationDate":"2020-08-03T18:34:52.540Z","downloads":0,"keywords":["dblp"],"search_terms":["reachability","confluence","termination","analysis","state","compatible","automata","felgenhauer","thiemann"],"title":"Reachability, confluence, and termination analysis with state-compatible automata.","year":2017,"dataSources":["fYGRSD8HXJYwZPaY7"]}