×

zbMATH — the first resource for mathematics

Hofman, Piotr

Compute Distance To:
Author ID: hofman.piotr Recent zbMATH articles by "Hofman, Piotr"
Published as: Hofman, Piotr
External Links: ORCID
Documents Indexed: 21 Publications since 2008

Publications by Year

Citations contained in zbMATH

16 Publications have been cited 44 times in 38 Documents Cited by Year
Tightening the complexity of equivalence problems for commutative grammars. Zbl 1388.68154
Haase, Christoph; Hofman, Piotr
6
2016
Coverability trees for Petri nets with unordered data. Zbl 06591835
Hofman, Piotr; Lasota, Sławomir; Lazić, Ranko; Leroux, Jérôme; Schmitz, Sylvain; Totzke, Patrick
5
2016
Relating timed and register automata. Zbl 1362.68138
Figueira, Diego; Hofman, Piotr; Lasota, Sławomir
4
2016
Simulation problems over one-counter nets. Zbl 1448.68342
Hofman, Piotr; Lasota, Slawomir; Mayr, Richard; Totzke, Patrick
4
2016
Separability by short subsequences and subwords. Zbl 1365.68206
Hofman, Piotr; Martens, Wim
4
2015
Bounding average-energy games. Zbl 1392.68115
Bouyer, Patricia; Hofman, Piotr; Markey, Nicolas; Randour, Mickael; Zimmermann, Martin
3
2017
Decidability of weak simulation on one-counter nets. Zbl 1366.68206
Hofman, Piotr; Mayr, Richard; Totzke, Patrick
3
2013
The complexity of regular abstractions of one-counter languages. Zbl 1401.68142
Atig, Mohamed Faouzi; Chistikov, Dmitry; Hofman, Piotr; Kumar, K. Narayan; Saivasan, Prakash; Zetzsche, Georg
2
2016
Shortest paths in one-counter systems. Zbl 06591836
Chistikov, Dmitry; Czerwiński, Wojciech; Hofman, Piotr; Pilipczuk, Michał; Wehar, Michael
2
2016
Trace inclusion for one-counter nets revisited. Zbl 1393.68117
Hofman, Piotr; Totzke, Patrick
2
2014
Simulation over one-counter nets is PSPACE-complete. Zbl 1359.68223
Hofman, Piotr; Lasota, Slawomir; Mayr, Richard; Totzke, Patrick
2
2013
Reachability problem for weak multi-pushdown automata. Zbl 1364.68247
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
2
2012
Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1343.68164
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
2
2011
Infinite-state energy games. Zbl 1401.68139
Abdulla, Parosh Aziz; Atig, Mohamed Faouzi; Hofman, Piotr; Mayr, Richard; Kumar, K. Narayan; Totzke, Patrick
1
2014
Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1319.68147
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
1
2014
Reachability problem for weak multi-pushdown automata. Zbl 1274.68156
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
1
2013
Bounding average-energy games. Zbl 1392.68115
Bouyer, Patricia; Hofman, Piotr; Markey, Nicolas; Randour, Mickael; Zimmermann, Martin
3
2017
Tightening the complexity of equivalence problems for commutative grammars. Zbl 1388.68154
Haase, Christoph; Hofman, Piotr
6
2016
Coverability trees for Petri nets with unordered data. Zbl 06591835
Hofman, Piotr; Lasota, Sławomir; Lazić, Ranko; Leroux, Jérôme; Schmitz, Sylvain; Totzke, Patrick
5
2016
Relating timed and register automata. Zbl 1362.68138
Figueira, Diego; Hofman, Piotr; Lasota, Sławomir
4
2016
Simulation problems over one-counter nets. Zbl 1448.68342
Hofman, Piotr; Lasota, Slawomir; Mayr, Richard; Totzke, Patrick
4
2016
The complexity of regular abstractions of one-counter languages. Zbl 1401.68142
Atig, Mohamed Faouzi; Chistikov, Dmitry; Hofman, Piotr; Kumar, K. Narayan; Saivasan, Prakash; Zetzsche, Georg
2
2016
Shortest paths in one-counter systems. Zbl 06591836
Chistikov, Dmitry; Czerwiński, Wojciech; Hofman, Piotr; Pilipczuk, Michał; Wehar, Michael
2
2016
Separability by short subsequences and subwords. Zbl 1365.68206
Hofman, Piotr; Martens, Wim
4
2015
Trace inclusion for one-counter nets revisited. Zbl 1393.68117
Hofman, Piotr; Totzke, Patrick
2
2014
Infinite-state energy games. Zbl 1401.68139
Abdulla, Parosh Aziz; Atig, Mohamed Faouzi; Hofman, Piotr; Mayr, Richard; Kumar, K. Narayan; Totzke, Patrick
1
2014
Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1319.68147
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
1
2014
Decidability of weak simulation on one-counter nets. Zbl 1366.68206
Hofman, Piotr; Mayr, Richard; Totzke, Patrick
3
2013
Simulation over one-counter nets is PSPACE-complete. Zbl 1359.68223
Hofman, Piotr; Lasota, Slawomir; Mayr, Richard; Totzke, Patrick
2
2013
Reachability problem for weak multi-pushdown automata. Zbl 1274.68156
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
1
2013
Reachability problem for weak multi-pushdown automata. Zbl 1364.68247
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
2
2012
Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1343.68164
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
2
2011

Citations by Year