Tomáš Masopust

Z ApolloWiki
Přejít na:navigace, hledání

doc. RNDr. Tomáš Masopust, Ph.D., DSc.

doc. RNDr. Tomáš Masopust, Ph.D., DSc.

Research interests:

Automata theory - Complexity theory - Cyber-physical systems - Databases - Discrete-event systems - Petri nets - Systems and control - Verification and model checking

Remember, for every submitted paper, you should review two or three papers.

[upravit]

Jan Komenda, Tomáš Masopust
IEEE Transactions on Automatic Control 68(12), 7286-7298, 2023

Jiří Balun, Petr Osička, Tomáš Masopust
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), 2023

Jiří Balun, Tomáš Masopust
IEEE International Conference on Systems, Man, and Cybernetics (SMC), 2022

Yingying Liu, Tomáš Masopust, Jan Komenda, Zhiwu Li
Automatica 142, 110431, 2022

Tomáš Masopust, Markus Krötzsch
Logical Methods in Computer Science 17(2), 14:1-14:36, 2021

All publications


[upravit]
Dynamická webová prezentace PřF pomocí Semantic MediaWiki

bachelor's thesis
Supervisor: Tomáš Masopust
Student/s: Václav Procházka

Student se seznámí s nástroji Semantic Wiki a Semantic MediaWiki a jejich rozšířeními. Pomocí těchto nástrojů vytvoří dynamickou webovou prezentaci vhodnou pro katedry PřF UP a jejich zaměstnance.

Piecewise testability

bachelor's thesis
Supervisor: Tomáš Masopust
Student/s: Eliška Foltasová
2021
EliskaFoltasovaBakalarskaPrace.pdf, Piecewise-testability-libFAUDES-plugin.tar.gz

Relative observability

bachelor's thesis
Supervisor: Tomáš Masopust
Student/s: Marián Pochyba
2018
MarianPochybaBakalarskaPraca.pdf, Relative-observability-libFAUDES-plugin.zip

All theses









[upravit]
Coordination control plug-in

Coordination control plug-in

Tomáš Masopust
website
Description: Coordination Control Plug-In for libFAUDES C++ library (distributed under conditions of the GNU Lesser General Public License LGPL)

  • Version: released on Feb 5, 2012. Included in the official libFAUDES distribution since version 2.21e.
  • Description: Complete coordination control synthesis procedure for the computation of the supremal conditionally controllable sublanguage of a given prefix-closed global specification language K and a set of local subsystems, corresponding supervisors, and the supervised coordinator. (The case of non-prefix-closed global specifications is under investigation...)
  • Updates: Polynomial algorithm for conditional decomposability included since version 2.26
The International Center for Computational Logic

The International Center for Computational Logic

Center for Computational Logic website
Description: Portal for the International Center for Computational Logic at TU Dresden, 2014. Powered by MediaWiki and Semantic MediaWiki.