Activities
2013
Publications:
 Stanislav Böhm, Stefan Göller, Petr Jančar: Bisimulation equivalence and regularity for realtime onecounter automata, Journal of Computer and System Sciences, http://dx.doi.org/10.1016/j.jcss.2013.11.003
 Stanislav Böhm, Stefan Göller, Petr Jančar: Equivalence of Deterministic OneCounter Automata is NLcomplete, 45th ACM Symposium on theory of computing (STOC), 2013, 131140
 Wojciech Czerwiński, Petr Jančar, Martin Kot, Zdeněk Sawa: Complexity of Checking Bisimilarity between Sequential and Parallel Processes. Mathematical Foundations of Computer Science (MFCS), 2013, Lecture Notes in Computer Science (LNCS) 8087, 302313
 Zdeněk Sawa: Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata, Fundamenta Informaticae, 2013, vol. 123 (issue 1), 97106
 Petr Jančar: Bisimilarity on basic process algebra is in 2ExpTime (an explicit proof), Logical Methods in Computer Science, 2013, vol. 9 (issue 1), 119
Membership (P. Jancar) in Program Committees of:
 ACSD'13 13th International Conference on Application of Concurrency to System Design
 LiCS'13 28th Annual ACM/IEEE Symposium on Logic in Computer Science
2012
Publications:
 Vojtěch Forejt, Petr Jančar, Stefan Kiefer, James Worrell: Bisimilarity of Probabilistic Pushdown Automata. ARCS Annual Conference on Foundations of Software Technology and Theoretical, Computer Science (FSTTCS), 2012, Leibniz International Proceedings in Informatics (LIPIcs) 18, 448460
 Petr Jančar: Decidability of DPDA Language Equivalence via FirstOrder Grammars, IEEE Symposium on Logic in Computer Science (LiCS), 2012, 415424

Petr Jančar, Prateek Karandikar, Philippe Schnoebelen: Unidirectional Channel Systems Can Be Tested, Theoretical Computer Science (TCS), 2012, Lecture Notes in Computer Science (LNCS)
7604, 149163  Wojciech Czerwiński, Petr Jančar, Martin Kot, Zdeněk Sawa: Complexity of Checking Bisimilarity between Sequential and Parallel Processes, Mathematical Foundations of Computer Science (MFCS), 2013, Lecture Notes in Computer Science (LNCS) 8087, 302313
 Stanislav Böhm, Stefan Göller, Petr Jančar: Equivalence of Deterministic OneCounter Automata is NLcomplete, ACM symposium on Symposium on theory of computing (STOC), 2013, 131140
 Stanislav Böhm, Marek Běhálek: Usage of petri nets for high performance computing, ACM SIGPLAN workshop on Functional highperformance computing, 2012, 3747
 Stanislav Böhm, Marek Běhálek, Ondřej Meca: Kaira: Generating Parallel Libraries and Their Usage with Octave, International Workshop on Languages and Compilers for Parallel Computing (LCPC), Lecture Notes in Computer Science 7760, 268269
 Ondřej Meca, Stanislav Böhm, Marek Běhálek, Martin Šurkovský: Visual programming of MPI applications: Debugging and performance analysis, Workshop on Advances in Programming Languages (WAPL), 2013, 14831490
 Ondřej Meca, Stanislav Böhm, Marek Běhálek, Martin Šurkovský: Prototyping framework for parallel numerical computations, International Conference on Parallel Processing and Applied Mathematics (PPAM), 2013,110
Membership (P. Jancar) in Program Committees of:
 ACSD'12 12th International Conference on Application of Concurrency to System Design
2011
Publications:
 Stanislav Böhm, Stefan Göller: Language equivalence of deterministic realtime onecounter automata is NLcomplete, Mathematical Foundations of Computer Science (MFCS), 2011,Lecture Notes in volume: Computer Science (LNCS) 6907,194205
 Stanislav Böhm, Marek Běhálek, Ondřej Garncarz: Developing parallel applications using Kaira, International Conference on Digital Information Processing and Communications, (ICDIPC), Communications in Computer and Information Science (CCIS) 189, 237251

