Published in: LIPIcs, Volume 284, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023)
Shaull Almagor, Daniel Assa, and Udi Boker. Synchronized CTL over One-Counter Automata. In 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 284, pp. 19:1-19:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{almagor_et_al:LIPIcs.FSTTCS.2023.19, author = {Almagor, Shaull and Assa, Daniel and Boker, Udi}, title = {{Synchronized CTL over One-Counter Automata}}, booktitle = {43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023)}, pages = {19:1--19:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-304-1}, ISSN = {1868-8969}, year = {2023}, volume = {284}, editor = {Bouyer, Patricia and Srinivasan, Srikanth}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2023.19}, URN = {urn:nbn:de:0030-drops-193921}, doi = {10.4230/LIPIcs.FSTTCS.2023.19}, annote = {Keywords: CTL, Synchronization, One Counter Automata, Model Checking} }
Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Shaull Almagor, Arka Ghosh, Tim Leys, and Guillermo A. Pérez. The Geometry of Reachability in Continuous Vector Addition Systems with States. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 11:1-11:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{almagor_et_al:LIPIcs.MFCS.2023.11, author = {Almagor, Shaull and Ghosh, Arka and Leys, Tim and P\'{e}rez, Guillermo A.}, title = {{The Geometry of Reachability in Continuous Vector Addition Systems with States}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {11:1--11:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.11}, URN = {urn:nbn:de:0030-drops-185457}, doi = {10.4230/LIPIcs.MFCS.2023.11}, annote = {Keywords: Vector addition system with states, reachability, continuous approximation} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Shaull Almagor and Asaf Yeshurun. Determinization of One-Counter Nets. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 18:1-18:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{almagor_et_al:LIPIcs.CONCUR.2022.18, author = {Almagor, Shaull and Yeshurun, Asaf}, title = {{Determinization of One-Counter Nets}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {18:1--18:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.18}, URN = {urn:nbn:de:0030-drops-170812}, doi = {10.4230/LIPIcs.CONCUR.2022.18}, annote = {Keywords: Determinization, One-Counter Net, Vector Addition System, Automata, Semilinear} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Shaull Almagor and Shai Guendelman. Concurrent Games with Multiple Topologies. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 34:1-34:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{almagor_et_al:LIPIcs.CONCUR.2022.34, author = {Almagor, Shaull and Guendelman, Shai}, title = {{Concurrent Games with Multiple Topologies}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {34:1--34:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.34}, URN = {urn:nbn:de:0030-drops-170973}, doi = {10.4230/LIPIcs.CONCUR.2022.34}, annote = {Keywords: Concurrent games, Nash Equilibrium, Symmetry, Partial information} }
Published in: LIPIcs, Volume 216, 30th EACSL Annual Conference on Computer Science Logic (CSL 2022)
Antonio Abu Nassar and Shaull Almagor. Simulation by Rounds of Letter-To-Letter Transducers. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 3:1-3:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{abunassar_et_al:LIPIcs.CSL.2022.3, author = {Abu Nassar, Antonio and Almagor, Shaull}, title = {{Simulation by Rounds of Letter-To-Letter Transducers}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {3:1--3:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.3}, URN = {urn:nbn:de:0030-drops-157231}, doi = {10.4230/LIPIcs.CSL.2022.3}, annote = {Keywords: Transducers, Permutations, Parikh, Simulation, Equivalence} }
Published in: LIPIcs, Volume 182, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)
Shaull Almagor. Process Symmetry in Probabilistic Transducers. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 182, pp. 35:1-35:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{almagor:LIPIcs.FSTTCS.2020.35, author = {Almagor, Shaull}, title = {{Process Symmetry in Probabilistic Transducers}}, booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)}, pages = {35:1--35:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-174-0}, ISSN = {1868-8969}, year = {2020}, volume = {182}, editor = {Saxena, Nitin and Simon, Sunil}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.35}, URN = {urn:nbn:de:0030-drops-132764}, doi = {10.4230/LIPIcs.FSTTCS.2020.35}, annote = {Keywords: Symmetry, Probabilistic Transducers, Model Checking, Permutations} }
Published in: LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 2020)
Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, and James Worrell. Coverability in 1-VASS with Disequality Tests. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 38:1-38:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{almagor_et_al:LIPIcs.CONCUR.2020.38, author = {Almagor, Shaull and Cohen, Nathann and P\'{e}rez, Guillermo A. and Shirmohammadi, Mahsa and Worrell, James}, title = {{Coverability in 1-VASS with Disequality Tests}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {38:1--38:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.38}, URN = {urn:nbn:de:0030-drops-128501}, doi = {10.4230/LIPIcs.CONCUR.2020.38}, annote = {Keywords: Reachability, Vector addition systems with states, Weighted graphs} }
Published in: LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 2020)
Shaull Almagor, Udi Boker, Piotr Hofman, and Patrick Totzke. Parametrized Universality Problems for One-Counter Nets. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 47:1-47:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{almagor_et_al:LIPIcs.CONCUR.2020.47, author = {Almagor, Shaull and Boker, Udi and Hofman, Piotr and Totzke, Patrick}, title = {{Parametrized Universality Problems for One-Counter Nets}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {47:1--47:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.47}, URN = {urn:nbn:de:0030-drops-128592}, doi = {10.4230/LIPIcs.CONCUR.2020.47}, annote = {Keywords: Counter net, VASS, Unambiguous Automata, Universality} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Shaull Almagor, Edon Kelmendi, Joël Ouaknine, and James Worrell. Invariants for Continuous Linear Dynamical Systems. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 107:1-107:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{almagor_et_al:LIPIcs.ICALP.2020.107, author = {Almagor, Shaull and Kelmendi, Edon and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{Invariants for Continuous Linear Dynamical Systems}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {107:1--107:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.107}, URN = {urn:nbn:de:0030-drops-125141}, doi = {10.4230/LIPIcs.ICALP.2020.107}, annote = {Keywords: Invariants, continuous linear dynamical systems, continuous Skolem problem, safety, o-minimality} }
Published in: LIPIcs, Volume 155, 23rd International Conference on Database Theory (ICDT 2020)
Johannes Doleschal, Benny Kimelfeld, Wim Martens, and Liat Peterfreund. Weight Annotation in Information Extraction. In 23rd International Conference on Database Theory (ICDT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 155, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{doleschal_et_al:LIPIcs.ICDT.2020.8, author = {Doleschal, Johannes and Kimelfeld, Benny and Martens, Wim and Peterfreund, Liat}, title = {{Weight Annotation in Information Extraction}}, booktitle = {23rd International Conference on Database Theory (ICDT 2020)}, pages = {8:1--8:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-139-9}, ISSN = {1868-8969}, year = {2020}, volume = {155}, editor = {Lutz, Carsten and Jung, Jean Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2020.8}, URN = {urn:nbn:de:0030-drops-119325}, doi = {10.4230/LIPIcs.ICDT.2020.8}, annote = {Keywords: Information extraction, regular document spanners, weighted automata, provenance semirings, K-relations} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Shaull Almagor, Joël Ouaknine, and James Worrell. The Semialgebraic Orbit Problem. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{almagor_et_al:LIPIcs.STACS.2019.6, author = {Almagor, Shaull and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{The Semialgebraic Orbit Problem}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {6:1--6:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.6}, URN = {urn:nbn:de:0030-drops-102450}, doi = {10.4230/LIPIcs.STACS.2019.6}, annote = {Keywords: linear dynamical systems, Orbit Problem, first order theory of the reals} }
Published in: LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018)
Shaull Almagor, Brynmor Chapman, Mehran Hosseini, Joël Ouaknine, and James Worrell. Effective Divergence Analysis for Linear Recurrence Sequences. In 29th International Conference on Concurrency Theory (CONCUR 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 118, pp. 42:1-42:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{almagor_et_al:LIPIcs.CONCUR.2018.42, author = {Almagor, Shaull and Chapman, Brynmor and Hosseini, Mehran and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{Effective Divergence Analysis for Linear Recurrence Sequences}}, booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)}, pages = {42:1--42:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-087-3}, ISSN = {1868-8969}, year = {2018}, volume = {118}, editor = {Schewe, Sven and Zhang, Lijun}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.42}, URN = {urn:nbn:de:0030-drops-95802}, doi = {10.4230/LIPIcs.CONCUR.2018.42}, annote = {Keywords: Linear recurrence sequences, Divergence, Algebraic numbers, Positivity} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, and James Worrell. O-Minimal Invariants for Linear Loops. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 114:1-114:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{almagor_et_al:LIPIcs.ICALP.2018.114, author = {Almagor, Shaull and Chistikov, Dmitry and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{O-Minimal Invariants for Linear Loops}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {114:1--114:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.114}, URN = {urn:nbn:de:0030-drops-91188}, doi = {10.4230/LIPIcs.ICALP.2018.114}, annote = {Keywords: Invariants, linear loops, linear dynamical systems, non-termination, o-minimality} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Shaull Almagor, Joël Ouaknine, and James Worrell. The Polytope-Collision Problem. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 24:1-24:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{almagor_et_al:LIPIcs.ICALP.2017.24, author = {Almagor, Shaull and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{The Polytope-Collision Problem}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {24:1--24:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.24}, URN = {urn:nbn:de:0030-drops-74521}, doi = {10.4230/LIPIcs.ICALP.2017.24}, annote = {Keywords: linear dynamical systems, orbit problem, algebraic algorithms} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Shaull Almagor and Orna Kupferman. High-Quality Synthesis Against Stochastic Environments. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 28:1-28:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{almagor_et_al:LIPIcs.CSL.2016.28, author = {Almagor, Shaull and Kupferman, Orna}, title = {{High-Quality Synthesis Against Stochastic Environments}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {28:1--28:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.28}, URN = {urn:nbn:de:0030-drops-65688}, doi = {10.4230/LIPIcs.CSL.2016.28}, annote = {Keywords: Stochastic and Quantitative Synthesis, Markov Decision Process} }
Feedback for Dagstuhl Publishing