E-LIB Suche - Ergebnisse für: Jančar, Petr

1

On the Home-Space Problem for Petri Nets:

, In: Taming the Infinities of Concurrency; Lecture Notes in Computer Science,

Jančar, Petr ; Leroux, Jérôme - p. 172-180 , 2024

Link: https://doi.org/10.1007/..

2

Countdown games, and simulation on (succinct) one-counter n..:

Jancar, Petr ; Osicka, Petr ; Sawa, Zdenek
Logical Methods in Computer Science. 19, Issue 1 (2023) - p. , 2023

Link: https://doi.org/10.46298..

3

Bisimilarity on Basic Parallel Processes:

Jančar, Petr
Theoretical Computer Science. 903 (2022) - p. 26-38 , 2022

Link: https://doi.org/10.1016/..

4

CHARACTERIZATION AND COMPARSION OF NEUTRON GENERATORS OF IE..:

Matej, Zdenek ; Kostal, Michal ; Novak, Evzen...
EPJ Web of Conferences. 247 (2021) - p. 18004 , 2021

Link: https://doi.org/10.1051/..

5

Equivalence of pushdown automata via first-order grammars:

Jančar, Petr
Journal of Computer and System Sciences. 115 (2021) - p. 86-112 , 2021

Link: https://doi.org/10.1016/..

6

Deciding semantic finiteness of pushdown processes and firs..:

Jančar, Petr
Journal of Computer and System Sciences. 109 (2020) - p. 22-44 , 2020

Link: https://doi.org/10.1016/..

7

Structural liveness of Petri nets is ExpSpace-hard and deci..:

Jančar, Petr ; Purser, David
Acta Informatica. 56 (2019) 6 - p. 537-552 , 2019

Link: https://doi.org/10.1007/..

8

Bisimulation equivalence of first-order grammars is ACKERMA..:

, In: Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science,

Jančar, Petr ; Schmitz, Sylvain - p. 1-12 , 2019

Link: https://dl.acm.org/doi/1..

9

EXPSPACE-Complete Variant of Countdown Games, and Simulatio..:

, In: Lecture Notes in Computer Science; Reachability Problems,

Jančar, Petr ; Osička, Petr ; Sawa, Zdeněk - p. 59-74 , 2018

Link: https://doi.org/10.1007/..

10

An Approach to Verification of MPI Applications Defined in ..:

, In: 2016 16th International Conference on Application of Concurrency to System Design (ACSD),

Meca, Ondrej ; Bohm, Stanislav ; Behalek, Marek. - p. 55-64 , 2016

Link: https://doi.org/10.1109/..

11

Branching Bisimilarity of Normed BPA Processes Is in NEXPTI..:

, In: Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),

Czerwinski, Wojciech ; Jancar, Petr - p. 168-179 , 2015

Link: https://dl.acm.org/doi/1..

12

Bisimulation equivalence and regularity for real-time one-c..:

Böhm, Stanislav ; Göller, Stefan ; Jančar, Petr
Journal of Computer and System Sciences. 80 (2014) 4 - p. 720-743 , 2014

Link: https://doi.org/10.1016/..

13

Language equivalence of probabilistic pushdown automata:

Forejt, Vojtěch ; Jančar, Petr ; Kiefer, Stefan.
Information and Computation. 237 (2014) - p. 1-11 , 2014

Link: https://doi.org/10.1016/..

14

Equivalence of deterministic one-counter automata is NL-com..:

, In: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing,

Böhm, Stanislav ; Göller, Stefan ; Jancar, Petr - p. 131-140 , 2013

Link: https://dl.acm.org/doi/1..

15

Decidability of DPDA Language Equivalence via First-Order G..:

, In: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science,

Jancar, Petr - p. 415-424 , 2012

Link: https://dl.acm.org/doi/1..