Piotr Hofman

Available identifiers

zbMath Open hofman.piotrMaRDI QIDQ2254492

List of research outcomes

Publication	Date of Publication	Type
Solvability of orbit-finite systems of linear equations	2024-12-06	Paper
Language inclusion for boundedly-ambiguous vector addition systems is decidable	2024-08-13	Paper
Fast termination and workflow nets	2024-02-01	Paper
Timed Basic Parallel Processes	2023-02-03	Paper
Linear equations for unordered data vectors in $[D]^k\to{}Z^d$	2023-01-09	Paper
Universality Problem for Unambiguous VASS	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5089314	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5009439	2021-08-04	Paper
Unboundedness Problems for Languages of Vector Addition Systems.	2021-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q4986262	2021-04-27	Paper
A lower bound for the coverability problem in acyclic pushdown VAS	2021-03-11	Paper
https://portal.mardi4nfdi.de/entity/Q4963999	2021-02-24	Paper
https://portal.mardi4nfdi.de/entity/Q5144611	2021-01-19	Paper
Continuous reachability for unordered data Petri nets is in PTime	2020-01-28	Paper
Shortest Paths in One-Counter Systems	2019-03-18	Paper
Trace inclusion for one-counter nets revisited	2018-06-05	Paper
The complexity of regular abstractions of one-counter languages	2018-04-23	Paper
Infinite-state energy games	2018-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q4636612	2018-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q4601893	2018-01-24	Paper
Decidability of Weak Simulation on One-Counter Nets	2017-07-03	Paper
https://portal.mardi4nfdi.de/entity/Q5738937	2017-06-13	Paper
Bounding Average-Energy Games	2017-05-19	Paper
Relating timed and register automata	2017-04-04	Paper
Simulation Over One-counter Nets is PSPACE-Complete	2017-02-21	Paper
Coverability Trees for Petri Nets with Unordered Data	2016-06-10	Paper
Shortest Paths in One-Counter Systems	2016-06-10	Paper
Simulation problems over one-counter nets	2016-04-19	Paper
Trace Inclusion for One-Counter Nets Revisited	2015-10-28	Paper
Decidability of branching bisimulation on normed commutative context-free processes	2015-02-05	Paper
Reachability problem for weak multi-pushdown automata	2013-09-26	Paper
Reachability problem for weak multi-pushdown automata	2012-09-25	Paper
Decidability of branching bisimulation on normed commutative context-free processes	2011-09-02	Paper
A few new facts about the EKG sequence	2008-11-21	Paper

Research outcomes over time

This page was built for person: Piotr Hofman