default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetr Jancar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c54]Petr Jancar
, Jérôme Leroux:
On the Home-Space Problem for Petri Nets. Taming the Infinities of Concurrency 2024: 172-180- [i21]Petr Jancar:
A concise proof of Commoner's theorem. CoRR abs/2401.12067 (2024) - 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) - [j34]Petr Jancar, Jiri Valusek:
Structural Liveness of Immediate Observation Petri Nets. Fundam. Informaticae 188(3): 179-215 (2022) - [j33]Petr Jancar:
Bisimilarity on Basic Parallel Processes. Theor. Comput. Sci. 903: 26-38 (2022) - [i20]Petr Jancar, Jérôme Leroux:
Semilinear Home-space is Decidable for Petri Nets. CoRR abs/2207.02697 (2022) - 2021
- [j32]Petr Jancar:
Equivalence of pushdown automata via first-order grammars. J. Comput. Syst. Sci. 115: 86-112 (2021) - [c52]Petr Jancar, Jirí Síma:
The Simplest Non-Regular Deterministic Context-Free Language. MFCS 2021: 63:1-63:18 - [i19]Petr Jancar, Jirí Síma:
Simplest Non-Regular Deterministic Context-Free Language. CoRR abs/2102.10416 (2021) - [i18]Jiri Valusek, Petr Jancar:
Structural Liveness of Immediate Observation Petri Nets. CoRR abs/2112.15524 (2021) - 2020
- [j31]Petr Jancar:
Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence. J. Comput. Syst. Sci. 109: 22-44 (2020) - [i17]Petr Jancar, Petr Osicka, Zdenek Sawa:
Countdown games, and simulation on (succinct) one-counter nets. CoRR abs/2008.11753 (2020)
2010 – 2019
- 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) - [i14]Petr Jancar:
Equivalence of pushdown automata via first-order grammars. CoRR abs/1812.03518 (2018) - 2017
- [j27]Petr Jancar:
Branching Bisimilarity of Normed BPA Processes as a Rational Monoid. Log. Methods Comput. Sci. 13(4) (2017) - [c48]Petr Jancar:
Deciding Structural Liveness of Petri Nets. SOFSEM 2017: 91-102 - [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 - [c45]Petr Jancar:
Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence. MFCS 2016: 52:1-52:13 - [i12]Petr Jancar:
Branching Bisimilarity of Normed BPA Processes as a Rational Monoid. CoRR abs/1602.05151 (2016) - [i11]Petr Jancar:
Deciding structural liveness of Petri nets. CoRR abs/1608.02327 (2016) - 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 - [c43]Petr Jancar:
On Reachability-Related Games on Vector Addition Systems with States. RP 2015: 50-62 - 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) - [c42]Petr Jancar:
Equivalences of Pushdown Systems Are Hard. FoSSaCS 2014: 1-28 - [c41]Petr Jancar:
Bisimulation Equivalence of First-Order Grammars. ICALP (2) 2014: 232-243 - [i10]Petr Jancar:
Bisimulation Equivalence of First-Order Grammars. CoRR abs/1405.7923 (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) - [i6]Petr Jancar:
Finiteness up to bisimilarity is decidable for pushdown processes. CoRR abs/1305.0516 (2013) - [i5]Petr Jancar:
Bisimulation equivalence of first-order grammars is Ackermann-hard. CoRR abs/1312.3910 (2013) - 2012
- [j23]Petr Jancar:
Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof). Log. Methods Comput. Sci. 9(1) (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 - [c36]Petr Jancar:
Decidability of DPDA Language Equivalence via First-Order Grammars. LICS 2012: 415-424 - [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) - [i2]Petr Jancar:
Short Decidability Proof for DPDA Language Equivalence via 1st Order Grammar Bisimilarity. CoRR abs/1010.4760 (2010)
2000 – 2009
- 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) - [j18]Petr Jancar:
Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm. Inf. Comput. 206(11): 1259-1263 (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 - [c32]Petr Jancar:
Selected Ideas Used for Decidability and Undecidability of Bisimilarity. Developments in Language Theory 2008: 56-71 - 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) - [j15]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
Monotonicity of Restarting Automata. J. Autom. Lang. Comb. 12(3): 355-371 (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 - [c26]Petr Jancar:
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete. LICS 2003: 218- - 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
- [j11]Petr Jancar:
Nonprimitive recursive complexity and undecidability for Petri net equivalences. Theor. Comput. Sci. 256(1-2): 23-30 (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
- [j9]Petr Jancar:
Decidability of Bisimilarity for One-Counter Processes. Inf. Comput. 158(1): 1-17 (2000) - [c22]Petr Jancar, Antonín Kucera, Faron Moller:
Simulation and Bisimulation over One-Counter Processes. STACS 2000: 334-345
1990 – 1999
- 1999
- [j8]Petr Jancar:
A Note on Well Quasi-Orderings for Powersets. Inf. Process. Lett. 72(5-6): 155-160 (1999) - [j7]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
On Monotonic Automata with a Restart Operation. J. Autom. Lang. Comb. 4(4): 287-311 (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
- [c18]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
Different Types of Monotonicity for Restarting Automata. FSTTCS 1998: 343-354 - [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
- [c15]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
On Restarting Automata with Rewriting. New Trends in Formal Languages 1997: 119-136 - [c14]Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel:
Deleting Automata with a Restart Operation. Developments in Language Theory 1997: 191-202 - [c13]Petr Jancar:
Bisimulation Equivalence is Decidable for One-Counter Processes. ICALP 1997: 549-559 - [c12]Frantisek Mráz, Martin Plátek, Petr Jancar, Jörg Vogel:
Monotonic Rewriting Automata with a Restart Operation. SOFSEM 1997: 505-512 - [c11]Petr Jancar, Antonín Kucera:
Bisimilarity of processes with finite-state systems. INFINITY 1997: 41 - 1996
- [j5]Petr Jancar, Frantisek Mráz, Martin Plátek:
Forgetting Automata and Context-Free Languages. Acta Informatica 33(5): 409-420 (1996) - [c10]Petr Jancar, Javier Esparza:
Deciding Finiteness of Petri Nets Up To Bisimulation. ICALP 1996: 478-489 - 1995
- [j4]Petr Jancar:
All action-based behavioural equivalences are undecidable for labelled Petri nets. Bull. EATCS 56 (1995) - [j3]Petr Jancar:
Undecidability of Bisimilarity for Petri Nets and Some Related Problems. Theor. Comput. Sci. 148(2): 281-301 (1995) - [c9]Petr Jancar, Faron Moller:
Checking Regular Properties of Petri Nets. CONCUR 1995: 348-362 - [c8]Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel:
Restarting Automata, Marcus Grammars and Context-Free Languages. Developments in Language Theory 1995: 102-111 - [c7]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
Restarting Automata. FCT 1995: 283-292 - [c6]Petr Jancar:
High Undecidability of Weak Bisimilarity for Petri Nets. TAPSOFT 1995: 349-363 - 1994
- [c5]Petr Jancar:
Decidability Questions for Bismilarity of Petri Nets and Some Related Problems. STACS 1994: 581-592 - 1993
- [j2]Rodney R. Howell, Petr Jancar, Louis E. Rosier:
Completeness Results for Single-Path Petri Nets. Inf. Comput. 106(2): 253-265 (1993) - [c4]Petr Jancar, Frantisek Mráz, Martin Plátek:
A Taxonomy of Forgetting Automata. MFCS 1993: 527-536 - 1992
- [c3]Petr Jancar, Frantisek Mráz, Martin Plátek:
Characterization of Context-Free Languages by Erasing Automata. MFCS 1992: 307-314 - 1991
- [c2]Rodney R. Howell, Petr Jancar, Louis E. Rosier:
Single-Path Petri Nets. MFCS 1991: 202-210 - 1990
- [j1]Petr Jancar:
Decidability of a Temporal Logic Problem for Petri Nets. Theor. Comput. Sci. 74(1): 71-93 (1990)
1980 – 1989
- 1989
- [c1]Petr Jancar:
Decidability of Waek Fairness in Petri Nets. STACS 1989: 446-457
Coauthor Index
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-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
