 | 2010 |
|---|
| 11 |       | Sibylle B. Fröschle,
Petr Jancar,
Slawomir Lasota,
Zdenek Sawa:
Non-interleaving bisimulation equivalences on Basic Parallel Processes.
Inf. Comput. 208(1): 42-62 (2010) |
| 2009 |
|---|
| 10 | | Zdenek Sawa,
Petr Jancar:
Hardness of equivalence checking for composed finite-state systems.
Acta Inf. 46(3): 169-191 (2009) |
| 2008 |
|---|
| 9 | | Petr Jancar,
Martin Kot,
Zdenek Sawa:
Normed BPA vs. Normed BPP Revisited.
CONCUR 2008: 434-446 |
| 2007 |
|---|
| 8 | | Petr Jancar,
Zdenek Sawa:
A note on emptiness for alternating finite automata with a one-letter alphabet.
Inf. Process. Lett. 104(5): 164-167 (2007) |
| 2005 |
|---|
| 7 |  | Zdenek Sawa,
Petr Jancar:
Behavioural Equivalences on Finite-State Systems are PTIME-hard.
Computers and Artificial Intelligence 24(5): (2005) |
| 6 | | Martin Kot,
Zdenek Sawa:
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time.
Electr. Notes Theor. Comput. Sci. 138(3): 49-60 (2005) |
| 2004 |
|---|
| 5 | | Petr Jancar,
Antonín Kucera,
Faron Moller,
Zdenek Sawa:
DP lower bounds for equivalence-checking and model-checking of one-counter automata.
Inf. Comput. 188(1): 1-19 (2004) |
| 2003 |
|---|
| 4 | | Zdenek Sawa:
Equivalence Checking of Non-Flat Systems Is EXPTIME-hard.
CONCUR 2003: 233-248 |
| 2002 |
|---|
| 3 | | Petr Jancar,
Antonín Kucera,
Faron Moller,
Zdenek Sawa:
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds.
FoSSaCS 2002: 172-186 |
| 2001 |
|---|
| 2 | | Zdenek Sawa,
Petr Jancar:
P-Hardness of Equivalence Testing on Finite-State Processes.
SOFSEM 2001: 326-335 |
| 1999 |
|---|
| 1 | | Petr Jancar,
Faron Moller,
Zdenek Sawa:
Simulation Problems for One-Counter Machines.
SOFSEM 1999: 404-413 |
