DBLP: Ph. Schnoebelen

	2013
i9		Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen: The Power of Priority Channel Systems. CoRR abs/1301.5500 (2013)
	2012
j28		Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell: On termination and invariance for faulty channel machines. Formal Asp. Comput. 24(4-6): 595-607 (2012)
c56		Prateek Karandikar, Philippe Schnoebelen: Cutting through Regular Post Embedding Problems. CSR 2012: 229-240
c55		Petr Jancar, Prateek Karandikar, Philippe Schnoebelen: Unidirectional Channel Systems Can Be Tested. IFIP TCS 2012: 149-163
c54		Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen: The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets. LICS 2012: 355-364
i8		Nathalie Bertrand, Philippe Schnoebelen: Solving Stochastic Büchi Games on Infinite Decisive Arenas. CoRR abs/1207.4577 (2012)
	2011
c53		Sylvain Schmitz, Ph. Schnoebelen: Multiply-Recursive Upper Bounds with Higman's Lemma. ICALP (2) 2011: 441-452
c52		Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen: Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. LICS 2011: 269-278
i7		Sylvain Schmitz, Philippe Schnoebelen: Multiply-Recursive Upper Bounds with Higman's Lemma. CoRR abs/1103.4399 (2011)
i6		Prateek Karandikar, Philippe Schnoebelen: Cutting Through Regular Post Embedding Problems. CoRR abs/1109.1691 (2011)
	2010
c51		Pierre Chambart, Philippe Schnoebelen: Computing Blocker Sets for the Regular Post Embedding Problem. Developments in Language Theory 2010: 136-147
c50		Pierre Chambart, Ph. Schnoebelen: Toward a Compositional Theory of Leftist Grammars and Transformations. FOSSACS 2010: 237-251
c49		Pierre Chambart, Philippe Schnoebelen: Pumping and Counting on the Regular Post Embedding Problem. ICALP (2) 2010: 64-75
c48		Philippe Schnoebelen: Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. MFCS 2010: 616-628
c47		Philippe Schnoebelen: Lossy Counter Machines Decidability Cheat Sheet. RP 2010: 51-75
i5		Pierre Chambart, Ph. Schnoebelen: Toward a Compositional Theory of Leftist Grammars and Transformations. CoRR abs/1001.5047 (2010)
i4		Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen: Ackermann and Primitive-Recursive Bounds with Dickson's Lemma. CoRR abs/1007.2989 (2010)
	2008
c46		Pierre Chambart, Ph. Schnoebelen: Mixing Lossy and Perfect Fifo Channels. CONCUR 2008: 340-355
c45		Pierre Chambart, Ph. Schnoebelen: The omega-Regular Post Embedding Problem. FoSSaCS 2008: 97-111
c44		Pierre Chambart, Ph. Schnoebelen: The Ordinal Recursive Complexity of Lossy Channel Systems. LICS 2008: 205-216
c43		Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. STACS 2008: 121-132
i3		Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. CoRR abs/0802.2839 (2008)
	2007
j27		Christel Baier, Nathalie Bertrand, Ph. Schnoebelen: Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Trans. Comput. Log. 9(1) (2007)
c42		Pierre Chambart, Ph. Schnoebelen: Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems. FSTTCS 2007: 265-276
c41		Ph. Schnoebelen: Model Checking Branching Time Logics. TIME 2007: 5
	2006
j26		Nathalie Bertrand, Ph. Schnoebelen: A Short Visit to the STS Hierarchy. Electr. Notes Theor. Comput. Sci. 154(3): 59-69 (2006)
j25		Alexander Rabinovich, Ph. Schnoebelen: BTL₂ and the expressive power of ECTL⁺. Inf. Comput. 204(7): 1023-1044 (2006)
j24		Christel Baier, Nathalie Bertrand, Ph. Schnoebelen: A note on the attractor-property of infinite-state Markov chains. Inf. Process. Lett. 97(2): 58-63 (2006)
j23		Nicolas Markey, Ph. Schnoebelen: Mu-calculus path checking. Inf. Process. Lett. 97(6): 225-230 (2006)
j22		Sté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)
j21		François Laroussinie, Nicolas Markey, Ph. Schnoebelen: Efficient timed model checking for discrete-time systems. Theor. Comput. Sci. 353(1-3): 249-271 (2006)
j20		Antoní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)
c40		Christel Baier, Nathalie Bertrand, Ph. Schnoebelen: Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. FORTE 2006: 212-227
c39		Christel Baier, Nathalie Bertrand, Ph. Schnoebelen: On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. LPAR 2006: 347-361
i2		Christel 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)
	2005
