dblp.uni-trier.dewww.uni-trier.de

Ph. Schnoebelen Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

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

Coauthor Index

1Parosh Aziz Abdulla [56]
2C. Autant [8] [10]
3Christel Baier [57] [63] [66] [67] [68] [69]
4Sébastien Bardin [58]
5Z. Belmesk [8]
6Béatrice Bérard [28]
7Nathalie Bertrand [46] [56] [57] [63] [65] [66] [67] [68] [69]
8Patricia Bouyer [72] [73]
9Pierre Chambart [71] [74] [75] [76]
10Ferroudja Cherief [7]
11Hubert Comon-Lundh (Hubert Comon) [6]
12Stéphane Demri [18] [37] [38] [61]
13Catherine Dufourd [20] [22]
14Alain Finkel [19] [20] [30] [58]
15Samuel Hornus [43]
16Petr Jancar [22]
17Olga Kouchnarenko [15] [17]
18Antonín Kucera [54] [59]
19Anne Labroue [28] [31] [35]
20François Laroussinie [11] [12] [13] [14] [16] [24] [25] [29] [33] [38] [40] [41] [44] [53] [60] [61]
21Jérôme Leroux [58]
22Irina A. Lomazova [23]
23Denis Lugiez [6] [21] [27] [34] [55]
24Nicolas Markey [33] [40] [41] [47] [48] [51] [52] [53] [60] [62] [72] [73]
25Benoît Masson [39]
26Joël Ouaknine [72] [73]
27Sophie Pinchinat [5] [11] [14]
28Alexander Moshe Rabinovich (Alexander Rabinovich) [56] [64]
29Peter Schäfer [2]
30Natalia Sidorova [26]
31Mathieu Turuani [25] [44]
32James Worrell [72] [73]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)