Остановите войну!
for scientists:
default search action
Petr Jancar
- > Home > Persons > Petr Jancar
Publications
- 2023
- [j36]Petr Jancar, Petr Osicka, Zdenek Sawa:
Countdown games, and simulation on (succinct) one-counter nets. Log. Methods Comput. Sci. 19(1) (2023) - [c53]Petr Jancar, Jérôme Leroux:
The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets. CONCUR 2023: 36:1-36:17 - 2022
- [j35]Irina A. Lomazova, Vladimir A. Bashkin, Petr Jancar:
Resource Bisimilarity in Petri Nets is Decidable. Fundam. Informaticae 186(1-4): 175-194 (2022) - [i20]Petr Jancar, Jérôme Leroux:
Semilinear Home-space is Decidable for Petri Nets. CoRR abs/2207.02697 (2022) - 2020
- [i17]Petr Jancar, Petr Osicka, Zdenek Sawa:
Countdown games, and simulation on (succinct) one-counter nets. CoRR abs/2008.11753 (2020) - 2019
- [j30]Petr Jancar, David Purser:
Structural liveness of Petri nets is ExpSpace-hard and decidable. Acta Informatica 56(6): 537-552 (2019) - [j29]Petr Jancar, Jérôme Leroux, Grégoire Sutre:
Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States. Fundam. Informaticae 169(1-2): 123-150 (2019) - [c51]Petr Jancar, Sylvain Schmitz:
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. LICS 2019: 1-12 - [i16]Petr Jancar, Sylvain Schmitz:
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. CoRR abs/1901.07170 (2019) - 2018
- [j28]Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. Log. Methods Comput. Sci. 14(4) (2018) - [c50]Petr Jancar, Jérôme Leroux, Grégoire Sutre:
Co-finiteness and Co-emptiness of Reachability Sets in Vector Addition Systems with States. Petri Nets 2018: 184-203 - [c49]Petr Jancar, Petr Osicka, Zdenek Sawa:
EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets. RP 2018: 59-74 - [i15]Petr Jancar, Petr Osicka, Zdenek Sawa:
EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets. CoRR abs/1801.01073 (2018) - 2017
- [i13]Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. CoRR abs/1711.06120 (2017) - 2016
- [c47]Ondrej Meca, Stanislav Böhm, Marek Behalek, Petr Jancar:
An Approach to Verification of MPI Applications Defined in a High-Level Model. ACSD 2016: 55-64 - [c46]Stanislav Böhm, Ondrej Meca, Petr Jancar:
State-Space Reduction of Non-deterministically Synchronizing Systems Applicable to Deadlock Detection in MPI. FM 2016: 102-118 - 2015
- [j26]Petr Jancar, Prateek Karandikar, Philippe Schnoebelen:
On Reachability for Unidirectional Channel Systems Extended with Regular Tests. Log. Methods Comput. Sci. 11(2) (2015) - [c44]Wojciech Czerwinski, Petr Jancar:
Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME. LICS 2015: 168-179 - 2014
- [j25]Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Language equivalence of probabilistic pushdown automata. Inf. Comput. 237: 1-11 (2014) - [j24]Stanislav Böhm, Stefan Göller, Petr Jancar:
Bisimulation equivalence and regularity for real-time one-counter automata. J. Comput. Syst. Sci. 80(4): 720-743 (2014) - [i9]Wojciech Czerwinski, Petr Jancar:
Branching Bisimilarity of Normed BPA Processes is in NEXPTIME. CoRR abs/1407.0645 (2014) - 2013
- [c40]Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa:
Complexity of Checking Bisimilarity between Sequential and Parallel Processes. MFCS 2013: 302-313 - [c39]Stanislav Böhm, Stefan Göller, Petr Jancar:
Equivalence of deterministic one-counter automata is NL-complete. STOC 2013: 131-140 - [i8]Stanislav Böhm, Stefan Göller, Petr Jancar:
Equivalence of Deterministic One-Counter Automata is NL-complete. CoRR abs/1301.2181 (2013) - [i7]Petr Jancar, Jirí Srba:
Note on Undecidability of Bisimilarity for Second-Order Pushdown Processes. CoRR abs/1303.0780 (2013) - 2012
- [c38]Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Bisimilarity of Probabilistic Pushdown Automata. FSTTCS 2012: 448-460 - [c37]Petr Jancar, Prateek Karandikar, Philippe Schnoebelen:
Unidirectional Channel Systems Can Be Tested. IFIP TCS 2012: 149-163 - [i4]Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Bisimilarity of Probabilistic Pushdown Automata. CoRR abs/1210.2273 (2012) - 2010
- [j22]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) - [j21]Petr Jancar, Martin Kot, Zdenek Sawa:
Complexity of deciding bisimilarity between normed BPA and normed BPP. Inf. Comput. 208(10): 1193-1205 (2010) - [c35]Stanislav Böhm, Stefan Göller, Petr Jancar:
Bisimilarity of One-Counter Processes Is PSPACE-Complete. CONCUR 2010: 177-191 - [c34]Tomás Brázdil, Petr Jancar, Antonín Kucera:
Reachability Games on Extended Vector Addition Systems with States. ICALP (2) 2010: 478-489 - [i3]Tomás Brázdil, Petr Jancar, Antonín Kucera:
Reachability Games on Extended Vector Addition Systems with States. CoRR abs/1002.2557 (2010) - 2009
- [j20]Zdenek Sawa, Petr Jancar:
Hardness of equivalence checking for composed finite-state systems. Acta Informatica 46(3): 169-191 (2009) - 2008
- [j19]Javier Esparza, Petr Jancar, Alexander Miller:
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs. Fundam. Informaticae 86(3): 227-253 (2008) - [j17]Petr Jancar, Jirí Srba:
Undecidability of bisimilarity by defender's forcing. J. ACM 55(1): 5:1-5:26 (2008) - [c33]Petr Jancar, Martin Kot, Zdenek Sawa:
Normed BPA vs. Normed BPP Revisited. CONCUR 2008: 434-446 - 2007
- [j16]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) - 2006
- [j14]Antonín Kucera, Petr Jancar:
Equivalence-checking on infinite-state systems: Techniques and results. Theory Pract. Log. Program. 6(3): 227-264 (2006) - [c31]Javier Esparza, Petr Jancar, Alexander Miller:
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs. ACSD 2006: 47-56 - [c30]Petr Jancar, Jirí Srba:
Undecidability Results for Bisimilarity on Prefix Rewrite Systems. FoSSaCS 2006: 277-291 - 2005
- [j13]Zdenek Sawa, Petr Jancar:
Behavioural Equivalences on Finite-State Systems are PTIME-hard. Comput. Artif. Intell. 24(5): 513-528 (2005) - [c29]Mark Schäfer, Walter Vogler, Petr Jancar:
Determinate STG Decomposition of Marked Graphs. ICATPN 2005: 365-384 - [i1]Antonín Kucera, Petr Jancar:
Equivalence-Checking on Infinite-State Systems: Techniques and Results. CoRR abs/cs/0505025 (2005) - 2004
- [j12]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) - [c28]Petr Jancar, Jirí Srba:
Highly Undecidable Questions for Process Algebras. IFIP TCS 2004: 507-520 - 2003
- [c27]Petr Jancar, Antonín Kucera, Faron Moller:
Deciding Bisimilarity between BPA and BPP Processes. CONCUR 2003: 157-171 - 2002
- [c25]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 - [c24]Antonín Kucera, Petr Jancar:
Equivalence-Checking with Infinite-State Systems: Techniques and Results. SOFSEM 2002: 41-73 - [e2]Lubos Brim, Petr Jancar, Mojmír Kretínský, Antonín Kucera:
CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings. Lecture Notes in Computer Science 2421, Springer 2002, ISBN 3-540-44043-7 [contents] - 2001
- [j10]Petr Jancar, Antonín Kucera, Richard Mayr:
Deciding bisimulation-like equivalences with finite-state processes. Theor. Comput. Sci. 258(1-2): 409-433 (2001) - [c23]Zdenek Sawa, Petr Jancar:
P-Hardness of Equivalence Testing on Finite-State Processes. SOFSEM 2001: 326-335 - 2000
- [c22]Petr Jancar, Antonín Kucera, Faron Moller:
Simulation and Bisimulation over One-Counter Processes. STACS 2000: 334-345 - 1999
- [j6]Petr Jancar, Javier Esparza, Faron Moller:
Petri Nets and Regular Processes. J. Comput. Syst. Sci. 59(3): 476-503 (1999) - [c21]Petr Jancar, Faron Moller:
Techniques for Decidability and Undecidability of Bisimilarity. CONCUR 1999: 30-45 - [c20]Catherine Dufourd, Petr Jancar, Philippe Schnoebelen:
Boundedness of Reset P/T Nets. ICALP 1999: 301-310 - [c19]Petr Jancar, Faron Moller, Zdenek Sawa:
Simulation Problems for One-Counter Machines. SOFSEM 1999: 404-413 - 1998
- [c17]Petr Jancar, Antonín Kucera, Richard Mayr:
Deciding Bisimulation-Like Equivalences with Finite-State Processes. ICALP 1998: 200-211 - [c16]Petr Jancar, Mojmír Kretínský:
Preface. MFCS Workshop on Concurrency 1998: 1-2 - [e1]Petr Jancar, Mojmír Kretínský:
Proceedings of the MFCS '98 Workshop on Concurrency, Brno, Czech Republic, August 27-29, 1998. Electronic Notes in Theoretical Computer Science 18, Elsevier 1998 [contents] - 1997
- [c11]Petr Jancar, Antonín Kucera:
Bisimilarity of processes with finite-state systems. INFINITY 1997: 41 - 1996
- [c10]Petr Jancar, Javier Esparza:
Deciding Finiteness of Petri Nets Up To Bisimulation. ICALP 1996: 478-489 - 1995
- [c9]Petr Jancar, Faron Moller:
Checking Regular Properties of Petri Nets. CONCUR 1995: 348-362
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint