Nie jesteś zalogowany | Zaloguj się

Piotr Hofman

Liczba publikacji: 45

2024

Michael Blondin, Alain Finkel, Piotr Hofman , Filip Mazowiecki, Philip Offtermatt, Soundness of reset workflow nets, 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Tallinn, Estonia, 8 lipca 2024 - 11 lipca 2024. Zobacz w PBN

2023

Dmitry Chistikov, Wojciech Czerwiński , Piotr Hofman , Filip Mazowiecki, Henry Sinclair-Banks, Acyclic Petri and Workflow Nets with Resets, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 18 grudnia 2023 - 20 grudnia 2023. Zobacz w PBN
Piotr Hofman , Filip Mazowiecki, Philip Offtermatt, Fast Termination and Workflow Nets, 35th International Conference on Computer Aided Verification, Paris, France, 17 lipca 2023 - 22 lipca 2023. Zobacz w PBN
Arka Ghosh , Piotr Hofman , Sławomir Lasota , Orbit-finite linear programming, Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science, Boston, the United States of America, 26 czerwca 2023 - 29 czerwca 2023. Zobacz w PBN

2022

Wojciech Czerwiński , Piotr Hofman , Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable, 33rd International Conference on Concurrency Theory, Warszawa, Poland, 12 września 2022 - 16 września 2022. Zobacz w PBN
Piotr Hofman , Jakub Różycki, Linear equations for unordered data vectors in $[D]^k\to{}Z^d$, Logical Methods in Computer Science, Volume 18, Issue 4 2022. Zobacz w PBN
Arka Ghosh , Piotr Hofman , Sławomir Lasota , Solvability of orbit-finite systems of linear equations, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 sierpnia 2022 - 5 sierpnia 2022. Zobacz w PBN

2021

Matthias Englert, Ranko Lazić, Jérôme Leroux, Sławomir Lasota , Piotr Hofman , Juliusz Straszyński , A lower bound for the coverability problem in acyclic pushdown VAS, Information Processing Letters, 167 2021, s. 106079:1-5. Zobacz w PBN
Marta Juzepczuk, Mohnish Pattathurajan, Piotr Hofman , Sławomir Lasota , Parikh’s theorem for infinite alphabets, 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 29 czerwca 2021 - 2 lipca 2021. Zobacz w PBN
Piotr Hofman , Michał Skrzypczak , Preface, Fundamenta Informaticae, 180 (4) 2021, s. i-ii. Zobacz w PBN

2020

Shaull Almagor, Udi Boker, Piotr Hofman , Patrick Totzke, Parametrized Universality Problems for One-Counter Nets, 31st International Conference on Concurrency Theory, Vienna, Austria, 1 września 2020 - 4 września 2020. Zobacz w PBN
Wojciech Czerwiński , Piotr Hofman , Diego Figueira, Universality Problem for Unambiguous VASS, 31st International Conference on Concurrency Theory, Vienna, Austria, 1 września 2020 - 4 września 2020. Zobacz w PBN
Piotr Hofman , Wojciech Czerwiński , Diego Figueira, Universality Problem for Unambiguous VASS, Leibniz International Proceedings in Informatics, LIPIcs, 2020. Zobacz w PBN

2019

Michał Skrzypczak , Piotr Hofman , 23rd international conference, DLT 2019, Warsaw, Poland, August 5-9, 2019, proceedings, 23nd International Conference on Developments in Language Theory, Warsaw, Poland, 4 sierpnia 2019 - 8 sierpnia 2019. Zobacz w PBN
Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman , Continuous Reachability for Unordered Data Petri Nets is in PTime, 22nd International Conference on Foundations of Software Science and Computation Structures, Prague, Czechia, 6 kwietnia 2019 - 11 kwietnia 2019. Zobacz w PBN
Dmitry Chistikov, Wojciech Czerwiński , Piotr Hofman , Michał Pilipczuk , Michael Wehar, Shortest paths in one-counter systems, Logical Methods in Computer Science, 15 (1) 2019, s. 19:1–19:28. Zobacz w PBN
Lorenzo Clemente , Piotr Hofman , Patrick Totzke, Timed Basic Parallel Processes, 30th International Conference on Concurrency Theory, Amsterdam, the Netherlands, 26 sierpnia 2019 - 31 sierpnia 2019. Zobacz w PBN

2018

Piotr Hofman , Sławomir Lasota , Linear Equations with Ordered Data, 29th International Conference on Concurrency Theory, Beijing, China, 4 września 2018 - 7 września 2018. Zobacz w PBN
Piotr Hofman , Patrick Totzke, Trace inclusion for one-counter nets revisited, Theoretical Computer Science, 735 2018, s. 50-63. Zobacz w PBN
Wojciech Czerwiński , Piotr Hofman , Georg Zetzsche, Unboundedness Problems for Languages of Vector Addition Systems, 45th International Colloquium on Automata, Languages, and Programming, Praha, Czechia, 9 lipca 2018 - 13 lipca 2018. Zobacz w PBN

2017

