The following pages link to Petr Jančar (Q672325):
Displaying 50 items.
- (Q197790) (redirect page) (← links)
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- Exponential lower bounds for the pigeonhole principle (Q687506) (← links)
- Partial orders on words, minimal elements of regular languages, and state complexity (Q688156) (← links)
- Completeness results for single-path Petri nets (Q690244) (← links)
- Automata with a time-variant structure and supply-demand theorems (Q700261) (← links)
- Decidability of a temporal logic problem for Petri nets (Q914407) (← links)
- Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm (Q958302) (← links)
- Hardness of equivalence checking for composed finite-state systems (Q1015390) (← links)
- Non-interleaving bisimulation equivalences on basic parallel processes (Q1049404) (← links)
- (Q1209977) (redirect page) (← links)
- Remarks on the equivalence of c-e structures and Petri nets (Q1209978) (← links)
- Some considerations on branching areas of time (Q1285867) (← links)
- The translation theorem (Q1325048) (← links)
- Count\((q)\) versus the pigeon-hole principle (Q1360313) (← links)
- Models for parallel and distributed computation. Theory, algorithmic techniques and application (Q1396171) (← links)
- A note on well quasi-orderings for powersets (Q1607015) (← links)
- On reachability-related games on vector addition systems with states (Q1675147) (← links)
- EXPSPACE-complete variant of countdown games, and simulation on succinct one-counter nets (Q1798910) (← links)
- The price of universality (Q1815426) (← links)
- Characterizing simpler recognizable sets of integers (Q1826937) (← links)
- Axiomatizing the monodic fragment of first-order temporal logic (Q1849866) (← links)
- Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
- DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159) (← links)
- Forgetting automata and contex-free languages (Q1901701) (← links)
- Complexity of deciding bisimilarity between normed BPA and normed BPP (Q1959482) (← links)
- Petri nets and regular processes (Q1970202) (← links)
- Bisimilarity on basic parallel processes (Q2072066) (← links)
- Equivalence of pushdown automata via first-order grammars (Q2208249) (← links)
- Language equivalence of probabilistic pushdown automata (Q2252520) (← links)
- Co-finiteness and co-emptiness of reachability sets in vector addition systems with states (Q2280187) (← links)
- State-space reduction of non-deterministically synchronizing systems applicable to deadlock detection in MPI (Q2281630) (← links)
- Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence (Q2301358) (← links)
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable (Q2317836) (← links)
- A note on emptiness for alternating finite automata with a one-letter alphabet (Q2380016) (← links)
- Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
- Complexity of Checking Bisimilarity between Sequential and Parallel Processes (Q2849919) (← links)
- Unidirectional Channel Systems Can Be Tested (Q2915167) (← links)
- Bisimilarity of Probabilistic Pushdown Automata (Q2957520) (← links)
- Deciding Structural Liveness of Petri Nets (Q2971127) (← links)
- Decidability of DPDA Language Equivalence via First-Order Grammars (Q2986817) (← links)
- Equivalence-Checking with Infinite-State Systems: Techniques and Results (Q3085977) (← links)
- (Q3424633) (← links)
- (Q3517257) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- Normed BPA vs. Normed BPP Revisited (Q3541036) (← links)
- Undecidability of bisimilarity by defender's forcing (Q3546360) (← links)
- Bisimilarity of One-Counter Processes Is PSPACE-Complete (Q3584929) (← links)
- Reachability Games on Extended Vector Addition Systems with States (Q3587462) (← links)
- (Q4035241) (← links)