j19		Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Ph. Schnoebelen: Verification of probabilistic systems with faulty communication. Inf. Comput. 202(2): 141-165 (2005)
j18		Denis Lugiez, Ph. Schnoebelen: Decidable first-order transition logics for PA-processes. Inf. Comput. 203(1): 75-113 (2005)
c38		Sébastien Bardin, Alain Finkel, Jérôme Leroux, Ph. Schnoebelen: Flat Acceleration in Symbolic Model Checking. ATVA 2005: 474-488
i1		Christel Baier, Nathalie Bertrand, Ph. Schnoebelen: Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties. CoRR abs/cs/0511023 (2005)
	2004
j17		Ph. 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)
j16		Nicolas Markey, Ph. Schnoebelen: A PTIME-complete matching problem for SLP-compressed words. Inf. Process. Lett. 90(1): 3-6 (2004)
c37		Antonín Kucera, Ph. Schnoebelen: A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. CONCUR 2004: 371-386
c36		François Laroussinie, Nicolas Markey, Ph. Schnoebelen: Model Checking Timed Automata with One or Two Clocks. CONCUR 2004: 387-401
c35		Nicolas Markey, Ph. Schnoebelen: Symbolic Model Checking for Simply-Timed Systems. FORMATS/FTRTFT 2004: 102-117
c34		Nicolas Markey, Ph. Schnoebelen: TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems. QEST 2004: 330-331
c33		Ph. Schnoebelen: The Verification of Probabilistic Lossy Channel Systems. Validation of Stochastic Systems 2004: 445-466
	2003
j15		Franç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)
c32		Nicolas Markey, Ph. Schnoebelen: Model Checking a Path. CONCUR 2003: 248-262
c31		Nathalie Bertrand, Ph. Schnoebelen: Model Checking Lossy Channels Systems Is Probably Decidable. FoSSaCS 2003: 120-135
c30		Ph. Schnoebelen: Oracle Circuits for Branching-Time Model Checking. ICALP 2003: 790-801
	2002
j14		Stéphane Demri, Ph. Schnoebelen: The Complexity of Propositional Linear Temporal Logics in Simple Cases. Inf. Comput. 174(1): 84-103 (2002)
j13		Ph. Schnoebelen: Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett. 83(5): 251-261 (2002)
j12		Anne Labroue, Ph. Schnoebelen: An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. Nord. J. Comput. 9(1): 118-144 (2002)
j11		Denis Lugiez, Ph. Schnoebelen: The regular viewpoint on PA-processes. Theor. Comput. Sci. 274(1-2): 89-115 (2002)
c29		Ph. Schnoebelen: The Complexity of Temporal Logic Model Checking. Advances in Modal Logic 2002: 393-436
c28		Samuel Hornus, Ph. Schnoebelen: On Solving Temporal Logic Queries. AMAST 2002: 163-177
c27		François Laroussinie, Nicolas Markey, Ph. Schnoebelen: On Model Checking Durational Kripke Structures. FoSSaCS 2002: 264-279
c26		François Laroussinie, Nicolas Markey, Ph. Schnoebelen: Temporal Logic with Forgettable Past. LICS 2002: 383-392
c25		Benoît Masson, Ph. Schnoebelen: On Verifying Fair Lossy Channel Systems. MFCS 2002: 543-555
c24		Stéphane Demri, François Laroussinie, Ph. Schnoebelen: A Parametric Analysis of the State Explosion Problem in Model Checking. STACS 2002: 620-631
	2001