Damian Niwiński , Henryk Michalewski , Wojciech Rytter , Joost Winter, Michał Skrzypczak , Szymon Toruńczyk , Michał Pilipczuk , Eryk Kopczyński , Sławomir Lasota , Paweł Parys , Joanna Ochremiak, Wojciech Czerwiński , Bartosz Klin , Igor Walukiewicz, Szczepan Hummel, Mikołaj Bojańczyk , Piotr Hofman , Lorenzo Clemente , Filip Mazowiecki, Filip Murlak , 200 Problems in Formal Languages and Automata Theory, 2017. Zobacz w PBN
Patricia Bouyer, Piotr Hofman , Nicolas Markey, Mickael Randour, Martin Zimmermann, Bounding Average-Energy Games, 20th International Conference on Foundations of Software Science and Computation Structures, Uppsala, Sweden, 22 kwietnia 2017 - 29 kwietnia 2017. Zobacz w PBN
Piotr Hofman , Jerome Leroux, Patrick Totzke, Linear combinations of unordered data vectors, Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, 20 czerwca 2017 - 23 czerwca 2017. Zobacz w PBN
Piotr Hofman , Stanislav Böhm, Stefan Göller, Simon Halfon, On Büchi One-Counter Automata, 34th International Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 8 marca 2017 - 11 marca 2017. Zobacz w PBN

2016

Piotr Hofman , Sławomir Lasota , Ranko Lazic, J\'er\^ome Leroux, Sylvain Schmitz, Patrick Totzke, Coverability Trees for Petri Nets with Unordered Data, Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, 2016. Zobacz w PBN
Sławomir Lasota , Diego Figueira, Piotr Hofman , Relating timed and register automata, Mathematical Structures in Computer Science, 2016. Zobacz w PBN
Dmitry Chistikov, Wojciech Czerwiński , Piotr Hofman , Michał Pilipczuk , Michael Wehar, Shortest Paths in One-Counter Systems, 19th International Conference on Foundations of Software Science and Computation Structures, Eindhoven, the Netherlands, 2 kwietnia 2016 - 8 kwietnia 2016. Zobacz w PBN
Sławomir Lasota , Richard Mayr, Patrick Totzke, Piotr Hofman , Simulation Problems Over One-Counter Nets, Logical Methods in Computer Science, 2016. Zobacz w PBN
Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman , K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche, The complexity of regular abstractions of one-counter languages, 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Nowy Jork, the United States of America, 5 lipca 2016 - 8 lipca 2016. Zobacz w PBN
Christoph Haase, Piotr Hofman , Tightening the Complexity of Equivalence Problems for Commutative Grammars, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, 2016. Zobacz w PBN

2015

Piotr Hofman , 54th IEEE Conference on Decision and Control, CDC 2015, Osaka, Japan, December 15-18, 2015, 2015. Zobacz w PBN
Stanislav B\öhm, Stefan Haar, Serge Haddad, Piotr Hofman , Stefan Schwoon, Active diagnosis with observable quiescence, 54. CDC 2015, 2015. Zobacz w PBN
Piotr Hofman , Wim Martens, Separability by Short Subsequences and Subwords, 18th International Conference on Database Theory, ICDT, 2015. Zobacz w PBN

2014

Wojciech Czerwiński , Piotr Hofman , Sławomir Lasota , Decidability of branching bisimulation on normed commutative context-free processes, Theory of Computing Systems, 2014. Zobacz w PBN
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman , K. Narayan Kumar, Richard Mayr, Patrick Totzke, Infinite-state energy games, Joint Meeting of the Twenty-Third {EACSL} Annual Conference on Computer Science Logic {(CSL)} and the Twenty-Ninth Annual {ACM/IEEE} Symposium on Logic in Computer Science (LICS), 2014. Zobacz w PBN
Claire David, Filip Murlak , Piotr Hofman , Michał Pilipczuk , Synthesizing transformations from XML schema mappings, 2014. Zobacz w PBN
Piotr Hofman , Patrick Totzke, Trace Inclusion for One-Counter Nets Revisited, Reachability Problems - 8th International Workshop, Oxford, the United Kingdom of Great Britain and Northern Ireland, 22 września 2014 - 24 września 2014. Zobacz w PBN

2013

Piotr Hofman , Richard Mayr, Patrick Totzke, Decidability of Weak Simulation on One-Counter Nets, 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, 2013. Zobacz w PBN
Wojciech Czerwiński , Piotr Hofman , Sławomir Lasota , Reachability problem for weak multi-pushdown automata, Logical Methods in Computer Science, 2013. Zobacz w PBN
Sławomir Lasota , Piotr Hofman , Richard Mayr, Patrick Totzke, Simulation Over One-counter Nets is PSPACE-Complete, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), 2013. Zobacz w PBN

2012

Piotr Hofman , Patrick Totzke, Approximating Weak Bisimilarity of Basic Parallel Processes, Proceedings Combined 21st International Workshop on Expressiveness in Concurrency and 11th Workshop on Structural Operational Semantics, EXPRESS 2014, and 11th Workshop on Structural Operational Semantics, SOS 2014, Rome, Italy, 1st September 2014., 2012. Zobacz w PBN
Wojciech Czerwiński , Piotr Hofman , Sławomir Lasota , Reachability Problem for Weak Multi-Pushdown Automata, 23rd International Conference, CONCUR 2012, Newcastle upon Tyne, the United Kingdom of Great Britain and Northern Ireland, 4 września 2012 - 7 września 2012. Zobacz w PBN

2011

Wojciech Czerwiński , Piotr Hofman , Sławomir Lasota , Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes, Lecture Notes in Computer Science, 2011. Zobacz w PBN

2010

Diego Figueira, Piotr Hofman , Sławomir Lasota , Relating timed and register automata, 17th International Workshop on Expressiveness in Concurrency, 2010. Zobacz w PBN