E-LIB Suche - Ergebnisse für: Mazowiecki, Filip

1

Soundness of reset workflow nets:

, In: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science,

Blondin, Michael ; Finkel, Alain ; Hofman, Piotr.. - p. 1-14 , 2024

Link: https://dl.acm.org/doi/1..

2

Determinisation and Unambiguisation of Polynomially-Ambiguo..:

, In: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science,

Jecker, Ismaël ; Mazowiecki, Filip ; Purser, David - p. 1-13 , 2024

Link: https://dl.acm.org/doi/1..

3

Continuous One-counter Automata:

Blondin, Michael ; Leys, Tim ; Mazowiecki, Filip..
ACM Transactions on Computational Logic. 24 (2023) 1 - p. 1-31 , 2023

Link: https://doi.org/10.1145/..

4

Coverability in 2-VASS with One Unary Counter is in NP:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,

Mazowiecki, Filip ; Sinclair-Banks, Henry ; Węgrzycki, Karol - p. 196-217 , 2023

Link: https://doi.org/10.1007/..

5

Fast Termination and Workflow Nets:

, In: Computer Aided Verification; Lecture Notes in Computer Science,

Hofman, Piotr ; Mazowiecki, Filip ; Offtermatt, Philip - p. 132-155 , 2023

Link: https://doi.org/10.1007/..

6

The complexity of soundness in workflow nets:

, In: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science,

Blondin, Michael ; Mazowiecki, Filip ; Offtermatt, Philip - p. 1-13 , 2022

Link: https://dl.acm.org/doi/1..

7

Dynamic Data Structures for Timed Automata Acceptance:

Grez, Alejandro ; Mazowiecki, Filip ; Pilipczuk, Michał..
Algorithmica. 84 (2022) 11 - p. 3223-3245 , 2022

Link: https://doi.org/10.1007/..

8

A robust class of linear recurrence sequences:

Barloy, Corentin ; Fijalkow, Nathanaël ; Lhote, Nathan.
Information and Computation. 289 (2022) - p. 104964 , 2022

Link: https://doi.org/10.1016/..

9

Verifying Generalised and Structural Soundness of Workflow ..:

, In: Computer Aided Verification; Lecture Notes in Computer Science,

Blondin, Michael ; Mazowiecki, Filip ; Offtermatt, Philip - p. 468-489 , 2022

Link: https://doi.org/10.1007/..

10

The boundedness and zero isolation problems for weighted au..:

, In: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science,

Czerwiński, Wojciech ; Lefaucheux, Engel ; Mazowiecki, Filip.. - p. 1-13 , 2022

Link: https://dl.acm.org/doi/1..

11

When are emptiness and containment decidable for probabilis..:

Daviaud, Laure ; Jurdziński, Marcin ; Lazić, Ranko...
Journal of Computer and System Sciences. 119 (2021) - p. 78-96 , 2021

Link: https://doi.org/10.1016/..

12

Affine Extensions of Integer Vector Addition Systems with S..:

Blondin, Michael ; Haase, Christoph ; Mazowiecki, Filip.
Logical Methods in Computer Science. 17, Issue 3 (2021) - p. , 2021

Link: https://doi.org/10.46298..

13

On Polynomial Recursive Sequences:

Cadilhac, Michaël ; Mazowiecki, Filip ; Paperman, Charles..
Theory of Computing Systems. , 2021

Link: https://doi.org/10.1007/..

14

Pumping lemmas for weighted automata:

Chattopadhyay, Agnishom ; Mazowiecki, Filip ; Muscholl, Anca.
Logical Methods in Computer Science. 17, Issue 3 (2021) - p. , 2021

Link: https://doi.org/10.46298..

15

Continuous one-counter automata:

, In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science,

Blondin, Michael ; Leys, Tim ; Mazowiecki, Filip.. - p. 1-13 , 2021

Link: https://dl.acm.org/doi/1..