Martin Kot: Using Uppaal for Verification of Priority Assignment in RealTime Databases
nternational Conference on Digital Information Processing and Communications (ICDIPC), Communications in Computer and Information Science (CCIS) 189, 385399  Marek Běhálek, Stanislav Böhm, Pavel Krömer, Martin Šurkovský, Ondřej Meca: Parallelization of Ant Colony Optimization Algorithm Using Kaira, International Conference on Intelligent Systems Design and Applications (ISDA), 2011, 510515
 Stanislav Böhm, Marek Běhálek: Kaira: Modelling and Generation Tool Based on Petri Nets for Parallel Applications,International Conference on Computer Modelling and Simulation (UkSim), 2011, 403408
Membership (P. Jančar, Z. Sawa) in and reviewing work (PJ, ZS, MK, SB) for Program Committees of:
 FoSSaCS'11 14th International Conference on Foundations of Software Science and Computation Structures (P. Jančar)
 ACSD'11 11th International Conference on Application of Concurrency to System Design (P. Jančar)
 MEMICS'11 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (Z. Sawa)
2010

Publications
 (During 2010 appeared the paper by Froeschle, Jancar, Lasota, Sawa reported below in 2009.)
 Jančar P., Kot M., Sawa Z.: Complexity of Deciding Bisimilarity between Normed BPA and Normed BPP, in: journal Information and Computation, Volume 208, Number 10, October 2010, Elsevier, pages 11931205, ISSN 08905401, DOI 10.1016/j.ic.2009.10.012
 Böhm S., Göller S., Jančar P.: Bisimilarity of OneCounter Processes Is PSPACEComplete, in: CONCUR 2010  Concurrency Theory, 21th International Conference, Lecture Notes in Computer Science, vol. 6269, Springer, 2010, ISBN 9783642153747, pages 177191
 Brázdil T., Jančar P., Kučera A.: Reachability Games on Extended Vector Addition Systems with States, in: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Lecture Notes in Computer Science, vol. 6199, Springer, 2010, ISBN 9783642141614, pages 478489
 Sawa Z.: Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA, in: Reachability Problems, 4th International Workshop, RP 2010, Lecture Notes in Computer Science, vol. 6227, Springer, 2010, ISBN 9783642153488, pages 176182
 Kot M.: Modeling and Verification of Priority Assignment in RealTime Databases Using Uppaal, in: Proceedings of the Dateso 2010 Annual International Workshop on DAtabases, TExts, Specifications and Objects, MATFYZPRESS publishing house of Faculty of Mathematics and Physics Charles University in Prague, 2010, ISBN 9788073781163, pages 147154
 Kot M.: Selected Problems from the Area of Formal Verification, PhD thesis, VŠB  Technical University of Ostrava, 2010
 Membership (P. Jancar) in and reviewing work (PJ, ZS, MK) for Program Committees of:
2009

