Zobrazeno 1 - 10
of 150
pro vyhledávání: '"Srba, Jiří"'
Publikováno v:
Fundamenta Informaticae, Volume 189, Issues 3-4: Reachability Problems 2020 and 2021 (October 14, 2023) fi:9351
Colored Petri nets offer a compact and user friendly representation of the traditional P/T nets and colored nets with finite color ranges can be unfolded into the underlying P/T nets, however, at the expense of an exponential explosion in size. We pr
Externí odkaz:
http://arxiv.org/abs/2204.07039
Autor:
Goorden, Martijn A., Larsen, Kim G., Nielsen, Jesper E., Nielsen, Thomas D., Qian, Weizhu, Rasmussen, Michael R., Srba, Jiří, Zhao, Guohan
Publikováno v:
In Nonlinear Analysis: Hybrid Systems August 2024 53
Autor:
Goorden, Martijn A., Larsen, Kim G., Nielsen, Jesper E., Nielsen, Thomas D., Rasmussen, Michael R., Srba, Jiri
Storm water detention ponds are used to manage the discharge of rainfall runoff from urban areas to nearby streams. Their purpose is to reduce the hydraulic impact and sediment loads of the receiving waters. Detention ponds are currently designed bas
Externí odkaz:
http://arxiv.org/abs/2104.12509
Autor:
Bønneland, Frederik Meyer, Jensen, Peter Gjøl, Larsen, Kim Guldstrand, Muñiz, Marco, Srba, Jiří
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 1 (March 18, 2021) lmcs:5997
Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial order reduct
Externí odkaz:
http://arxiv.org/abs/1912.09875
Publikováno v:
In Science of Computer Programming August 2023 230
Publikováno v:
In Science of Computer Programming August 2023 230
Publikováno v:
EPTCS 220, 2016
This volume contains the joint proceedings of the Workshop on Games for the Synthesis of Complex Systems (CASSTING'16) and of the 3rd International Workshop on Synthesis of Complex Parameters (SynCoP'16). The workshops were held in Eindhoven, The Net
Externí odkaz:
http://arxiv.org/abs/1608.00177
Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even for various
Externí odkaz:
http://arxiv.org/abs/1504.07838
Autor:
Ferus, Martin, Petera, Lukáš, Koukal, Jakub, Lenža, Libor, Drtinová, Barbora, Haloda, Jakub, Matýsek, Dalibor, Pastorek, Adam, Laitl, Vojtěch, Poltronieri, Renato Cassio, Domingues, Marcelo Wagner, Gonçalves, Gabriel, del Olmo Sato, Rodrigo, Knížek, Antonín, Kubelík, Petr, Křivková, Anna, Srba, Jiří, di Pietro, Carlos Augusto, Bouša, Milan, Vaculovič, Tomáš, Civiš, Svatopluk
Publikováno v:
In Icarus 1 May 2020 341
Autor:
Jančar, Petr, Srba, Jiří
Broadbent and G\"oller (FSTTCS 2012) proved the undecidability of bisimulation equivalence for processes generated by epsilon-free second-order pushdown automata. We add a few remarks concerning the used proof technique, called Defender's forcing, an
Externí odkaz:
http://arxiv.org/abs/1303.0780