Seuraa
Piotrek Hofman
Piotrek Hofman
University of Warsaw
Vahvistettu sähköpostiosoite verkkotunnuksessa mimuw.edu.pl - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Relating timed and register automata
D Figueira, P Hofman, S Lasota
Mathematical Structures in Computer Science 26 (6), 993-1021, 2016
382016
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
292016
Separability by short subsequences and subwords
P Hofman, W Martens
18th International Conference on Database Theory (ICDT 2015), 2015
262015
Shortest paths in one-counter systems
D Chistikov, W Czerwiński, P Hofman, M Pilipczuk, M Wehar
Foundations of Software Science and Computation Structures: 19th …, 2016
242016
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
232014
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
222011
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
172013
The complexity of regular abstractions of one-counter languages
MF Atig, D Chistikov, P Hofman, KN Kumar, P Saivasan, G Zetzsche
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
152016
Simulation problems over one-counter nets
P Hofman, S Lasota, R Mayr, P Totzke
Logical Methods in Computer Science 12, 2016
152016
Trace inclusion for one-counter nets revisited
P Hofman, P Totzke
Reachability Problems: 8th International Workshop, RP 2014, Oxford, UK …, 2014
152014
Unboundedness problems for languages of vector addition systems
W Czerwiński, P Hofman, G Zetzsche
arXiv preprint arXiv:1802.06683, 2018
142018
Bounding average-energy games
P Bouyer, P Hofman, N Markey, M Randour, M Zimmermann
Foundations of Software Science and Computation Structures: 20th …, 2017
142017
Tightening the complexity of equivalence problems for commutative grammars
C Haase, P Hofman
arXiv preprint arXiv:1506.07774, 2015
142015
A lower bound for the coverability problem in acyclic pushdown VAS
M Englert, P Hofman, S Lasota, R Lazić, J Leroux, J Straszyński
Information Processing Letters 167, 106079, 2021
122021
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
122017
Reachability problem for weak multi-pushdown automata
W Czerwiński, P Hofman, S Lasota
Logical Methods in Computer Science 9, 2013
122013
Linear equations with ordered data
P Hofman, S Lasota
arXiv preprint arXiv:1802.06660, 2018
112018
Active diagnosis with observable quiescence
S Böhm, S Haar, S Haddad, P Hofman, S Schwoon
2015 54th IEEE conference on decision and control (CDC), 1663-1668, 2015
102015
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
92017
Language inclusion for boundedly-ambiguous vector addition systems is decidable
W Czerwiński, P Hofman
arXiv preprint arXiv:2202.08033, 2022
82022
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20