The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Paul Gastin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paul Gastin, Antoine Petit
    A survey of recognizable languages with infinite traces. [Citation Graph (0, 0)][DBLP]
    Advances in Petri Nets: The DEMON Project, 1992, pp:392-409 [Conf]
  2. Puneet Bhateja, Paul Gastin, Madhavan Mukund
    A Fresh Look at Testing for Asynchronous Communication. [Citation Graph (0, 0)][DBLP]
    ATVA, 2006, pp:369-383 [Conf]
  3. Volker Diekert, Paul Gastin
    Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:26-38 [Conf]
  4. Paul Gastin, Denis Oddoux
    Fast LTL to Büchi Automata Translation. [Citation Graph (0, 0)][DBLP]
    CAV, 2001, pp:53-65 [Conf]
  5. Manfred Droste, Paul Gastin
    Asynchronous Cellular Automata for Pomsets Without Auto-concurrency. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1996, pp:627-638 [Conf]
  6. Paul Gastin, Dietrich Kuske
    Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:218-232 [Conf]
  7. Paul Gastin, Dietrich Kuske
    Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:533-547 [Conf]
  8. Volker Diekert, Paul Gastin
    An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:188-203 [Conf]
  9. Paul Gastin, Michael W. Mislove
    A Truly Concurrent Semantics for a Simple Parallel Programming Language. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:515-529 [Conf]
  10. Volker Diekert, Paul Gastin, Antoine Petit
    Recent Developments in Trace Theory. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:373-385 [Conf]
  11. Fabrice Derepas, Paul Gastin, David Plainfossé
    Avoiding State Explosion for Distributed Systems with Timestamps. [Citation Graph (0, 0)][DBLP]
    FME, 2001, pp:119-134 [Conf]
  12. Béatrice Bérard, Paul Gastin, Antoine Petit
    Intersection of Regular Signal-Event (Timed) Languages. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2006, pp:52-66 [Conf]
  13. Béatrice Bérard, Paul Gastin, Antoine Petit
    Refinements and Abstractions of Signal-Event (Timed) Languages. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2006, pp:67-81 [Conf]
  14. Paul Gastin, Benjamin Lerman, Marc Zeitoun
    Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:275-286 [Conf]
  15. Paul Gastin, Nathalie Sznajder, Marc Zeitoun
    Distributed Synthesis for Well-Connected Architectures. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:321-332 [Conf]
  16. Volker Diekert, Paul Gastin
    LTL Is Expressively Complete for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:211-222 [Conf]
  17. Volker Diekert, Paul Gastin
    A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:15-26 [Conf]
  18. Manfred Droste, Paul Gastin
    Weighted Automata and Weighted Logics. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:513-525 [Conf]
  19. Manfred Droste, Paul Gastin
    On Recognizable and Rational Formal Power Series in Partially Commuting Variables. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:682-692 [Conf]
  20. Paul Gastin, Madhavan Mukund
    An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:938-949 [Conf]
  21. Paul Gastin, Antoine Petit
    Asynchronous Cellular Automata for Infinite Traces. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:583-594 [Conf]
  22. Paul Gastin, Antoine Petit, Wieslaw Zielonka
    A Kleene Theorem for Infinite Trace Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:254-266 [Conf]
  23. Volker Diekert, Paul Gastin
    Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:232-241 [Conf]
  24. Paul Gastin, Benjamin Lerman, Marc Zeitoun
    Distributed Games and Distributed Control for Asynchronous Systems. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:455-465 [Conf]
  25. Paul Gastin
    Infinite Traces. [Citation Graph (0, 0)][DBLP]
    Semantics of Systems of Concurrent Processes, 1990, pp:277-308 [Conf]
  26. Volker Diekert, Paul Gastin
    Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:55-69 [Conf]
  27. Serge Bauget, Paul Gastin
    On Congruences and Partial Orders. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:434-443 [Conf]
  28. Volker Diekert, Paul Gastin, Antoine Petit
    Recognizable Complex Trace Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:131-140 [Conf]
  29. Paul Gastin, Madhavan Mukund, K. Narayan Kumar
    Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:429-438 [Conf]
  30. Paul Gastin, Raphaël Meyer, Antoine Petit
    A (Non-elementary) Modular Decision Procedure for LTrL. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:356-365 [Conf]
  31. Paul Gastin, Denis Oddoux
    LTL with Past and Two-Way Very-Weak Alternating Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:439-448 [Conf]
  32. Paul Gastin, Antoine Petit
    Poset Properties of Complex Traces. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:255-263 [Conf]
  33. Paul Gastin, Pierre Moro, Marc Zeitoun
    Minimization of Counterexamples in SPIN. [Citation Graph (0, 0)][DBLP]
    SPIN, 2004, pp:92-108 [Conf]
  34. Fabrice Derepas, Paul Gastin
    Model Checking Systems of Replicated Processes with Spin. [Citation Graph (0, 0)][DBLP]
    SPIN, 2001, pp:235-251 [Conf]
  35. Béatrice Bérard, Paul Gastin, Antoine Petit
    On the Power of Non-Observable Actions in Timed Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:257-268 [Conf]
  36. Volker Diekert, Paul Gastin, Antoine Petit
    Removing epsilon-Transitions in Timed Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:583-594 [Conf]
  37. Paul Gastin
    Recognizable and Rational Languages of Finite and Infinite Traces. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:89-104 [Conf]
  38. Joffroy Beauquier, Paul Gastin, Vincent Villain
    A Linear Fault-Tolerant Naming Algorithm. [Citation Graph (0, 0)][DBLP]
    WDAG, 1990, pp:57-70 [Conf]
  39. Volker Diekert, Paul Gastin
    Approximating Traces. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:7, pp:567-593 [Journal]
  40. Béatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin
    Characterization of the Expressive Power of Silent Transitions in Timed Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1998, v:36, n:2-3, pp:145-182 [Journal]
  41. Volker Diekert, Paul Gastin
    Local temporal logic is expressively complete for cograph dependence alphabets. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:195, n:1-2, pp:30-52 [Journal]
  42. Volker Diekert, Paul Gastin, Antoine Petit
    Rational and Recognizable Complex Trace Languages [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:116, n:1, pp:134-153 [Journal]
  43. Manfred Droste, Paul Gastin
    The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:153, n:1, pp:47-80 [Journal]
  44. Volker Diekert, Paul Gastin
    Pure future local temporal logics are expressively complete for Mazurkiewicz traces. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:11, pp:1597-1619 [Journal]
  45. Paul Gastin, Edward Ochmanski, Antoine Petit, Brigitte Rozoy
    Decidability of the Star Problem in A* x {b}*. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:2, pp:65-71 [Journal]
  46. Volker Diekert, Paul Gastin
    LTL Is Expressively Complete for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:2, pp:396-418 [Journal]
  47. Paul Gastin, Michael W. Mislove
    A simple process algebra based on atomic actions with resources. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2004, v:14, n:1, pp:1-55 [Journal]
  48. Paul Gastin, Vincent Villain
    An Efficient Crash-tolerant Sequential Traversal. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:87-97 [Journal]
  49. Volker Diekert, Paul Gastin
    From local to global temporal logics over Mazurkiewicz traces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:126-135 [Journal]
  50. Manfred Droste, Paul Gastin, Dietrich Kuske
    Asynchronous cellular automata for pomsets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:247, n:1-2, pp:1-38 [Journal]
  51. Paul Gastin
    Un Modèle Asynchrone pour les Systèmes Distribués. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:74, n:1, pp:121-162 [Journal]
  52. Paul Gastin, Michael W. Mislove
    A truly concurrent semantics for a process algebra using resource pomsets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:369-421 [Journal]
  53. Paul Gastin, Antoine Petit, Wieslaw Zielonka
    An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:125, n:2, pp:167-204 [Journal]
  54. Paul Gastin, Brigitte Rozoy
    The Poset of Infinitary Traces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:120, n:1, pp:101-121 [Journal]
  55. Paul Gastin, Dan Teodosiu
    Resource traces: a domain for processes sharing exclusive resources. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:278, n:1-2, pp:195-221 [Journal]
  56. Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
    Local Testing of Message Sequence Charts Is Difficult. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:76-87 [Conf]
  57. Paul Gastin, Pierre Moro
    Minimal Counterexample Generation for SPIN. [Citation Graph (0, 0)][DBLP]
    SPIN, 2007, pp:24-38 [Conf]
  58. Béatrice Bérard, Paul Gastin, Antoine Petit
    Timed substitutions for regular signal-event languages. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2007, v:31, n:2, pp:101-134 [Journal]
  59. Manfred Droste, Paul Gastin
    Weighted automata and weighted logics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:69-86 [Journal]

  60. Distributed Timed Automata with Independently Evolving Clocks. [Citation Graph (, )][DBLP]


  61. Weighted versus Probabilistic Logics. [Citation Graph (, )][DBLP]


  62. Automata and Logics for Timed Message Sequence Charts. [Citation Graph (, )][DBLP]


  63. Pebble Weighted Automata and Transitive Closure Logics. [Citation Graph (, )][DBLP]


  64. Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. [Citation Graph (, )][DBLP]


Search in 0.040secs, Finished in 0.044secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002