j10		Anne Labroue, Ph. Schnoebelen: An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. Electr. Notes Theor. Comput. Sci. 52(1): 1-20 (2001)
j9		Alain Finkel, Ph. Schnoebelen: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2): 63-92 (2001)
c23		François Laroussinie, Nicolas Markey, Ph. Schnoebelen: Model Checking CTL⁺ and FCTL is Hard. FoSSaCS 2001: 318-331
c22		Ph. Schnoebelen: Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems. TACS 2001: 385-399
	2000
j8		François Laroussinie, Ph. Schnoebelen: Specification in CTL+Past for Verification in CTL. Inf. Comput. 156(1-2): 236-263 (2000)
c21		Ph. Schnoebelen, Natalia Sidorova: Bisimulation and the Reduction of Petri Nets. ICATPN 2000: 409-423
c20		Béatrice Bérard, Anne Labroue, Ph. Schnoebelen: Verifying Performance Equivalence for Timed Basic Parallel Processes. FoSSaCS 2000: 35-47
c19		François Laroussinie, Ph. Schnoebelen: The State Explosion Problem from Trace to Bisimulation Equivalence. FoSSaCS 2000: 192-207
c18		Denis Lugiez, Ph. Schnoebelen: Decidable First-Order Transition Logics for PA-Processes. ICALP 2000: 342-353
c17		François Laroussinie, Ph. Schnoebelen, Mathieu Turuani: On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. LATIN 2000: 437-446
	1999
c16		Irina A. Lomazova, Ph. Schnoebelen: Some Decidability Results for Nested Petri Nets. Ershov Memorial Conference 1999: 208-220
c15		Catherine Dufourd, Petr Jancar, Ph. Schnoebelen: Boundedness of Reset P/T Nets. ICALP 1999: 301-310
	1998
c14		Denis Lugiez, Ph. Schnoebelen: The Regular Viewpoint on PA-Processes. CONCUR 1998: 50-66
c13		Catherine Dufourd, Alain Finkel, Ph. Schnoebelen: Reset Nets Between Decidability and Undecidability. ICALP 1998: 103-115
c12		Alain Finkel, Ph. Schnoebelen: Fundamental Structures in Well-Structured Infinite Transition Systems. LATIN 1998: 102-118
c11		Stéphane Demri, Ph. Schnoebelen: The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). STACS 1998: 61-72
	1997
j7		François Laroussinie, Ph. Schnoebelen: Specification in CTL+Past, verification in CTL. Electr. Notes Theor. Comput. Sci. 7: 161-184 (1997)
c10		Olga Kouchnarenko, Ph. Schnoebelen: A Formal Framework for the Analysis of Recursive-Parallel Programs. PaCT 1997: 45-59
	1996
j6		Olga Kouchnarenko, Ph. Schnoebelen: A model for recursive-parallel programs. Electr. Notes Theor. Comput. Sci. 5: 30 (1996)
	1995
j5		François Laroussinie, Sophie Pinchinat, Ph. Schnoebelen: Translations Between Modal Logics of Reactive Systems. Theor. Comput. Sci. 140(1): 53-71 (1995)
j4		François Laroussinie, Ph. Schnoebelen: A Hierarchy of Temporal Logics with Past. Theor. Comput. Sci. 148(2): 303-324 (1995)
	1994
c9		François Laroussinie, Ph. Schnoebelen: A Hierarchy of Temporal Logics with Past (Extended Abstract). STACS 1994: 47-58
	1993
c8		François Laroussinie, Sophie Pinchinat, Ph. Schnoebelen: Translation Results for Modal Logics of Reactive Systems. AMAST 1993: 297-306
	1992
c7		C. Autant, Ph. Schnoebelen: Place Bisimulations in Petri Nets. Application and Theory of Petri Nets 1992: 45-61
	1991
j3		Ferroudja Cherief, Ph. Schnoebelen: \tau-Bisimulations and Full Abstraction for Refinement of Actions. Inf. Process. Lett. 40(4): 219-222 (1991)
j2		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)
c6		Ph. Schnoebelen: Experiments on Processes with Backtracking. CONCUR 1991: 480-494
c5		C. Autant, Z. Belmesk, Ph. Schnoebelen: Strong Bisimilarity on Nets Revisited. PARLE (2) 1991: 295-312
	1990
