Obserwuj
Piotrek Hofman
Piotrek Hofman
Zweryfikowany adres z mimuw.edu.pl - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Relating timed and register automata
D Figueira, P Hofman, S Lasota
Mathematical Structures in Computer Science 26 (6), 993-1021, 2016
392016
Separability by short subsequences and subwords
P Hofman, W Martens
18th International Conference on Database Theory (ICDT 2015), 2015
252015
Decidability of branching bisimulation on normed commutative context-free processes
W Czerwiński, P Hofman, S Lasota
International Conference on Concurrency Theory, 528-542, 2011
232011
Coverability trees for Petri nets with unordered data
P Hofman, S Lasota, R Lazić, J Leroux, S Schmitz, P Totzke
International Conference on Foundations of Software Science and Computation …, 2016
222016
Infinite-state energy games
PA Abdulla, MF Atig, P Hofman, R Mayr, KN Kumar, P Totzke
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
202014
Shortest paths in one-counter systems
D Chistikov, W Czerwiński, P Hofman, M Pilipczuk, M Wehar
International Conference on Foundations of Software Science and Computation …, 2016
172016
Reachability problem for weak multi-pushdown automata
W Czerwiński, P Hofman, S Lasota
International Conference on Concurrency Theory, 53-68, 2012
152012
Trace inclusion for one-counter nets revisited
P Hofman, P Totzke
International Workshop on Reachability Problems, 151-162, 2014
132014
Decidability of weak simulation on one-counter nets
P Hofman, R Mayr, P Totzke
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 203-212, 2013
132013
Simulation problems over one-counter nets
P Totzke, R Mayr, S Lasota, P Hofman
Logical Methods in Computer Science 12, 2016
112016
Tightening the complexity of equivalence problems for commutative grammars
C Haase, P Hofman
arXiv preprint arXiv:1506.07774, 2015
112015
Bounding average-energy games
P Bouyer, P Hofman, N Markey, M Randour, M Zimmermann
International Conference on Foundations of Software Science and Computation …, 2017
102017
The complexity of regular abstractions of one-counter languages
MF Atig, D Chistikov, P Hofman, KN Kumar, P Saivasan, G Zetzsche
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016
102016
Linear equations with ordered data
P Hofman, S Lasota
arXiv preprint arXiv:1802.06660, 2018
92018
Linear combinations of unordered data vectors
P Hofman, J Leroux, P Totzke
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-11, 2017
82017
Simulation over one-counter nets is PSPACE-complete
P Hofman, S Lasota, R Mayr, P Totzke
arXiv preprint arXiv:1310.6303, 2013
82013
On Büchi one-counter automata
S Böhm, S Göller, S Halfon, P Hofman
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 2017
72017
Parikh’s theorem for infinite alphabets
P Hofman, M Juzepczuk, S Lasota, M Pattathurajan
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2021
52021
Universality problem for unambiguous VASS
W Czerwiński, D Figueira, P Hofman
arXiv preprint arXiv:2007.10907, 2020
52020
Trace inclusion for one-counter nets revisited
P Hofman, P Totzke
Theoretical Computer Science 735, 50-63, 2018
52018
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20