Browsing by Author "Jančar, Petr"
Now showing items 1-20 of 58
-
Algorithms for Parity Games
Velkoborský, Jakub (Bakalářská práce, 2010) -
Analýza distribuovaných algoritmů pomocí Petriho sítí
Jankovský, Tomáš (Diplomová práce, 2011) -
Automatic Simulation of Human-based Processes
Kuchař, Štěpán (Disertační práce, 2014) -
Behavioural equivalences on finite-state systems are PTIME-hard
Sawa, Zdeněk; Jančar, Petr (Computing and Informatics. 2005, vol. 24, no. 5, p. 513-528.) -
Bisimilarity on basic process algebra is in 2-exptime (an explicit proof)
Jančar, Petr (Logical Methods in Computer Science. 2013, vol. 9, issue 1, art. no. 10.) -
Bisimulation equivalence and regularity for real-time one-counter automata
Böhm, Stanislav; Göller, Stefan; Jančar, Petr (Journal of Computer and System Sciences. 2014, vol. 80, issue 4, p. 720-743.) -
Bisimulation equivalence is decidable for one-counter processes
Jančar, Petr (Automata, Languages and Programming : 24th International Colloquium, ICALP '97 Bologna, Italy, July 7–11, 1997. Proceedings. 1997, p. 549-559.) -
Bouziane’s transformation of the Petri net reachability problem and incorrectness of the related algorithm
Jančar, Petr (Information and Computation. 2008, vol. 206, issue 11, p. 1259-1263.) -
Branching bisimilarity of normed BPA processes as a rational monoid
Jančar, Petr (Logical Methods in Computer Science. 2017, vol. 13, issue 4, art. no. 17.) -
Complexity and decidability of some equivalence-checking problems
Sawa, Zdeněk (Disertační práce, 2005) -
Complexity of deciding bisimilarity between normed BPA and normed BPP
Jančar, Petr; Kot, Martin; Sawa, Zdeněk (Information and Computation. 2010, vol. 208, issue 10, p. 1193-1205.) -
Countdown games, and simulation on (succinct) one-counter nets
Jančar, Petr; Osička, Petr; Sawa, Zdeněk (Logical Methods in Computer Science. 2023, vol. 19, issue 1.) -
Decidability of bisimilarity for one-counter processes
Jančar, Petr (Information and Computation. 2000, vol. 158, issue 1, p. 1-17 .) -
Deciding bisimilarity between BPA and BPP processes
Jančar, Petr; Kučera, Antonín; Moller, Faron (CONCUR 2003 - Concurrency Theory : 14th International Conference, Marseille, France, September 3-5, 2003. Proceedings. 2003, p. 159-173.) -
Deciding bisimulation-like equivalences with finite-state processes
Jančar, Petr; Kučera, Antonín; Mayr, Richard (Theoretical Computer Science. 2001, vol. 258, issues 1-2, p. 409-433.) -
Deciding bisimulation-like equivalences with finite-state processes
Jančar, Petr; Kučera, Antonín; Mayr, Richard (Automata, Languages and Programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13–17, 1998. Proceedings. 1998, p. 200-211.) -
Determinate STG decomposition of marked graphs
Schäfer, Mark; Vogler, Walter; Jančar, Petr (Applications and theory of Petri Nets 2005 : 26th International Conference, ICATPN 2005, Miami, USA, June 20-25, 2005. Proceedings. 2005, p. 365-384.) -
Different Types of Monotonicity for Restarting Automata
Jančar, Petr; Mráz, František; Plátek, Martin; Vogel, Jörg (Foundations of software technology and theoretical computer science : 18th Conference, Chennai, India, December 17-19, 1998. Proceedings. 1998, p. 343-354.) -
DP lower bounds for equivalence-checking and model-checking of one-counter automata
Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk (Information and Computation. 2004, vol. 188, issue 1, p. 1-19.) -
Dynamické spolehlivostní modely na bázi Petriho sítí
Škňouřilová, Petra (Disertační práce, 2009)