c4		Ph. Schnoebelen, Sophie Pinchinat: On the Weak Adequacy of Branching-Time Remporal Logic. ESOP 1990: 377-388
	1988
j1		Ph. Schnoebelen: Refined Compilation of Pattern-Matching for Functional Languages. Sci. Comput. Program. 11(2): 133-159 (1988)
c3		Ph. Schnoebelen: Refined Compilation of Pattern-Matching for Functional Languages. ALP 1988: 233-243
	1987
c2		Peter Schäfer, Ph. Schnoebelen: Specification of a Pipelined Event Driven Simulator using FP2. PARLE (1) 1987: 311-328
c1		Ph. Schnoebelen: Rewriting Techniques for the Temporal Analysis of Communicating Processes. PARLE (2) 1987: 402-419

2013

Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen: The Power of Priority Channel Systems. CoRR abs/1301.5500 (2013)

2012

j28

Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell: On termination and invariance for faulty channel machines. Formal Asp. Comput. 24(4-6): 595-607 (2012)

c56

Prateek Karandikar, Philippe Schnoebelen: Cutting through Regular Post Embedding Problems. CSR 2012: 229-240

c55

Petr Jancar, Prateek Karandikar, Philippe Schnoebelen: Unidirectional Channel Systems Can Be Tested. IFIP TCS 2012: 149-163

c54

Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen: The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets. LICS 2012: 355-364

Nathalie Bertrand, Philippe Schnoebelen: Solving Stochastic Büchi Games on Infinite Decisive Arenas. CoRR abs/1207.4577 (2012)

2011

c53

Sylvain Schmitz, Ph. Schnoebelen: Multiply-Recursive Upper Bounds with Higman's Lemma. ICALP (2) 2011: 441-452

c52

Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen: Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. LICS 2011: 269-278

Sylvain Schmitz, Philippe Schnoebelen: Multiply-Recursive Upper Bounds with Higman's Lemma. CoRR abs/1103.4399 (2011)

Prateek Karandikar, Philippe Schnoebelen: Cutting Through Regular Post Embedding Problems. CoRR abs/1109.1691 (2011)

2010

c51

Pierre Chambart, Philippe Schnoebelen: Computing Blocker Sets for the Regular Post Embedding Problem. Developments in Language Theory 2010: 136-147

c50

Pierre Chambart, Ph. Schnoebelen: Toward a Compositional Theory of Leftist Grammars and Transformations. FOSSACS 2010: 237-251

c49

Pierre Chambart, Philippe Schnoebelen: Pumping and Counting on the Regular Post Embedding Problem. ICALP (2) 2010: 64-75

c48

Philippe Schnoebelen: Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. MFCS 2010: 616-628

c47

Philippe Schnoebelen: Lossy Counter Machines Decidability Cheat Sheet. RP 2010: 51-75

Pierre Chambart, Ph. Schnoebelen: Toward a Compositional Theory of Leftist Grammars and Transformations. CoRR abs/1001.5047 (2010)

Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen: Ackermann and Primitive-Recursive Bounds with Dickson's Lemma. CoRR abs/1007.2989 (2010)

2008

c46

Pierre Chambart, Ph. Schnoebelen: Mixing Lossy and Perfect Fifo Channels. CONCUR 2008: 340-355

c45

Pierre Chambart, Ph. Schnoebelen: The omega-Regular Post Embedding Problem. FoSSaCS 2008: 97-111

c44

Pierre Chambart, Ph. Schnoebelen: The Ordinal Recursive Complexity of Lossy Channel Systems. LICS 2008: 205-216

c43

Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. STACS 2008: 121-132

Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. CoRR abs/0802.2839 (2008)

2007

j27

Christel Baier, Nathalie Bertrand, Ph. Schnoebelen: Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Trans. Comput. Log. 9(1) (2007)

c42

Pierre Chambart, Ph. Schnoebelen: Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems. FSTTCS 2007: 265-276

c41

Ph. Schnoebelen: Model Checking Branching Time Logics. TIME 2007: 5