Publications
 (During 2009 appeared the paper [SawaJancar]reported below in 2008.)
 Froeschle S., Jancar P., Lasota S., Sawa Z.: Noninterleaving bisimulation equivalences on basic parallel processes; in journal Information and Computation Volume 208, Issue 1, January 2010, Pages 4262 [http://dx.doi.org/10.1016/j.ic.2009.06.001 ]
 Kot, M.: Modeling selected realtime database concurrency control protocols in Uppaal. In: journal Innovations in Systems and Software Engineering , vol. 5 (2009), No. 2, p. 129138 [http://dx.doi.org/10.1007/s1133400900863 ]
 Membership (P. Jancar) in and reviewing work (PJ, ZS, MK) for Program Committees of:
2008

Publications
 (During 2008 appeared the papers [EJM], [Jan], [JMPV] reported below in 2007.)
 Jancar P., Srba J.: Undecidability of bisimilarity by Defender's forcing; Journal of the ACM , Vol. 55, Issue 1, Article No. 5, Feb 2008, 26 p., ACM (New York, USA), ISSN:00045411
 Petr Jancar, Martin Kot, Zdenek Sawa: Normed BPA vs. Normed BPP Revisited; in Franck van Breugel, Marsha Chechik (Eds.) CONCUR 2008  Concurrency Theory, 19th International Conference, Toronto, Canada, August 1922, 2008. Proceedings. Lecture Notes in Computer Science 5201, Springer 2008, pp. 434446 (best paper award)
 Jancar, P.: Selected Ideas Used for Decidability and Undecidability of Bisimilarity. In Proc. Developments in Language Theory, 12th International Conference, DLT 2008. Ed. Ito, Masami; Toyama, Masafumi (Eds.) , Berlin:SpringerVerlag, 2008, vol. 5257, Lecture Notes in Computer Science, pp. 5671, ISSN: 03029743, ISBN: 9783540857792 (invited talk)
 Sawa Z., Jancar P.: Hardness of equivalence checking for composed finitestate systems; to appear in the journal Acta Informatica (accepted in Sep 2008) appeared in vol. 46 (2009), No. 3, 169191 [ http://dx.doi.org/10.1007/s002360080088x ]
 Kot, M.: Modeling RealTime Database Concurrency Control Protocol TwoPhaseLocking in Uppaal. Ed. M. Ganzha, M. Paprzycki, T. PełechPilichowski, Los Alamitos, CA:IEEE Computer Society Press, 2008, p. 673678, Polskie Towarzystwo Informatyczne, ISBN 9788360810149, ISSN 18967094

Membership (P. Jancar) in and reviewing work (PJ, ZS, MK) for Program Committees of:
 FoSSaCS'08 11th International Conference on Foundations of Software Science and Computation Structures
 ACSD'08 8th International Conference on Application of Concurrency to System Design
 MoVeP'08 MOdelling and VErifying parallel Processes
 MEMICS'08 4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
2007

Publications
 Jancar P., Sawa Z.: A Note on Emptiness for Alternating Finite Automata with a OneLetter Alphabet; Information Processing Letters 104: 164167. Elsevier 2007, ISSN 00200190 (Impact Factor~0.532)
 Esparza J., Jancar P., Miller A.: On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs; to appear in the journal Fundamenta Informaticae , IOS Press, (final version accepted in May 2007), ISSN 01692968, (Impact Factor~0.586), appeared in Vol. 86, Number 3, 2008, pp. 227253
 Jancar P.: Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm; to appear in the journal Information and Computation (Elsevier, Academic Press), (final version accepted in July 2007), ISSN 08905401, (Impact Factor~1.107), appeared in Vol. 206 (2008), pp. 12591263
 Jancar P., Mraz F., Platek M., Vogel J.: Monotonicity of restarting automata; to appear in Journal of Automata, Languages and Combinatorics (Univ. Magdeburg, Germany), (final version accepted in May 2007) ISSN 1430189X, appeared (in 2008) in Vol. 12, Number 3, 2007, pp. 355  371
 Kot M.: Notes on Modeling of RealTime Database System V4DB in Verification Tool Uppaal. In Proc. Memics 2007 (Oct 2628 2007, Znojmo, CZ), MU and TU Brno, p. 8289, ISBN 9788073550776
 Talks by PJ and ZS at Embedded systems colloquium 2007 , Prague, 1 Feb 2007
 Membership (P. Jancar) in and reviewing work (PJ, ZS, MK) for Program Committees of:
2006

Main CAKpublications
 Jancar P., Srba J.: Undecidability Results for Bisimilarity on Prefix Rewrite Systems; in Aceto, L., Ingolfsdottir, A. (Eds.) Foundations of Software Science and Computation Structures, 9th International Conference, FOSSACS 2006. Vienna, Austria, March 2006, Proceedings. Lecture Notes in Computer Science. Volume 3921, Springer 2006, pp. 277291
 Esparza J., Jancar P., Miller A.: On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs; in Proceedings of the 6th International Conference on Application of Concurrency to System Design (ACSD 2006). Turku, Finland, June 2006, IEEE Computer Society 2006, pp. 4756
 Sawa Z., Jancar P.: History Preserving Bisimilarity on Basic Parallel Processes; in Proceedings of TAAPSD'06, Kiev, Ukraine, December 58, 2006
 Kot M.: Complexity of some Bisimilarity Problems between BPP and BPA or FiniteState System. In Proceedings of MOVEP 2006, Bordeaux:LaBRI, University of Bordeaux1 , 2006, p. 318323

Further (CAKrelated) publications:
 Jancar, P.: Verification of computer systems (some theoretical aspects); an invited talk at ECI'06 (Sept. 20.22., 2006, KosiceHerlany, Slovakia)

Membership (P. Jancar) in and reviewing work (PJ, ZS, MK) for Program Committees of:
 ATPN'06 27th International Conference On Application and Theory of Petri Nets and Other Models of Concurrency
 MoVeP'06 MOdelling and VErifying parallel Processes
 ICTAC'06 3rd International Colloquium On Theoretical Aspects of Computing
 MEMICS'06 2nd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
2005

Main CAKpublications
 Jancar P., Sawa Z.: On distributed bisimilarity over Basic Parallel Processes; in (Pre)proc. of the 4th Intern. Workshop on Automated Verification of InfiniteState Systems  AVIS'05 (affiliated with ETAPS'05), Edinburgh, GB, April 2005 Revised version submitted in August 2005 to the respective ENTCSvolume (devoted to AVIS 2005)
 Mark Schaefer, Walter Vogler, Petr Jancar: Determinate STG Decomposition of Marked Graphs. In Proc: Applications and Theory of Petri Nets 2005 26th International Conference, ICATPN 2005, Miami, FL, June 2025, 2005, Series: Lecture Notes in Computer Science, Vol. 3536 Ciardo, Gianfranco; Darondeau, Philippe (Eds.) Springer Verlag 2005, p. 365  384 ISBN: 3540263012
 Jancar P., Kot M., Sawa Z.: Notes on Complexity of Bisimilarity between BPA and BPP; accepted talk on EXPRESS'05 (12th International Workshop on Expressiveness in Concurrency), 27 August, 2005 San Francisco, USA (affiliated with CONCUR 2005)
 Sawa Z., Jancar P.: Behavioural Equivalences on FiniteState Systems are PTIMEhard; Computing and Informatics (CaI), Vol. 24, No. 5, 2005, pp. 513  528, (ISSN 13359150)
 Talks by PJ, ZS, MK at Embedded systems colloquium 2005 , Prague, 26 Oct 2005

Further (CAKrelated) publications:
 Jancar, P.: Verification of computer systems (theoretical aspects) (in Czech); an invited talk at STTI 2005, Prague, May 2005
 Sawa, Z.: Hardness of equivalence testing at finite state systems (in Czech); in Proc. STTI 2005, Prague, May 2005, 4243
 Sawa, Z.: Complexity and Decidability of Some EquivalenceChecking Problems. PhD thesis, defended at FEI, Techn. Univ. Ostrava, May 2005
 Sawa, Z., Kot, M.: Bisimulation equivalence of a BPP and a finitestate system can be decided in polynomial time. In Electronic Notes in Theoretical Computer Science, 2005, vol. 138, No. 3, p. 4960
 Jancar P.: Some techniques and results in deciding bisimilarity; invited talk at the Verification seminar, ULB Brussels, Belgium, December 16, 2005
 Kot, M.: Regularity of BPP is PSPACEcomplete. In Proceedings of the 3th annual workshop WOFEX 2005. Ed. Václav Snášel, Technical University of Ostrava, 2005, p. 393398 (ISBN 8024808668)

Membership (P. Jancar) in and reviewing work (PJ, ZS, MK) for Program Committees of:
 FoSSaCS'05 8th International Conference on Foundations of Software Science and Computation Structures
 ATPN'05 26th International Conference On Application and Theory of Petri Nets and Other Models of Concurrency
 Infinity'05 7th International Workshop on Verification of InfiniteState Systems