Zdenek Sawa

19 papers B 6Journal 10Unranked 3
YearRankTypeTitle / Venue / Authors
2023 J jnl
Countdown games, and simulation on (succinct) one-counter nets.
Log. Methods Comput. Sci.
Petr Jancar, Petr Osicka, Zdenek Sawa
2020 J jnl
Countdown games, and simulation on (succinct) one-counter nets.
CoRR
Petr Jancar, Petr Osicka, Zdenek Sawa
2018 — conf
EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets.
RP
Petr Jancar, Petr Osicka, Zdenek Sawa
2018 J jnl
EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets.
CoRR
Petr Jancar, Petr Osicka, Zdenek Sawa
2013 B conf
Complexity of Checking Bisimilarity between Sequential and Parallel Processes.
MFCS
Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa
2013 J jnl
Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata.
Fundam. Informaticae
Zdenek Sawa
2010 J jnl
Complexity of deciding bisimilarity between normed BPA and normed BPP.
Inf. Comput.
Petr Jancar, Martin Kot, Zdenek Sawa
2010 — conf
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA.
RP
Zdenek Sawa
2010 J jnl
Non-interleaving bisimulation equivalences on Basic Parallel Processes.
Inf. Comput.
Sibylle B. Fröschle, Petr Jancar, Slawomir Lasota, Zdenek Sawa
2009 J jnl
Hardness of equivalence checking for composed finite-state systems.
Acta Informatica
Zdenek Sawa, Petr Jancar
2008 B conf
Normed BPA vs. Normed BPP Revisited.
CONCUR
Petr Jancar, Martin Kot, Zdenek Sawa
2007 J jnl
A note on emptiness for alternating finite automata with a one-letter alphabet.
Inf. Process. Lett.
Petr Jancar, Zdenek Sawa
2005 J jnl
Behavioural Equivalences on Finite-State Systems are PTIME-hard.
Comput. Artif. Intell.
Zdenek Sawa, Petr Jancar
2004 — conf
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time.
INFINITY
Martin Kot, Zdenek Sawa
2004 J jnl
DP lower bounds for equivalence-checking and model-checking of one-counter automata.
Inf. Comput.
Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
2003 B conf
Equivalence Checking of Non-Flat Systems Is EXPTIME-hard.
CONCUR
Zdenek Sawa
2002 B conf
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds.
FoSSaCS
Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
2001 B conf
P-Hardness of Equivalence Testing on Finite-State Processes.
SOFSEM
Zdenek Sawa, Petr Jancar
1999 B conf
Simulation Problems for One-Counter Machines.
SOFSEM
Petr Jancar, Faron Moller, Zdenek Sawa