Peter Niebert

736 total citations
11 papers, 209 citations indexed

About

Peter Niebert is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, Peter Niebert has authored 11 papers receiving a total of 209 indexed citations (citations by other indexed papers that have themselves been cited), including 7 papers in Computational Theory and Mathematics, 5 papers in Artificial Intelligence and 3 papers in Software. Recurrent topics in Peter Niebert's work include Formal Methods in Verification (5 papers), Model-Driven Software Engineering Techniques (3 papers) and Logic, programming, and type systems (3 papers). Peter Niebert is often cited by papers focused on Formal Methods in Verification (5 papers), Model-Driven Software Engineering Techniques (3 papers) and Logic, programming, and type systems (3 papers). Peter Niebert collaborates with scholars based in France. Peter Niebert's co-authors include Paul Caspi, Christos Sofronis, Stavros Tripakis, Aude Maignan, Pedro R. D’Argenio, Denis Lugiez, Wojciech Penczek, Sergio Yovine, Oded Maler and Eugène Asarin and has published in prestigious journals such as Theoretical Computer Science, ACM SIGPLAN Notices and European Journal of Control.

In The Last Decade

Peter Niebert

11 papers receiving 192 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Peter Niebert France 6 146 138 46 42 32 11 209
Kåre J. Kristoffersen Denmark 7 117 0.8× 54 0.4× 56 1.2× 56 1.3× 20 0.6× 9 153
Christophe Ratel France 5 184 1.3× 121 0.9× 97 2.1× 47 1.1× 18 0.6× 5 230
Ingo Stierand Germany 7 92 0.6× 93 0.7× 52 1.1× 46 1.1× 25 0.8× 27 165
F. Lagnier France 3 111 0.8× 87 0.6× 58 1.3× 29 0.7× 12 0.4× 3 148
Jean-Louis Colaço France 9 136 0.9× 151 1.1× 44 1.0× 34 0.8× 19 0.6× 16 206
Bertrand Jeannet France 8 125 0.9× 63 0.5× 68 1.5× 74 1.8× 19 0.6× 14 165
Jan Vytopil Netherlands 4 104 0.7× 51 0.4× 53 1.2× 77 1.8× 30 0.9× 7 144
Loïc Besnard France 10 123 0.8× 181 1.3× 45 1.0× 35 0.8× 46 1.4× 30 219
Björn Wachter United Kingdom 9 127 0.9× 137 1.0× 66 1.4× 72 1.7× 56 1.8× 20 257
Jürgen Ruf Germany 7 122 0.8× 131 0.9× 69 1.5× 33 0.8× 35 1.1× 32 200

Countries citing papers authored by Peter Niebert

Since Specialization
Citations

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

Fields of papers citing papers by Peter Niebert

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Peter Niebert

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

All Works

11 of 11 papers shown
1.
Lugiez, Denis, et al.. (2005). A partial order semantics approach to the clock explosion problem of timed automata. Theoretical Computer Science. 345(1). 27–59. 15 indexed citations
2.
D’Argenio, Pedro R. & Peter Niebert. (2004). Partial order reduction on concurrent probabilistic programs. 240–249. 15 indexed citations
3.
D’Argenio, Pedro R. & Peter Niebert. (2004). Partial order reduction on concurrent probabilistic programs. 240–249. 7 indexed citations
4.
Caspi, Paul, et al.. (2003). From simulink to SCADE/lustre to TTA. ACM SIGPLAN Notices. 38(7). 153–162. 96 indexed citations
5.
Caspi, Paul, et al.. (2003). From simulink to SCADE/lustre to TTA. 153–162. 47 indexed citations
6.
Niebert, Peter. (2003). Petrinetze – Ein anschaulicher Formalismus der Nebenläufigkeit (Teil 2) (Petri Nets – An Intuitive Formalism for Concurrency (Part 2)). at - Automatisierungstechnik. 51(4). A9–A12. 1 indexed citations
7.
Caspi, Paul, et al.. (2003). From simulink to SCADE/lustre to TTA. 14 indexed citations
8.
9.
Niebert, Peter, et al.. (2002). A Satisfiability Checker for Difference Logic. 4 indexed citations
10.
Niebert, Peter & Sergio Yovine. (2001). Computing Efficient Operation Schemes for Chemical Plants in Multi-batch Mode. European Journal of Control. 7(4). 440–453. 4 indexed citations
11.
Niebert, Peter & Wojciech Penczek. (1995). On the connection of partial order logics and partial order reduction methods. Data Archiving and Networked Services (DANS). 9515. 5 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