default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPiotr Hofman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j11]Arka Ghosh
, Piotr Hofman, Slawomir Lasota:
Orbit-finite Linear Programming. J. ACM 72(1): 1:1-1:39 (2025)- [j10]Wojciech Czerwinski, Piotr Hofman:
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable. Log. Methods Comput. Sci. 21(1) (2025) - 2022
- [j9]Piotr Hofman, Jakub Rózycki:
Linear equations for unordered data vectors in $[D]^k\to{}Z^d$. Log. Methods Comput. Sci. 18(4) (2022) - 2021
- [j8]Michal Skrzypczak, Piotr Hofman:
Preface. Fundam. Informaticae 180(4) (2021) - [j7]Matthias Englert, Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Juliusz Straszynski:
A lower bound for the coverability problem in acyclic pushdown VAS. Inf. Process. Lett. 167: 106079 (2021) - 2019
- [j6]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar:
Shortest paths in one-counter systems. Log. Methods Comput. Sci. 15(1) (2019) - 2018
- [j5]Piotr Hofman, Patrick Totzke:
Trace inclusion for one-counter nets revisited. Theor. Comput. Sci. 735: 50-63 (2018) - 2016
- [j4]Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke:
Simulation Problems Over One-Counter Nets. Log. Methods Comput. Sci. 12(1) (2016) - [j3]Diego Figueira, Piotr Hofman, Slawomir Lasota:
Relating timed and register automata. Math. Struct. Comput. Sci. 26(6): 993-1021 (2016) - 2014
- [j2]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. Theory Comput. Syst. 55(1): 136-169 (2014) - 2013
- [j1]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Reachability Problem for Weak Multi-Pushdown Automata. Log. Methods Comput. Sci. 9(3) (2013)
Conference and Workshop Papers
- 2024
- [c31]Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt:
Soundness of reset workflow nets. LICS 2024: 13:1-13:14 - 2023
- [c30]Piotr Hofman, Filip Mazowiecki, Philip Offtermatt:
Fast Termination and Workflow Nets. CAV (1) 2023: 132-155 - [c29]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks:
Acyclic Petri and Workflow Nets with Resets. FSTTCS 2023: 16:1-16:18 - [c28]Arka Ghosh, Piotr Hofman, Slawomir Lasota:
Orbit-finite linear programming. LICS 2023: 1-14 - 2022
- [c27]Wojciech Czerwinski, Piotr Hofman:
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable. CONCUR 2022: 16:1-16:22 - [c26]Arka Ghosh, Piotr Hofman, Slawomir Lasota:
Solvability of orbit-finite systems of linear equations. LICS 2022: 11:1-11:13 - 2021
- [c25]Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan:
Parikh's theorem for infinite alphabets. LICS 2021: 1-13 - 2020
- [c24]Wojciech Czerwinski, Diego Figueira, Piotr Hofman:
Universality Problem for Unambiguous VASS. CONCUR 2020: 36:1-36:15 - [c23]Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke:
Parametrized Universality Problems for One-Counter Nets. CONCUR 2020: 47:1-47:16 - 2019
- [c22]Lorenzo Clemente, Piotr Hofman, Patrick Totzke:
Timed Basic Parallel Processes. CONCUR 2019: 15:1-15:16 - [c21]Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman:
Continuous Reachability for Unordered Data Petri Nets is in PTime. FoSSaCS 2019: 260-276 - 2018
- [c20]Piotr Hofman, Slawomir Lasota:
Linear Equations with Ordered Data. CONCUR 2018: 24:1-24:17 - [c19]Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche:
Unboundedness Problems for Languages of Vector Addition Systems. ICALP 2018: 119:1-119:15 - 2017
- [c18]Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann:
Bounding Average-Energy Games. FoSSaCS 2017: 179-195 - [c17]Piotr Hofman, Jérôme Leroux, Patrick Totzke:
Linear combinations of unordered data vectors. LICS 2017: 1-11 - [c16]Stanislav Böhm, Stefan Göller, Simon Halfon, Piotr Hofman:
On Büchi One-Counter Automata. STACS 2017: 14:1-14:13 - 2016
- [c15]Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke:
Coverability Trees for Petri Nets with Unordered Data. FoSSaCS 2016: 445-461 - [c14]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar:
Shortest Paths in One-Counter Systems. FoSSaCS 2016: 462-478 - [c13]Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche:
The complexity of regular abstractions of one-counter languages. LICS 2016: 207-216 - [c12]Christoph Haase, Piotr Hofman:
Tightening the Complexity of Equivalence Problems for Commutative Grammars. STACS 2016: 41:1-41:14 - 2015
- [c11]Stanislav Böhm, Stefan Haar, Serge Haddad, Piotr Hofman, Stefan Schwoon:
Active diagnosis with observable quiescence. CDC 2015: 1663-1668 - [c10]Piotr Hofman, Wim Martens:
Separability by Short Subsequences and Subwords. ICDT 2015: 230-246 - 2014
- [c9]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke:
Infinite-state energy games. CSL-LICS 2014: 7:1-7:10 - [c8]Claire David, Piotr Hofman, Filip Murlak, Michal Pilipczuk:
Synthesizing transformations from XML schema mappings. ICDT 2014: 61-71 - [c7]Piotr Hofman, Patrick Totzke:
Trace Inclusion for One-Counter Nets Revisited. RP 2014: 151-162 - 2013
- [c6]Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke:
Simulation Over One-counter Nets is PSPACE-Complete. FSTTCS 2013: 515-526 - [c5]Piotr Hofman, Richard Mayr, Patrick Totzke:
Decidability of Weak Simulation on One-Counter Nets. LICS 2013: 203-212 - 2012
- [c4]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Reachability Problem for Weak Multi-Pushdown Automata. CONCUR 2012: 53-68 - [c3]Piotr Hofman, Patrick Totzke:
Approximating Weak Bisimilarity of Basic Parallel Processes. EXPRESS/SOS 2012: 99-113 - 2011
- [c2]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. CONCUR 2011: 528-542 - 2010
- [c1]Diego Figueira, Piotr Hofman, Slawomir Lasota:
Relating timed and register automata. EXPRESS 2010: 61-75
Editorship
- 2019
- [e1]Piotrek Hofman, Michal Skrzypczak:
Developments in Language Theory - 23rd International Conference, DLT 2019, Warsaw, Poland, August 5-9, 2019, Proceedings. Lecture Notes in Computer Science 11647, Springer 2019, ISBN 978-3-030-24885-7 [contents]
Informal and Other Publications
- 2025
- [i22]Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt:
Soundness of reset workflow nets. CoRR abs/2503.04440 (2025) - 2023
- [i21]Arka Ghosh, Piotr Hofman, Slawomir Lasota:
Orbit-finite linear programming. CoRR abs/2302.00802 (2023) - [i20]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks:
Acyclic Petri and Workflow Nets with Resets. CoRR abs/2310.01992 (2023) - 2022
- [i19]Arka Ghosh, Piotr Hofman, Slawomir Lasota:
Solvability of orbit-finite systems of linear equations. CoRR abs/2201.09060 (2022) - [i18]Wojciech Czerwinski, Piotr Hofman:
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable. CoRR abs/2202.08033 (2022) - 2021
- [i17]Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan:
Parikh's theorem for infinite alphabets. CoRR abs/2104.12018 (2021) - [i16]Piotr Hofman, Jakub Rózycki:
Linear equations for unordered data vectors. CoRR abs/2109.03025 (2021) - 2020
- [i15]Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke:
Parametrized Universality Problems for One-Counter Nets. CoRR abs/2005.03435 (2020) - [i14]Wojciech Czerwinski, Diego Figueira, Piotr Hofman:
Universality Problem for Unambiguous VASS. CoRR abs/2007.10907 (2020) - 2019
- [i13]Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman:
Continuous Reachability for Unordered Data Petri nets is in PTime. CoRR abs/1902.05604 (2019) - [i12]Lorenzo Clemente, Piotr Hofman, Patrick Totzke:
Timed Basic Parallel Processes. CoRR abs/1907.01240 (2019) - 2018
- [i11]Piotr Hofman, Slawomir Lasota:
Linear Equations with Ordered Data. CoRR abs/1802.06660 (2018) - [i10]Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche:
Unboundedness problems for languages of vector addition systems. CoRR abs/1802.06683 (2018) - 2016
- [i9]Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche:
Complexity of regular abstractions of one-counter languages. CoRR abs/1602.03419 (2016) - [i8]Piotr Hofman, Jérôme Leroux, Patrick Totzke:
Linear Combinations of Unordered Data Vectors. CoRR abs/1610.01470 (2016) - [i7]Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann:
Bounding Average-energy Games. CoRR abs/1610.07858 (2016) - 2015
- [i6]Christoph Haase, Piotr Hofman:
Tightening the Complexity of Equivalence Problems for Commutative Grammars. CoRR abs/1506.07774 (2015) - [i5]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar:
Shortest paths in one-counter systems. CoRR abs/1510.05460 (2015) - 2014
- [i4]Piotr Hofman, Patrick Totzke:
Trace Inclusion for One-Counter Nets Revisited. CoRR abs/1404.5157 (2014) - [i3]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke:
Infinite-State Energy Games. CoRR abs/1405.0628 (2014) - 2013
- [i2]Piotr Hofman, Richard Mayr, Patrick Totzke:
Decidability of Weak Simulation on One-counter Nets. CoRR abs/1304.4104 (2013) - [i1]Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke:
Simulation Over One-counter Nets is PSPACE-Complete. CoRR abs/1310.6303 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-17 00:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
