pdf-format: |
|
@InProceedings{bnneland_et_al:LIPIcs:2019:10925, author = {Frederik Meyer B{\o}nneland and Peter Gj{\o}l Jensen and Kim G. Larsen and Marco Mu{\~n}iz and Jir{\'\i} Srba}, title = {{Partial Order Reduction for Reachability Games}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {23:1--23:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Wan Fokkink and Rob van Glabbeek}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10925}, URN = {urn:nbn:de:0030-drops-109251}, doi = {10.4230/LIPIcs.CONCUR.2019.23}, annote = {Keywords: Petri nets, games, synthesis, partial order reduction, stubborn sets} }
Keywords: | Petri nets, games, synthesis, partial order reduction, stubborn sets | |
Seminar: | 30th International Conference on Concurrency Theory (CONCUR 2019) | |
Issue date: | 2019 | |
Date of publication: | 20.08.2019 |