The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ph. Schnoebelen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ph. Schnoebelen
    The Complexity of Temporal Logic Model Checking. [Citation Graph (0, 0)][DBLP]
    Advances in Modal Logic, 2002, pp:393-436 [Conf]
  2. Ph. Schnoebelen
    Refined Compilation of Pattern-Matching for Functional Languages. [Citation Graph (0, 0)][DBLP]
    ALP, 1988, pp:233-243 [Conf]
  3. François Laroussinie, Sophie Pinchinat, Ph. Schnoebelen
    Translation Results for Modal Logics of Reactive Systems. [Citation Graph (0, 0)][DBLP]
    AMAST, 1993, pp:297-306 [Conf]
  4. Samuel Hornus, Ph. Schnoebelen
    On Solving Temporal Logic Queries. [Citation Graph (0, 0)][DBLP]
    AMAST, 2002, pp:163-177 [Conf]
  5. C. Autant, Ph. Schnoebelen
    Place Bisimulations in Petri Nets. [Citation Graph (0, 0)][DBLP]
    Application and Theory of Petri Nets, 1992, pp:45-61 [Conf]
  6. Ph. Schnoebelen, Natalia Sidorova
    Bisimulation and the Reduction of Petri Nets. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2000, pp:409-423 [Conf]
  7. Sébastien Bardin, Alain Finkel, Jérôme Leroux, Ph. Schnoebelen
    Flat Acceleration in Symbolic Model Checking. [Citation Graph (0, 0)][DBLP]
    ATVA, 2005, pp:474-488 [Conf]
  8. Antonín Kucera, Ph. Schnoebelen
    A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:371-386 [Conf]
  9. François Laroussinie, Nicolas Markey, Ph. Schnoebelen
    Model Checking Timed Automata with One or Two Clocks. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:387-401 [Conf]
  10. Denis Lugiez, Ph. Schnoebelen
    The Regular Viewpoint on PA-Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1998, pp:50-66 [Conf]
  11. Nicolas Markey, Ph. Schnoebelen
    Model Checking a Path. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:248-262 [Conf]
  12. Ph. Schnoebelen
    Experiments on Processes with Backtracking. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1991, pp:480-494 [Conf]
  13. Irina A. Lomazova, Ph. Schnoebelen
    Some Decidability Results for Nested Petri Nets. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 1999, pp:208-220 [Conf]
  14. Ph. Schnoebelen, Sophie Pinchinat
    On the Weak Adequacy of Branching-Time Remporal Logic. [Citation Graph (0, 0)][DBLP]
    ESOP, 1990, pp:377-388 [Conf]
  15. Nicolas Markey, Ph. Schnoebelen
    Symbolic Model Checking for Simply-Timed Systems. [Citation Graph (0, 0)][DBLP]
    FORMATS/FTRTFT, 2004, pp:102-117 [Conf]
  16. Christel Baier, Nathalie Bertrand, Ph. Schnoebelen
    Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. [Citation Graph (0, 0)][DBLP]
    FORTE, 2006, pp:212-227 [Conf]
  17. Béatrice Bérard, Anne Labroue, Ph. Schnoebelen
    Verifying Performance Equivalence for Timed Basic Parallel Processes. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2000, pp:35-47 [Conf]
  18. Nathalie Bertrand, Ph. Schnoebelen
    Model Checking Lossy Channels Systems Is Probably Decidable. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:120-135 [Conf]
  19. François Laroussinie, Nicolas Markey, Ph. Schnoebelen
    Model Checking CTL+ and FCTL is Hard. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:318-331 [Conf]
  20. François Laroussinie, Nicolas Markey, Ph. Schnoebelen
    On Model Checking Durational Kripke Structures. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:264-279 [Conf]
  21. François Laroussinie, Ph. Schnoebelen
    The State Explosion Problem from Trace to Bisimulation Equivalence. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2000, pp:192-207 [Conf]
  22. Catherine Dufourd, Alain Finkel, Ph. Schnoebelen
    Reset Nets Between Decidability and Undecidability. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:103-115 [Conf]
  23. Catherine Dufourd, Petr Jancar, Ph. Schnoebelen
    Boundedness of Reset P/T Nets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:301-310 [Conf]
  24. Denis Lugiez, Ph. Schnoebelen
    Decidable First-Order Transition Logics for PA-Processes. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:342-353 [Conf]
  25. Ph. Schnoebelen
    Oracle Circuits for Branching-Time Model Checking. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:790-801 [Conf]
  26. Alain Finkel, Ph. Schnoebelen
    Fundamental Structures in Well-Structured Infinite Transition Systems. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:102-118 [Conf]
  27. François Laroussinie, Ph. Schnoebelen, Mathieu Turuani
    On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:437-446 [Conf]
  28. François Laroussinie, Nicolas Markey, Ph. Schnoebelen
    Temporal Logic with Forgettable Past. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:383-392 [Conf]
  29. Christel Baier, Nathalie Bertrand, Ph. Schnoebelen
    On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. [Citation Graph (0, 0)][DBLP]
    LPAR, 2006, pp:347-361 [Conf]
  30. Benoît Masson, Ph. Schnoebelen
    On Verifying Fair Lossy Channel Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:543-555 [Conf]
  31. Olga Kouchnarenko, Ph. Schnoebelen
    A Formal Framework for the Analysis of Recursive-Parallel Programs. [Citation Graph (0, 0)][DBLP]
    PaCT, 1997, pp:45-59 [Conf]
  32. C. Autant, Z. Belmesk, Ph. Schnoebelen
    Strong Bisimilarity on Nets Revisited. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1991, pp:295-312 [Conf]
  33. Peter Schäfer, Ph. Schnoebelen
    Specification of a Pipelined Event Driven Simulator using FP2. [Citation Graph (0, 0)][DBLP]
    PARLE (1), 1987, pp:311-328 [Conf]
  34. Ph. Schnoebelen
    Rewriting Techniques for the Temporal Analysis of Communicating Processes. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1987, pp:402-419 [Conf]
  35. Nicolas Markey, Ph. Schnoebelen
    TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems. [Citation Graph (0, 0)][DBLP]
    QEST, 2004, pp:330-331 [Conf]
  36. Stéphane Demri, François Laroussinie, Ph. Schnoebelen
    A Parametric Analysis of the State Explosion Problem in Model Checking. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:620-631 [Conf]
  37. Stéphane Demri, Ph. Schnoebelen
    The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:61-72 [Conf]
  38. François Laroussinie, Ph. Schnoebelen
    A Hierarchy of Temporal Logics with Past (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:47-58 [Conf]
  39. Ph. Schnoebelen
    Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:385-399 [Conf]
  40. Ph. Schnoebelen
    The Verification of Probabilistic Lossy Channel Systems. [Citation Graph (0, 0)][DBLP]
    Validation of Stochastic Systems, 2004, pp:445-466 [Conf]
  41. Nathalie Bertrand, Ph. Schnoebelen
    A Short Visit to the STS Hierarchy. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:154, n:3, pp:59-69 [Journal]
  42. Olga Kouchnarenko, Ph. Schnoebelen
    A model for recursive-parallel programs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
  43. Anne Labroue, Ph. Schnoebelen
    An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:52, n:1, pp:- [Journal]
  44. François Laroussinie, Ph. Schnoebelen
    Specification in CTL+Past, verification in CTL. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:7, n:, pp:- [Journal]
  45. Ph. Schnoebelen
    Preface: Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:98, n:, pp:1- [Journal]
  46. Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Ph. Schnoebelen
    Verification of probabilistic systems with faulty communication. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:202, n:2, pp:141-165 [Journal]
  47. Stéphane Demri, Ph. Schnoebelen
    The Complexity of Propositional Linear Temporal Logics in Simple Cases. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:174, n:1, pp:84-103 [Journal]
  48. François Laroussinie, Ph. Schnoebelen
    Specification in CTL+Past for Verification in CTL. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:156, n:1-2, pp:236-263 [Journal]
  49. Denis Lugiez, Ph. Schnoebelen
    Decidable first-order transition logics for PA-processes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:203, n:1, pp:75-113 [Journal]
  50. Alexander Rabinovich, Ph. Schnoebelen
    BTL2 and the expressive power of ECTL+. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:7, pp:1023-1044 [Journal]
  51. Christel Baier, Nathalie Bertrand, Ph. Schnoebelen
    A note on the attractor-property of infinite-state Markov chains. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:2, pp:58-63 [Journal]
  52. Ferroudja Cherief, Ph. Schnoebelen
    \tau-Bisimulations and Full Abstraction for Refinement of Actions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:4, pp:219-222 [Journal]
  53. Nicolas Markey, Ph. Schnoebelen
    A PTIME-complete matching problem for SLP-compressed words. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:1, pp:3-6 [Journal]
  54. Nicolas Markey, Ph. Schnoebelen
    Mu-calculus path checking. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:6, pp:225-230 [Journal]
  55. Ph. Schnoebelen
    Verifying lossy channel systems has nonprimitive recursive complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:5, pp:251-261 [Journal]
  56. Stéphane Demri, François Laroussinie, Ph. Schnoebelen
    A parametric analysis of the state-explosion problem in model checking. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:4, pp:547-575 [Journal]
  57. Hubert Comon, Denis Lugiez, Ph. Schnoebelen
    A Rewrite-Based Type Discipline for a Subset of Computer Algebra. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:11, n:4, pp:349-368 [Journal]
  58. Anne Labroue, Ph. Schnoebelen
    An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2002, v:9, n:1, pp:118-144 [Journal]
  59. Ph. Schnoebelen
    Refined Compilation of Pattern-Matching for Functional Languages. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1988, v:11, n:2, pp:133-159 [Journal]
  60. Alain Finkel, Ph. Schnoebelen
    Well-structured transition systems everywhere! [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:256, n:1-2, pp:63-92 [Journal]
  61. Antonín Kucera, Ph. Schnoebelen
    A general approach to comparing infinite-state systems with their finite-state specifications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:358, n:2-3, pp:315-333 [Journal]
  62. François Laroussinie, Nicolas Markey, Ph. Schnoebelen
    Efficient timed model checking for discrete-time systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:353, n:1-3, pp:249-271 [Journal]
  63. François Laroussinie, Sophie Pinchinat, Ph. Schnoebelen
    Translations Between Modal Logics of Reactive Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:140, n:1, pp:53-71 [Journal]
  64. François Laroussinie, Ph. Schnoebelen
    A Hierarchy of Temporal Logics with Past. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:148, n:2, pp:303-324 [Journal]
  65. François Laroussinie, Ph. Schnoebelen, Mathieu Turuani
    On the expressivity and complexity of quantitative branching-time temporal logics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:297-315 [Journal]
  66. Denis Lugiez, Ph. Schnoebelen
    The regular viewpoint on PA-processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:274, n:1-2, pp:89-115 [Journal]
  67. Ph. Schnoebelen
    Model Checking Branching Time Logics. [Citation Graph (0, 0)][DBLP]
    TIME, 2007, pp:5- [Conf]
  68. Christel Baier, Nathalie Bertrand, Ph. Schnoebelen
    On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  69. Mixing Lossy and Perfect Fifo Channels. [Citation Graph (, )][DBLP]


  70. The omega-Regular Post Embedding Problem. [Citation Graph (, )][DBLP]


  71. Toward a Compositional Theory of Leftist Grammars and Transformations. [Citation Graph (, )][DBLP]


  72. Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems. [Citation Graph (, )][DBLP]


  73. The Ordinal Recursive Complexity of Lossy Channel Systems. [Citation Graph (, )][DBLP]


  74. On Termination for Faulty Channel Machines. [Citation Graph (, )][DBLP]


  75. Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties [Citation Graph (, )][DBLP]


  76. On Termination for Faulty Channel Machines [Citation Graph (, )][DBLP]


  77. Toward a Compositional Theory of Leftist Grammars and Transformations [Citation Graph (, )][DBLP]


Search in 0.234secs, Finished in 0.238secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002