2006

j26

Nathalie Bertrand, Ph. Schnoebelen: A Short Visit to the STS Hierarchy. Electr. Notes Theor. Comput. Sci. 154(3): 59-69 (2006)

j25

Alexander Rabinovich, Ph. Schnoebelen: BTL₂ and the expressive power of ECTL⁺. Inf. Comput. 204(7): 1023-1044 (2006)

j24

Christel Baier, Nathalie Bertrand, Ph. Schnoebelen: A note on the attractor-property of infinite-state Markov chains. Inf. Process. Lett. 97(2): 58-63 (2006)

j23

Nicolas Markey, Ph. Schnoebelen: Mu-calculus path checking. Inf. Process. Lett. 97(6): 225-230 (2006)

j22

Sté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)

j21

François Laroussinie, Nicolas Markey, Ph. Schnoebelen: Efficient timed model checking for discrete-time systems. Theor. Comput. Sci. 353(1-3): 249-271 (2006)

j20

Antoní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)

c40

Christel Baier, Nathalie Bertrand, Ph. Schnoebelen: Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. FORTE 2006: 212-227

c39

Christel Baier, Nathalie Bertrand, Ph. Schnoebelen: On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. LPAR 2006: 347-361

Christel 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)

2005

j19

Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Ph. Schnoebelen: Verification of probabilistic systems with faulty communication. Inf. Comput. 202(2): 141-165 (2005)

j18

Denis Lugiez, Ph. Schnoebelen: Decidable first-order transition logics for PA-processes. Inf. Comput. 203(1): 75-113 (2005)

c38

Sébastien Bardin, Alain Finkel, Jérôme Leroux, Ph. Schnoebelen: Flat Acceleration in Symbolic Model Checking. ATVA 2005: 474-488

Christel Baier, Nathalie Bertrand, Ph. Schnoebelen: Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties. CoRR abs/cs/0511023 (2005)

2004

j17

Ph. 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)

j16

Nicolas Markey, Ph. Schnoebelen: A PTIME-complete matching problem for SLP-compressed words. Inf. Process. Lett. 90(1): 3-6 (2004)

c37

Antonín Kucera, Ph. Schnoebelen: A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. CONCUR 2004: 371-386

c36

François Laroussinie, Nicolas Markey, Ph. Schnoebelen: Model Checking Timed Automata with One or Two Clocks. CONCUR 2004: 387-401

c35

Nicolas Markey, Ph. Schnoebelen: Symbolic Model Checking for Simply-Timed Systems. FORMATS/FTRTFT 2004: 102-117

c34

Nicolas Markey, Ph. Schnoebelen: TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems. QEST 2004: 330-331

c33

Ph. Schnoebelen: The Verification of Probabilistic Lossy Channel Systems. Validation of Stochastic Systems 2004: 445-466

2003

j15

Franç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)

c32

Nicolas Markey, Ph. Schnoebelen: Model Checking a Path. CONCUR 2003: 248-262

c31

Nathalie Bertrand, Ph. Schnoebelen: Model Checking Lossy Channels Systems Is Probably Decidable. FoSSaCS 2003: 120-135

c30

Ph. Schnoebelen: Oracle Circuits for Branching-Time Model Checking. ICALP 2003: 790-801

2002

j14

Stéphane Demri, Ph. Schnoebelen: The Complexity of Propositional Linear Temporal Logics in Simple Cases. Inf. Comput. 174(1): 84-103 (2002)

j13

Ph. Schnoebelen: Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett. 83(5): 251-261 (2002)

j12

Anne Labroue, Ph. Schnoebelen: An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. Nord. J. Comput. 9(1): 118-144 (2002)

j11

Denis Lugiez, Ph. Schnoebelen: The regular viewpoint on PA-processes. Theor. Comput. Sci. 274(1-2): 89-115 (2002)

c29

Ph. Schnoebelen: The Complexity of Temporal Logic Model Checking. Advances in Modal Logic 2002: 393-436

c28

Samuel Hornus, Ph. Schnoebelen: On Solving Temporal Logic Queries. AMAST 2002: 163-177

