The Library
Browse by Warwick Author
Up a level |
Number of items: 9.
Mazowiecki, Filip, Sinclair-Banks, Henry and Wegrzycki, Karol (2023) Coverability in 2-VASS with one unary counter is in NP. In: 26th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2023), Paris, France, 22-27 Apr 2023. Published in: Foundations of Software Science and Computation Structures. FoSSaCS 2023, 13992 pp. 196-217. ISBN 9783031308284. doi:10.1007/978-3-031-30829-1_10
Künnemann, Marvin, Mazowiecki, Filip, Schütze, Lia, Sinclair-Banks, Henry and Wegrzycki, Karol (2023) Coverability in VASS revisited : improving Rackoff's Bound to Obtain Conditional Optimality. In: ICALP 2023 : 50th EATCS International Colloquium on Automata, Languages and Programming, Paderborn, Germany, 10-14 Jul 2023. Published in: Proceedings of ICALP 2023, 261 131:1-131:20. ISBN 9783959772785. doi:10.4230/LIPIcs.ICALP.2023.131 ISSN 1868-8969.
Daviaud, Laure, Jurdzinski, Marcin, Lazic, Ranko, Mazowiecki, Filip, Pérez, Guillermo A. and Worrell, James (2021) When are emptiness and containment decidable for probabilistic automata? Journal of Computer and System Sciences, 119 . pp. 78-96. doi:10.1016/j.jcss.2021.01.006 ISSN 0022-0000.
Czerwinski, Wojciech, Lasota, Slawomir , Lazic, Ranko, Leroux, Jérôme and Mazowiecki, Filip (2021) The reachability problem for petri nets is not elementary. Journal of the ACM, 68 (1). 7. doi:10.1145/3422822 ISSN 0004-5411.
Czerwiński, Wojciech, Lasota, Slawomir, Lazic, Ranko, Leroux, Jerome and Mazowiecki, Filip (2020) Reachability in fixed dimension vector addition systems with states. In: 31st International Conference on Concurrency Theory (CONCUR 2020), Virtual conference, 01-04 Sep 2020. Published in: Leibniz International Proceedings in Informatics (LIPIcs), 171 doi:10.4230/LIPIcs.CONCUR.2020.48 ISSN 1868-8969.
Czerwiński, Wojciech, Lasota, Sławomir, Lazic, Ranko, Leroux, Jerome and Mazowiecki, Filip (2019) The reachability problem for Petri nets is not elementary. In: STOC 2019, Phoenix, AZ, USA, 23-26 Jun 2019. Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing pp. 24-33. ISBN 9781450367059. doi:10.1145/3313276.3316369
Clemente, Lorenzo, Lasota, SÅ‚awomir, Lazic, Ranko and Mazowiecki, Filip (2019) Binary reachability of timed-register pushdown automata and branching vector addition systems. ACM Transactions on Computational Logic, 20 (3). pp. 1-31. 14. doi:10.1145/3326161 ISSN 1529-3785.
Figueira, Diego, Lazic, Ranko, Leroux, Jerome, Mazowiecki, Filip and Sutre, Grégoire (2017) Polynomial-space completeness of reachability for succinct branching VASS in dimension one. In: The 44th International Colloquium on Automata, Languages, and Programming (ICALP), Warsaw, Poland, 10-14 Jul 2017. Published in: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), 80 119 : 1-119: 14. ISBN 9783959770415. doi:10.4230/LIPIcs.ICALP.2017.119 ISSN 1868-8969.
Clemente, Lorenzo, Lasota, Slawomir, Lazic, Ranko and Mazowiecki, Filip (2017) Timed pushdown automata and branching vector addition systems. In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Reykjavik, Iceland, 20-23 Jun 2017. Published in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) ISBN 9781509030194. doi:10.1109/LICS.2017.8005083
This list was generated on Fri Mar 29 14:36:51 2024 GMT.