Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Petr Jancar"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 1 (2023)
We answer an open complexity question by Hofman, Lasota, Mayr, Totzke (LMCS 2016) for simulation preorder on the class of succinct one-counter nets (i.e., one-counter automata with no zero tests where counter increments and decrements are integers wr
Externí odkaz:
https://doaj.org/article/46a67b816f65446fab49a768f3f6b314
Autor:
Petr Jancar
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 4 (2017)
The paper presents an elaborated and simplified version of the structural result for branching bisimilarity on normed BPA (Basic Process Algebra) processes that was the crux of a conference paper by Czerwinski and Jancar (arxiv 7/2014 and LiCS 2015).
Externí odkaz:
https://doaj.org/article/41802e6fdcee4637b3d9a8b0a8f39509
Autor:
Petr Jancar
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 1 (2013)
Burkart, Caucal, Steffen (1995) showed a procedure deciding bisimulation equivalence of processes in Basic Process Algebra (BPA), i.e. of sequential processes generated by context-free grammars. They improved the previous decidability result of Chris
Externí odkaz:
https://doaj.org/article/15663bf701ef4eddb662642d0a7164f6
Publikováno v:
Logical Methods in Computer Science, Volume 11, Issue 2 (April 17, 2015) lmcs:876
"Unidirectional channel systems" (Chambart & Schnoebelen, CONCUR 2008) are finite-state systems where one-way communication from a Sender to a Receiver goes via one reliable and one unreliable unbounded fifo channel. While reachability is decidable f
Externí odkaz:
http://arxiv.org/abs/1406.5067
Autor:
Petr Jancar
Publikováno v:
Theoretical Computer Science. 903:26-38
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74e7796f77e5ca15742ecc7759a4806a
https://doi.org/10.1016/j.tcs.2021.11.027
https://doi.org/10.1016/j.tcs.2021.11.027
Autor:
Petr Jancar
Publikováno v:
Journal of Computer and System Sciences. 115:86-112
A decidability proof for bisimulation equivalence of first-order grammars is given. It is an alternative proof for a result by S\'enizergues (1998, 2005) that subsumes his affirmative solution of the famous decidability question for deterministic pus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30c2e6515d049e28a3ed304253af9e7a
https://doi.org/10.1016/j.jcss.2020.07.004
https://doi.org/10.1016/j.jcss.2020.07.004
Autor:
Zdenek Matej, Filip Mravec, Vaclav Prenosil, František Cvachovec, Ales Jancar, Evzen Novak, Petr Jancar, Michal Kostal, Petr Alexa, Radim Uhlar
Publikováno v:
EPJ Web of Conferences, Vol 247, p 18004 (2021)
This article focuses on description of two different neutron fields from linear and cylindrical Inertial Electrostatic Confinement (IEC) neutron generators. Both of these generators are well defined and commonly used. They use a deuterium-tritium rea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cadeb4c5652316cb8fcf6f648cf50dac
https://www.epj-conferences.org/articles/epjconf/pdf/2021/01/epjconf_physor2020_18004.pdf
https://www.epj-conferences.org/articles/epjconf/pdf/2021/01/epjconf_physor2020_18004.pdf
Autor:
Petr Jancar, David Purser
Place/transition Petri nets are a standard model for a class of distributed systems whose reachability spaces might be infinite. One of well-studied topics is verification of safety and liveness properties in this model; despite an extensive research
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3de3e3476644f6449394c60e89944595
http://wrap.warwick.ac.uk/120838/1/WRAP-structural-liveness-Petri-nets-Purser-2019.pdf
http://wrap.warwick.ac.uk/120838/1/WRAP-structural-liveness-Petri-nets-Purser-2019.pdf
Autor:
Petr Jancar, Sylvain Schmitz
Publikováno v:
LICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--12, ⟨10.1109/LICS.2019.8785848⟩
LICS
LICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--12, ⟨10.1109/LICS.2019.8785848⟩
LICS
International audience; Checking whether two pushdown automata with restricted silent actions are weakly bisimilar was shown decidable by Sénizergues (1998, 2005). We provide the first known complexity upper bound for this famous problem, in the equ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3cb0df2dd8db69038ff6a4d31c4a1d6
https://hal.archives-ouvertes.fr/hal-02267529
https://hal.archives-ouvertes.fr/hal-02267529
Publikováno v:
PETRI NETS 2018-39th International Conference on the Application and Theory of Petri Nets and Concurrency
PETRI NETS 2018-39th International Conference on the Application and Theory of Petri Nets and Concurrency, Jun 2018, Bratislava, Slovakia. pp.184-203, ⟨10.1007/978-3-319-91268-4_10⟩
Application and Theory of Petri Nets and Concurrency ISBN: 9783319912677
Petri Nets
Fundamenta Informaticae
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2019, 169 (1-2), pp.123-150. ⟨10.3233/FI-2019-1841⟩
PETRI NETS 2018-39th International Conference on the Application and Theory of Petri Nets and Concurrency, Jun 2018, Bratislava, Slovakia. Springer, 10877, pp.184-203, LNCS. 〈10.1007/978-3-319-91268-4_10〉
PETRI NETS 2018-39th International Conference on the Application and Theory of Petri Nets and Concurrency, Jun 2018, Bratislava, Slovakia. pp.184-203, ⟨10.1007/978-3-319-91268-4_10⟩
Application and Theory of Petri Nets and Concurrency ISBN: 9783319912677
Petri Nets
Fundamenta Informaticae
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2019, 169 (1-2), pp.123-150. ⟨10.3233/FI-2019-1841⟩
PETRI NETS 2018-39th International Conference on the Application and Theory of Petri Nets and Concurrency, Jun 2018, Bratislava, Slovakia. Springer, 10877, pp.184-203, LNCS. 〈10.1007/978-3-319-91268-4_10〉
International audience; The coverability and boundedness problems are well-known exponential-space complete problems for vector addition systems with states (or Petri nets). The boundedness problem asks if the reachabi-lity set (for a given initial c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ee50f376123695716f2eceb64088983
https://hal.archives-ouvertes.fr/hal-01792566/file/JancarLerouxSutre-ICATPN18.pdf
https://hal.archives-ouvertes.fr/hal-01792566/file/JancarLerouxSutre-ICATPN18.pdf