c27

François Laroussinie, Nicolas Markey, Ph. Schnoebelen: On Model Checking Durational Kripke Structures. FoSSaCS 2002: 264-279

c26

François Laroussinie, Nicolas Markey, Ph. Schnoebelen: Temporal Logic with Forgettable Past. LICS 2002: 383-392

c25

Benoît Masson, Ph. Schnoebelen: On Verifying Fair Lossy Channel Systems. MFCS 2002: 543-555

c24

Stéphane Demri, François Laroussinie, Ph. Schnoebelen: A Parametric Analysis of the State Explosion Problem in Model Checking. STACS 2002: 620-631

2001

j10

Anne Labroue, Ph. Schnoebelen: An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. Electr. Notes Theor. Comput. Sci. 52(1): 1-20 (2001)

Alain Finkel, Ph. Schnoebelen: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2): 63-92 (2001)

c23

François Laroussinie, Nicolas Markey, Ph. Schnoebelen: Model Checking CTL⁺ and FCTL is Hard. FoSSaCS 2001: 318-331

c22

Ph. Schnoebelen: Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems. TACS 2001: 385-399

2000

François Laroussinie, Ph. Schnoebelen: Specification in CTL+Past for Verification in CTL. Inf. Comput. 156(1-2): 236-263 (2000)

c21

Ph. Schnoebelen, Natalia Sidorova: Bisimulation and the Reduction of Petri Nets. ICATPN 2000: 409-423

c20

Béatrice Bérard, Anne Labroue, Ph. Schnoebelen: Verifying Performance Equivalence for Timed Basic Parallel Processes. FoSSaCS 2000: 35-47

c19

François Laroussinie, Ph. Schnoebelen: The State Explosion Problem from Trace to Bisimulation Equivalence. FoSSaCS 2000: 192-207

c18

Denis Lugiez, Ph. Schnoebelen: Decidable First-Order Transition Logics for PA-Processes. ICALP 2000: 342-353

c17

François Laroussinie, Ph. Schnoebelen, Mathieu Turuani: On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. LATIN 2000: 437-446

1999

c16

Irina A. Lomazova, Ph. Schnoebelen: Some Decidability Results for Nested Petri Nets. Ershov Memorial Conference 1999: 208-220

c15

Catherine Dufourd, Petr Jancar, Ph. Schnoebelen: Boundedness of Reset P/T Nets. ICALP 1999: 301-310

1998

c14

Denis Lugiez, Ph. Schnoebelen: The Regular Viewpoint on PA-Processes. CONCUR 1998: 50-66

c13

Catherine Dufourd, Alain Finkel, Ph. Schnoebelen: Reset Nets Between Decidability and Undecidability. ICALP 1998: 103-115

c12

Alain Finkel, Ph. Schnoebelen: Fundamental Structures in Well-Structured Infinite Transition Systems. LATIN 1998: 102-118

c11

Stéphane Demri, Ph. Schnoebelen: The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). STACS 1998: 61-72

1997

François Laroussinie, Ph. Schnoebelen: Specification in CTL+Past, verification in CTL. Electr. Notes Theor. Comput. Sci. 7: 161-184 (1997)

c10

Olga Kouchnarenko, Ph. Schnoebelen: A Formal Framework for the Analysis of Recursive-Parallel Programs. PaCT 1997: 45-59

1996

Olga Kouchnarenko, Ph. Schnoebelen: A model for recursive-parallel programs. Electr. Notes Theor. Comput. Sci. 5: 30 (1996)

1995

François Laroussinie, Sophie Pinchinat, Ph. Schnoebelen: Translations Between Modal Logics of Reactive Systems. Theor. Comput. Sci. 140(1): 53-71 (1995)

François Laroussinie, Ph. Schnoebelen: A Hierarchy of Temporal Logics with Past. Theor. Comput. Sci. 148(2): 303-324 (1995)

1994

François Laroussinie, Ph. Schnoebelen: A Hierarchy of Temporal Logics with Past (Extended Abstract). STACS 1994: 47-58

1993

