According to our database1, Zdenek Sawa
Legend:Book In proceedings Article PhD thesis Other
EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets.
Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata.
Fundam. Inform., 2013
Complexity of Checking Bisimilarity between Sequential and Parallel Processes.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013
Complexity of deciding bisimilarity between normed BPA and normed BPP.
Inf. Comput., 2010
Non-interleaving bisimulation equivalences on Basic Parallel Processes.
Inf. Comput., 2010
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA.
Proceedings of the Reachability Problems, 4th International Workshop, 2010
Hardness of equivalence checking for composed finite-state systems.
Acta Inf., 2009
Normed BPA vs. Normed BPP Revisited.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008
A note on emptiness for alternating finite automata with a one-letter alphabet.
Inf. Process. Lett., 2007
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time.
Electr. Notes Theor. Comput. Sci., 2005
Behavioural Equivalences on Finite-State Systems are PTIME-hard.
Computers and Artificial Intelligence, 2005
DP lower bounds for equivalence-checking and model-checking of one-counter automata.
Inf. Comput., 2004
Equivalence Checking of Non-Flat Systems Is EXPTIME-hard.
Proceedings of the CONCUR 2003, 2003
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds.
Proceedings of the Foundations of Software Science and Computation Structures, 2002
P-Hardness of Equivalence Testing on Finite-State Processes.
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001
Simulation Problems for One-Counter Machines.
Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999