Paul Gastin

2.9k total citations
46 papers, 406 citations indexed

About

Paul Gastin is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Paul Gastin has authored 46 papers receiving a total of 406 indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computational Theory and Mathematics, 30 papers in Artificial Intelligence and 7 papers in Computer Networks and Communications. Recurrent topics in Paul Gastin's work include semigroups and automata theory (28 papers), Formal Methods in Verification (26 papers) and Logic, programming, and type systems (20 papers). Paul Gastin is often cited by papers focused on semigroups and automata theory (28 papers), Formal Methods in Verification (26 papers) and Logic, programming, and type systems (20 papers). Paul Gastin collaborates with scholars based in France, Germany and India. Paul Gastin's co-authors include Volker Diekert, Manfred Droste, Antoine Petit, Béatrice Bérard, Dietrich Kuske, Manfred Kufleitner, Michael Mislove, François Laroussinie, Benjamin Monmege and Benedikt Bollig and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Paul Gastin

43 papers receiving 387 citations

Peers

Paul Gastin

CTM

SOFTW

CNC

Wiesław Zielonka France

Anca Muscholl France

Antoni Mazurkiewicz Poland

Stefan Kiefer United Kingdom

Petr Jančar Czechia

Mario Coppo Italy

R.J. vanGlabbeek United States

Frank Valencia France

Christof Löding Germany

Yoram Hirshfeld Israel

Wiesław Zielonka France

Paul Gastin

299 ×0.8

CTM

226 ×0.8

40 ×0.9

SOFTW

46 ×1.2

CNC

39 ×1.1

Citations per year, relative to Paul Gastin Paul Gastin (= 1×) peers Wiesław Zielonka

Countries citing papers authored by Paul Gastin

Since Specialization

Citations

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

Fields of papers citing papers by Paul Gastin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Paul Gastin

This figure shows the co-authorship network connecting the top 25 collaborators of Paul Gastin. A scholar is included among the top collaborators of Paul Gastin 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 Paul Gastin. Paul Gastin 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

Gastin, Paul, et al.. (2020). Reachability for Updatable Timed Automata Made Faster and More Effective. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Gastin, Paul, et al.. (2018). Reachability in Timed Automata with Diagonal Constraints. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

Akshay, S., Paul Gastin, & Shankara Narayanan Krishna. (2018). Analyzing Timed Systems Using Tree Automata. SHILAP Revista de lepidopterología. 1 indexed citations

Akshay, S., et al.. (2017). Towards an Efficient Tree Automata Based Technique for Timed Systems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).

Bollig, Benedikt, et al.. (2017). An automata-theoretic approach to the verification of distributed algorithms. Information and Computation. 259. 305–327. 3 indexed citations

Akshay, S., Paul Gastin, Madhavan Mukund, & K. Narayan Kumar. (2015). Checking conformance for time-constrained scenario-based specifications. Theoretical Computer Science. 594. 24–43. 2 indexed citations

Bollig, Benedikt, et al.. (2014). Temporal logics for concurrent recursive programs: Satisfiability and model checking. Journal of Applied Logic. 12(4). 395–416. 3 indexed citations

Gastin, Paul & Benjamin Monmege. (2014). Adding pebbles to weighted automata: Easy specification & efficient evaluation. Theoretical Computer Science. 534. 24–44. 2 indexed citations

Gastin, Paul & Dietrich Kuske. (2010). Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. Information and Computation. 208(7). 797–816. 10 indexed citations

10.

Gastin, Paul & Dietrich Kuske. (2008). Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces. Fundamenta Informaticae. 80(1). 169–197. 5 indexed citations

11.

Droste, Manfred & Paul Gastin. (2007). Weighted automata and weighted logics. Theoretical Computer Science. 380(1-2). 69–86. 94 indexed citations

12.

Gastin, Paul & Dan Teodosiu. (2002). Resource traces: a domain for processes sharing exclusive resources. Theoretical Computer Science. 278(1-2). 195–221. 4 indexed citations

13.

Diekert, Volker & Paul Gastin. (2002). LTL Is Expressively Complete for Mazurkiewicz Traces. Journal of Computer and System Sciences. 64(2). 396–418. 9 indexed citations

14.

Droste, Manfred, Paul Gastin, & Dietrich Kuske. (2000). Asynchronous cellular automata for pomsets. Theoretical Computer Science. 247(1-2). 1–38. 5 indexed citations

15.

Droste, Manfred & Paul Gastin. (1999). The Kleene–Schützenberger Theorem for Formal Power Series in Partially Commuting Variables. Information and Computation. 153(1). 47–80. 11 indexed citations

16.

Bérard, Béatrice, Antoine Petit, Volker Diekert, & Paul Gastin. (1998). Characterization of the Expressive Power of Silent Transitions in Timed Automata. Fundamenta Informaticae. 36(2-3). 145–182. 62 indexed citations

17.

Diekert, Volker, Paul Gastin, & Antoine Petit. (1997). Removing epsilon-Transitions in Timed Automata. 583–594. 11 indexed citations

18.

Diekert, Volker & Paul Gastin. (1995). A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract). International Colloquium on Automata, Languages and Programming. 15–26. 1 indexed citations

19.

Diekert, Volker, Paul Gastin, & Antoine Petit. (1995). Rational and Recognizable Complex Trace Languages. Information and Computation. 116(1). 134–153. 5 indexed citations

20.

Diekert, Volker, Paul Gastin, & Antoine Petit. (1991). Recognizable Complex Trace Languages.. 131–140. 4 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