Thomas Moor

642 total citations
34 papers, 342 citations indexed

About

Thomas Moor is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Control and Systems Engineering. According to data from OpenAlex, Thomas Moor has authored 34 papers receiving a total of 342 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Computational Theory and Mathematics, 12 papers in Computer Networks and Communications and 7 papers in Control and Systems Engineering. Recurrent topics in Thomas Moor's work include Petri Nets in System Modeling (31 papers), Formal Methods in Verification (25 papers) and Distributed systems and fault tolerance (12 papers). Thomas Moor is often cited by papers focused on Petri Nets in System Modeling (31 papers), Formal Methods in Verification (25 papers) and Distributed systems and fault tolerance (12 papers). Thomas Moor collaborates with scholars based in Germany, Türkiye and Australia. Thomas Moor's co-authors include Ece Güran Schmidt, Jörg Raisch, Siu O’Young, Anne-Kathrin Schmuck, Rupak Majumdar, Jan Richter, Johann Reger, J.M. Davoren, Tae-Sic Yoo and Jung–Min Yang and has published in prestigious journals such as IEEE Transactions on Automatic Control, Annual Reviews in Control and IFAC-PapersOnLine.

In The Last Decade

Thomas Moor

33 papers receiving 333 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Thomas Moor Germany 11 315 111 67 65 63 34 342
S. Hashtrudi Zad Canada 9 430 1.4× 89 0.8× 181 2.7× 52 0.8× 193 3.1× 15 493
Wenbin Qiu United States 8 369 1.2× 132 1.2× 77 1.1× 29 0.4× 155 2.5× 16 400
J.G. Thistle Canada 12 454 1.4× 211 1.9× 36 0.5× 92 1.4× 58 0.9× 31 499
Hugo Flordal Sweden 9 497 1.6× 170 1.5× 39 0.6× 81 1.2× 157 2.5× 16 537
Liyong Lin Singapore 11 229 0.7× 99 0.9× 88 1.3× 79 1.2× 27 0.4× 42 326
G. Hoffmann United States 6 289 0.9× 78 0.7× 43 0.6× 79 1.2× 73 1.2× 9 314
W. M. Wonham Canada 7 244 0.8× 97 0.9× 25 0.4× 47 0.7× 28 0.4× 9 262
Andrei Karatkevich Poland 11 254 0.8× 40 0.4× 36 0.5× 105 1.6× 97 1.5× 37 335
R. Cieślak United States 6 441 1.4× 251 2.3× 38 0.6× 91 1.4× 81 1.3× 10 498
Changyan Zhou United States 10 329 1.0× 104 0.9× 23 0.3× 31 0.5× 82 1.3× 29 354

Countries citing papers authored by Thomas Moor

Since Specialization
Citations

This map shows the geographic impact of Thomas Moor'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 Thomas Moor with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Moor more than expected).

Fields of papers citing papers by Thomas Moor

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Thomas Moor. 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 Thomas Moor. The network helps show where Thomas Moor may publish in the future.

Co-authorship network of co-authors of Thomas Moor

This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Moor. A scholar is included among the top collaborators of Thomas Moor 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 Thomas Moor. Thomas Moor is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Moor, Thomas, et al.. (2024). Compositional non-blockingness verification of finite automata with prioritised events. Discrete Event Dynamic Systems. 34(1). 125–161. 1 indexed citations
2.
Moor, Thomas, et al.. (2022). Compositional Verification of Non-Blockingness with Prioritised Events. IFAC-PapersOnLine. 55(28). 236–243. 1 indexed citations
3.
Moor, Thomas, et al.. (2021). Behaviour equivalent max-plus automata for timed petri nets under open-loop race-policy semantics. Discrete Event Dynamic Systems. 31(4). 583–607. 2 indexed citations
4.
Schmuck, Anne-Kathrin, Thomas Moor, & Klaus Werner Schmidt. (2020). A Reactive Synthesis Approach to Supervisory Control of Terminating Processes. IFAC-PapersOnLine. 53(2). 2149–2156. 3 indexed citations
5.
Yang, Jung–Min, Thomas Moor, & Jörg Raisch. (2020). Refinements of behavioural abstractions for the supervisory control of hybrid systems. Discrete Event Dynamic Systems. 30(3). 533–560. 4 indexed citations
6.
Schmuck, Anne-Kathrin, Thomas Moor, & Rupak Majumdar. (2019). On the relation between reactive synthesis and supervisory control of non-terminating processes. Discrete Event Dynamic Systems. 30(1). 81–124. 17 indexed citations
7.
Yang, Jung–Min, Thomas Moor, & Jörg Raisch. (2018). Local Refinement of l-complete Approximations for Supervisory Control of Hybrid Systems. IFAC-PapersOnLine. 51(7). 472–479. 1 indexed citations
8.
Moor, Thomas. (2016). A discussion of fault-tolerant supervisory control in terms of formal languages. Annual Reviews in Control. 41. 159–169. 17 indexed citations
9.
Moor, Thomas, et al.. (2014). A hierarchical and modular control architecture for sequential behaviours. Discrete Event Dynamic Systems. 25(1-2). 95–124. 5 indexed citations
10.
Moor, Thomas, et al.. (2013). Consistent abstractions for the purpose of supervisory control. 7291–7296. 2 indexed citations
11.
Boutalis, Yiannis S., Thomas Moor, & Ece Güran Schmidt. (2012). Fuzzy Hybrid Systems modeling with application in decision making and control. OpenMETU (Middle East Technical University). 290–296.
12.
Moor, Thomas, et al.. (2012). A Hierarchical Control Architecture for Sequential Behaviours. IFAC Proceedings Volumes. 45(29). 259–264. 5 indexed citations
13.
Richter, Jan, et al.. (2012). Fault-Tolerant Control of Discrete Event Systems based on Fault-Accommodating Models. IFAC Proceedings Volumes. 45(20). 854–859. 22 indexed citations
14.
Moor, Thomas, et al.. (2011). Abstraction-Based Control for Not Necessarily Closed Behaviours. IFAC Proceedings Volumes. 44(1). 6988–6993. 5 indexed citations
15.
Raisch, Jörg, et al.. (2010). Distributed State Estimation for Hybrid and Discrete Event Systems Using l-Complete Approximations. IFAC Proceedings Volumes. 43(12). 129–134. 5 indexed citations
16.
Schmidt, Ece Güran, et al.. (2008). Nonblocking Hierarchical Control of Decentralized Discrete Event Systems. IEEE Transactions on Automatic Control. 53(10). 2252–2265. 74 indexed citations
17.
Moor, Thomas, et al.. (2008). Controller synthesis for an I/O-Based hierarchical system architecture. OpenMETU (Middle East Technical University). 474–479. 10 indexed citations
18.
Moor, Thomas, et al.. (2008). libFAUDES — An open source C++ library for discrete event systems. OpenMETU (Middle East Technical University). 125–130. 18 indexed citations
19.
Schmidt, Ece Güran, et al.. (2005). NONBLOCKING HIERARCHICAL CONTROL OF DECENTRALIZED DES. IFAC Proceedings Volumes. 38(1). 163–168. 1 indexed citations
20.
Moor, Thomas, Jörg Raisch, & Siu O’Young. (2002). Discrete Supervisory Control of Hybrid Systems Based on l-Complete Approximations. Discrete Event Dynamic Systems. 12(1). 83–107. 58 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

Rankless by CCL
2026