François Laroussinie, Sophie Pinchinat, Ph. Schnoebelen: Translation Results for Modal Logics of Reactive Systems. AMAST 1993: 297-306

1992

C. Autant, Ph. Schnoebelen: Place Bisimulations in Petri Nets. Application and Theory of Petri Nets 1992: 45-61

1991

Ferroudja Cherief, Ph. Schnoebelen: \tau-Bisimulations and Full Abstraction for Refinement of Actions. Inf. Process. Lett. 40(4): 219-222 (1991)

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)

Ph. Schnoebelen: Experiments on Processes with Backtracking. CONCUR 1991: 480-494

C. Autant, Z. Belmesk, Ph. Schnoebelen: Strong Bisimilarity on Nets Revisited. PARLE (2) 1991: 295-312

1990

Ph. Schnoebelen, Sophie Pinchinat: On the Weak Adequacy of Branching-Time Remporal Logic. ESOP 1990: 377-388

1988

Ph. Schnoebelen: Refined Compilation of Pattern-Matching for Functional Languages. Sci. Comput. Program. 11(2): 133-159 (1988)

Ph. Schnoebelen: Refined Compilation of Pattern-Matching for Functional Languages. ALP 1988: 233-243

1987

Peter Schäfer, Ph. Schnoebelen: Specification of a Pipelined Event Driven Simulator using FP2. PARLE (1) 1987: 311-328

Ph. Schnoebelen: Rewriting Techniques for the Temporal Analysis of Communicating Processes. PARLE (2) 1987: 402-419

1	Parosh Aziz Abdulla	[j19]
2	C. Autant	[c7] [c5]
3	Christel Baier	[j27] [j24] [c40] [c39] [i2] [i1]
4	Sébastien Bardin	[c38]
5	Z. Belmesk	[c5]
6	Nathalie Bertrand	[i8] [j27] [j26] [j24] [c40] [c39] [i2] [j19] [i1] [c31]
7	Patricia Bouyer (Patricia Bouyer-Decitre)	[j28] [c43] [i3]
8	Béatrice Bérard	[c20]
9	Pierre Chambart	[c51] [c50] [c49] [i5] [c46] [c45] [c44] [c42]
10	Ferroudja Cherief	[j3]
11	Hubert Comon-Lundh (Hubert Comon)	[j2]
12	Stéphane Demri	[j22] [j14] [c24] [c11]
13	Catherine Dufourd	[c15] [c13]
14	Diego Figueira	[c52] [i4]
15	Santiago Figueira	[c52] [i4]
16	Alain Finkel	[c38] [j9] [c13] [c12]
17	Christoph Haase	[i9]
18	Serge Haddad	[c54]
19	Samuel Hornus	[c28]
20	Petr Jancar	[c55] [c15]
21	Prateek Karandikar	[c56] [c55] [i6]
22	Olga Kouchnarenko	[c10] [j6]
23	Antonín Kucera	[j20] [c37]
24	Anne Labroue	[j12] [j10] [c20]
25	François Laroussinie	[j22] [j21] [c36] [j15] [c27] [c26] [c24] [c23] [j8] [c19] [c17] [j7] [j5] [j4] [c9] [c8]
26	Jérôme Leroux	[c38]
27	Irina A. Lomazova	[c16]
28	Denis Lugiez	[j18] [j11] [c18] [c14] [j2]
29	Nicolas Markey	[j28] [c43] [i3] [j23] [j21] [j16] [c36] [c35] [c34] [c32] [c27] [c26] [c23]
30	Benoît Masson	[c25]
31	Joël Ouaknine	[j28] [c43] [i3]
32	Sophie Pinchinat	[j5] [c8] [c4]
33	Alexander Moshe Rabinovich (Alexander Rabinovich)	[j25] [j19]
34	Sylvain Schmitz	[i9] [c54] [c53] [c52] [i7] [i4]
35	Peter Schäfer	[c2]
36	Natalia Sidorova	[c21]
37	Mathieu Turuani	[j15] [c17]
38	James Worrell	[j28] [c43] [i3]

Ph. Schnoebelen

Coauthor Index