Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Stefan Kiefer and Cas Widdershoven. Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 82:1-82:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{kiefer_et_al:LIPIcs.MFCS.2019.82, author = {Kiefer, Stefan and Widdershoven, Cas}, title = {{Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {82:1--82:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.82}, URN = {urn:nbn:de:0030-drops-110269}, doi = {10.4230/LIPIcs.MFCS.2019.82}, annote = {Keywords: Algorithms, Automata, Markov Chains, Matrix Semigroups} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Krishnendu Chatterjee, Thomas A. Henzinger, and Jan Otop. Long-Run Average Behavior of Vector Addition Systems with States. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 27:1-27:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chatterjee_et_al:LIPIcs.CONCUR.2019.27, author = {Chatterjee, Krishnendu and Henzinger, Thomas A. and Otop, Jan}, title = {{Long-Run Average Behavior of Vector Addition Systems with States}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {27:1--27:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.27}, URN = {urn:nbn:de:0030-drops-109293}, doi = {10.4230/LIPIcs.CONCUR.2019.27}, annote = {Keywords: vector addition systems, mean-payoff, Diophantine inequalities} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Nathalie Bertrand, Patricia Bouyer, and Anirban Majumdar. Reconfiguration and Message Losses in Parameterized Broadcast Networks. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 32:1-32:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bertrand_et_al:LIPIcs.CONCUR.2019.32, author = {Bertrand, Nathalie and Bouyer, Patricia and Majumdar, Anirban}, title = {{Reconfiguration and Message Losses in Parameterized Broadcast Networks}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {32:1--32:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.32}, URN = {urn:nbn:de:0030-drops-109345}, doi = {10.4230/LIPIcs.CONCUR.2019.32}, annote = {Keywords: model checking, parameterized verification, broadcast networks} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, and Sasha Rubin. Quantifying Bounds in Strategy Logic. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 23:1-23:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{fijalkow_et_al:LIPIcs.CSL.2018.23, author = {Fijalkow, Nathana\"{e}l and Maubert, Bastien and Murano, Aniello and Rubin, Sasha}, title = {{Quantifying Bounds in Strategy Logic}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {23:1--23:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.23}, URN = {urn:nbn:de:0030-drops-96901}, doi = {10.4230/LIPIcs.CSL.2018.23}, annote = {Keywords: Prompt LTL, Strategy Logic, Model checking, Automata with counters} }
Published in: LIPIcs, Volume 42, 26th International Conference on Concurrency Theory (CONCUR 2015)
Salvatore La Torre, Anca Muscholl, and Igor Walukiewicz. Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 72-84, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{latorre_et_al:LIPIcs.CONCUR.2015.72, author = {La Torre, Salvatore and Muscholl, Anca and Walukiewicz, Igor}, title = {{Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {72--84}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.72}, URN = {urn:nbn:de:0030-drops-53813}, doi = {10.4230/LIPIcs.CONCUR.2015.72}, annote = {Keywords: Verification, parametrized systems, shared memory} }
Published in: LIPIcs, Volume 42, 26th International Conference on Concurrency Theory (CONCUR 2015)
Javier Esparza, Pierre Ganty, Jérôme Leroux, and Rupak Majumdar. Verification of Population Protocols. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 470-482, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{esparza_et_al:LIPIcs.CONCUR.2015.470, author = {Esparza, Javier and Ganty, Pierre and Leroux, J\'{e}r\^{o}me and Majumdar, Rupak}, title = {{Verification of Population Protocols}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {470--482}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.470}, URN = {urn:nbn:de:0030-drops-53770}, doi = {10.4230/LIPIcs.CONCUR.2015.470}, annote = {Keywords: Population protocols, Petri nets, parametrized verification} }
Published in: LIPIcs, Volume 42, 26th International Conference on Concurrency Theory (CONCUR 2015)
Nathalie Bertrand, Paulin Fournier, and Arnaud Sangnier. Distributed Local Strategies in Broadcast Networks. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 44-57, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bertrand_et_al:LIPIcs.CONCUR.2015.44, author = {Bertrand, Nathalie and Fournier, Paulin and Sangnier, Arnaud}, title = {{Distributed Local Strategies in Broadcast Networks}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {44--57}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.44}, URN = {urn:nbn:de:0030-drops-53796}, doi = {10.4230/LIPIcs.CONCUR.2015.44}, annote = {Keywords: Broadcast networks, parameterized verification, local strategies} }
Published in: LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)
Tobias Ganzow and Sasha Rubin. Order-Invariant MSO is Stronger than Counting MSO in the Finite. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 313-324, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{ganzow_et_al:LIPIcs.STACS.2008.1353, author = {Ganzow, Tobias and Rubin, Sasha}, title = {{Order-Invariant MSO is Stronger than Counting MSO in the Finite}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {313--324}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1353}, URN = {urn:nbn:de:0030-drops-13535}, doi = {10.4230/LIPIcs.STACS.2008.1353}, annote = {Keywords: MSO, Counting MSO, order-invariance, expressiveness, Ehrenfeucht-Fraiss\'{e} game} }
Published in: LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)
Lukasz Kaiser, Sasha Rubin, and Vince Bárány. Cardinality and counting quantifiers on omega-automatic structures. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 385-396, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{kaiser_et_al:LIPIcs.STACS.2008.1360, author = {Kaiser, Lukasz and Rubin, Sasha and B\'{a}r\'{a}ny, Vince}, title = {{Cardinality and counting quantifiers on omega-automatic structures}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {385--396}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1360}, URN = {urn:nbn:de:0030-drops-13602}, doi = {10.4230/LIPIcs.STACS.2008.1360}, annote = {Keywords: \$omega\$-automatic presentations, \$omega\$-semigroups, \$omega\$-automata} }
Feedback for Dagstuhl Publishing