No. Title Author Year
1 Front Matter, Table of Contents, Preface, Conference Organization Klin, Bartek et al. 2022
2 Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem Lasota, Sławomir 2022
3 LIPIcs, Volume 243, CONCUR 2022, Complete Volume Klin, Bartek et al. 2022
4 Improved Lower Bounds for Reachability in Vector Addition Systems Czerwiński, Wojciech et al. 2021
5 Parikh Images of Register Automata Lasota, Sławomir et al. 2021
6 Determinisability of One-Clock Timed Automata Clemente, Lorenzo et al. 2020
7 Reachability in Fixed Dimension Vector Addition Systems with States Czerwiński, Wojciech et al. 2020
8 Timed Games and Deterministic Separability Clemente, Lorenzo et al. 2020
9 New Pumping Technique for 2-Dimensional VASS Czerwinski, Wojciech et al. 2019
10 Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms Clemente, Lorenzo et al. 2018
11 Linear Equations with Ordered Data Hofman, Piotr et al. 2018
12 Regular Separability of Well-Structured Transition Systems Czerwinski, Wojciech et al. 2018
13 Regular Separability of Parikh Automata Clemente, Lorenzo et al. 2017
14 Separability of Reachability Sets of Vector Addition Systems Clemente, Lorenzo et al. 2017
15 Homomorphism Problems for First-Order Definable Structures Klin, Bartek et al. 2016
16 Reachability Analysis of First-order Definable Pushdown Systems Clemente, Lorenzo et al. 2015
17 Simulation Over One-counter Nets is PSPACE-Complete Hofman, Piotr et al. 2013
18 Fast equivalence-checking for normed context-free processes Czerwinski, Wojciech et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 18

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI