Tomáš Masopust

908 total citations
66 papers, 375 citations indexed

About

Tomáš Masopust is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Tomáš Masopust has authored 66 papers receiving a total of 375 indexed citations (citations by other indexed papers that have themselves been cited), including 57 papers in Computational Theory and Mathematics, 31 papers in Artificial Intelligence and 26 papers in Molecular Biology. Recurrent topics in Tomáš Masopust's work include Petri Nets in System Modeling (32 papers), Formal Methods in Verification (29 papers) and semigroups and automata theory (26 papers). Tomáš Masopust is often cited by papers focused on Petri Nets in System Modeling (32 papers), Formal Methods in Verification (29 papers) and semigroups and automata theory (26 papers). Tomáš Masopust collaborates with scholars based in Czechia, Netherlands and Germany. Tomáš Masopust's co-authors include Jan Komenda, Jan H. van Schuppen, Xiang Yin, Galina Jirásková, Spyros Reveliotis, Alexander Meduna, André C. M. Ran, Olivier Boutin, Michaël Thomazo and Markus Krötzsch and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Automatic Control and Automatica.

In The Last Decade

Tomáš Masopust

59 papers receiving 368 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Tomáš Masopust Czechia	11	298	130	107	80	71	66	375
Raymond Devillers Belgium	12	438 1.5×	182 1.4×	132 1.2×	31 0.4×	11 0.2×	75	582
Thomas Moor Germany	11	315 1.1×	111 0.9×	37 0.3×	8 0.1×	67 0.9×	34	342
Jeremy Sproston Italy	8	397 1.3×	79 0.6×	166 1.6×	26 0.3×	13 0.2×	25	494
Pieter S. Kritzinger South Africa	10	121 0.4×	137 1.1×	36 0.3×	12 0.1×	24 0.3×	30	301
Kirill Bogdanov United Kingdom	11	156 0.5×	141 1.1×	159 1.5×	10 0.1×	11 0.2×	24	553
Thierry Gautier France	11	161 0.5×	88 0.7×	59 0.6×	48 0.6×	29 0.4×	44	391
Bernd Finkbeiner Germany	13	426 1.4×	147 1.1×	385 3.6×	11 0.1×	19 0.3×	74	611
Toshimasa Watanabe Japan	11	302 1.0×	186 1.4×	37 0.3×	17 0.2×	4 0.1×	37	380
Marcello M. Bersani Italy	11	128 0.4×	82 0.6×	136 1.3×	7 0.1×	11 0.2×	42	266
Janétte Cardoso France	8	114 0.4×	40 0.3×	42 0.4×	6 0.1×	43 0.6×	22	200

Countries citing papers authored by Tomáš Masopust

Since Specialization

Citations

This map shows the geographic impact of Tomáš Masopust's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tomáš Masopust with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tomáš Masopust more than expected).

Fields of papers citing papers by Tomáš Masopust

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tomáš Masopust. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tomáš Masopust. The network helps show where Tomáš Masopust may publish in the future.

Co-authorship network of co-authors of Tomáš Masopust

This figure shows the co-authorship network connecting the top 25 collaborators of Tomáš Masopust. A scholar is included among the top collaborators of Tomáš Masopust based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Tomáš Masopust. Tomáš Masopust is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Masopust, Tomáš, et al.. (2023). Verifying weak and strong k-step opacity in discrete-event systems. Automatica. 155. 111153–111153. 5 indexed citations

Komenda, Jan & Tomáš Masopust. (2023). Supervisory Control of Modular Discrete-Event Systems Under Partial Observation: Normality. IEEE Transactions on Automatic Control. 69(6). 3796–3807. 3 indexed citations

Masopust, Tomáš, et al.. (2022). On Verification of Weak and Strong k-step Opacity for Discrete-Event Systems*. IFAC-PapersOnLine. 55(28). 108–113. 6 indexed citations

Masopust, Tomáš & Markus Krötzsch. (2021). Partially Ordered Automata and Piecewise Testability. Logical Methods in Computer Science. Volume 17, Issue 2. 2 indexed citations

Reveliotis, Spyros, et al.. (2021). Polynomial-time optimal liveness enforcement for guidepath-based transport systems. Nonlinear Analysis Hybrid Systems. 41. 101058–101058. 2 indexed citations

Reveliotis, Spyros & Tomáš Masopust. (2019). Efficient Liveness Assessment for Traffic States in Open, Irreversible, Dynamically Routed, Zone-Controlled Guidepath-Based Transport Systems. IEEE Transactions on Automatic Control. 65(7). 2883–2898. 13 indexed citations

Masopust, Tomáš. (2019). Critical Observability for Automata and Petri Nets. IEEE Transactions on Automatic Control. 65(1). 341–346. 8 indexed citations

Lin, Liyong, Tomáš Masopust, W.M. Wonham, & Rong Su. (2018). Automatic Generation of Optimal Reductions of Distributions. IEEE Transactions on Automatic Control. 64(3). 896–911. 4 indexed citations

Masopust, Tomáš & Michaël Thomazo. (2017). On Boolean combinations forming piecewise testable languages. Theoretical Computer Science. 682. 165–179. 4 indexed citations

10.

Masopust, Tomáš. (2017). Complexity of Verifying Nonblockingness in Modular Supervisory Control. IEEE Transactions on Automatic Control. 63(2). 602–607. 7 indexed citations

11.

Masopust, Tomáš. (2017). Complexity of Infimal Observable Superlanguages. IEEE Transactions on Automatic Control. 63(1). 249–254. 2 indexed citations

12.

Masopust, Tomáš, et al.. (2011). Cooperating Distributed Grammar Systems with Random Context Grammars as Components. Acta Cybernetica. 20(2). 269–283.

13.

Masopust, Tomáš, et al.. (2011). Cooperating Distributed Grammar Systems with Random ContextGrammars as Components. Acta Cybernetica.

14.

Masopust, Tomáš, et al.. (2009). A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking.. 129–135. 1 indexed citations

15.

Masopust, Tomáš. (2009). Regulated Nondeterminism in PDAs: The Non-Regular Case. 181–194.

16.

Masopust, Tomáš, et al.. (2008). Leftmost derivations of propagating scattered context grammars: a new proof. Discrete Mathematics & Theoretical Computer Science. Vol. 10 no. 2(Automata, Logic and Semantics). 3 indexed citations

17.

Masopust, Tomáš, et al.. (2008). On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops.. Acta Cybernetica. 19(2). 325–336. 1 indexed citations

18.

Masopust, Tomáš & Alexander Meduna. (2007). Descriptional Complexity of Generalized Forbidding Grammars.. 170–177. 3 indexed citations

19.

Meduna, Alexander & Tomáš Masopust. (2007). Self-regulating finite automata. Acta Cybernetica. 18(1). 135–153. 6 indexed citations

20.

Masopust, Tomáš & Alexander Meduna. (2007). Descriptional Complexity of Grammars Regulated by Context Conditions.. 403–412. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact