Selected publications by Philippe Schnoebelen

2017

DSS17
M. Dzamonja, S. Schmitz and Ph. SchnoebelenOn the width of FAC orders, a somewhat rediscovered notion, Preprint, 2017. ( Web page | PDF | BibTeX + Abstract )
HSZ17
S. Halfon, Ph. Schnoebelen and G. ZetzscheDecidability, complexity, and expressiveness of first-order logic over the subword orderingIn LICS'17, pages 1-12. IEEE Press, 2017. ( Web page | BibTeX + Abstract )
doi: 10.1109/LICS.2017.8005141

2016

KS16
P. Karandikar and Ph. SchnoebelenThe height of piecewise-testable languages with applications in logical complexityIn CSL'16, Leibniz International Proceedings in Informatics 62, pages 37:1-37:22. Leibniz-Zentrum für Informatik, 2016. ( PDF | BibTeX + Abstract )
doi: 10.4230/LIPIcs.CSL.2016.37
KNS16
P. Karandikar, M. Niewerth and Ph. SchnoebelenOn the state complexity of closures and interiors of regular languages with subwords and superwordsTheoretical Computer Science 610(A), pages 91-107, 2016. ( PDF | BibTeX + Abstract )
doi: 10.1016/j.tcs.2015.09.028

2015

KS15a
P. Karandikar and Ph. SchnoebelenDecidability in the logic of subsequences and supersequencesIn FSTTCS'15, Leibniz International Proceedings in Informatics 45, pages 84-97. Leibniz-Zentrum für Informatik, 2015. ( PDF | BibTeX + Abstract )
doi: 10.4230/LIPIcs.FSTTCS.2015.84
KS15b
P. Karandikar and Ph. SchnoebelenGeneralized Post Embedding ProblemsTheory of Computing Systems 56(4), pages 697-716, 2015. ( PDF | BibTeX + Abstract )
doi: 10.1007/s00224-014-9561-9
JKS15
P. Jancar, P. Karandikar and Ph. SchnoebelenOn Reachability for Unidirectional Channel Systems Extended with Regular TestsLogical Methods in Computer Science 11(2:2), 2015. ( Web page | PDF | BibTeX + Abstract )
doi: 10.2168/LMCS-11(2:2)2015
KKS15
P. Karandikar, M. Kufleitner and Ph. SchnoebelenOn the index of Simon's congruence for piecewise testabilityInformation Processing Letters 15(4), pages 515-519, 2015. ( Web page | PDF | BibTeX + Abstract )
doi: 10.1016/j.ipl.2014.11.008

2014

HSS14
C. Haase, S. Schmitz and Ph. SchnoebelenThe Power of Priority Channel SystemsLogical Methods in Computer Science 10(4:4), 2014. ( Web page | PDF | BibTeX + Abstract )
doi: 10.2168/LMCS-10(4:4)2014
KNS14
P. Karandikar, M. Niewerth and Ph. SchnoebelenOn the state complexity of closures and interiors of regular languages with subwords.  Research Report 1406.0690, Computing Research Repository, November 2014. 24 pages. ( Web page | PDF | BibTeX + Abstract )
LS14
J. Leroux and Ph. SchnoebelenOn Functions Weakly Computable by Petri Nets and Vector Addition SystemsIn RP'14, LNCS 8762, pages 190-202. Springer, 2014. ( PDF | BibTeX + Abstract )
doi: 10.1007/978-3-319-11439-2_15
KS14
P. Karandikar and Ph. SchnoebelenOn the state complexity of closures and interiors of regular languages with subwordsIn DCFS'14, LNCS 8614, pages 234-245. Springer-Verlag, 2014. ( PDF | BibTeX + Abstract )
doi: 10.1007/978-3-319-09704-6_21

2013

BS13a
N. Bertrand and Ph. SchnoebelenComputable fixpoints in well-structured symbolic model checkingFormal Methods in System Design 43(2), pages 233-267, 2013. ( PDF | BibTeX + Abstract )
doi: 10.1007/s10703-012-0168-y
HSS13
C. Haase, S. Schmitz and Ph. SchnoebelenThe Power of Priority Channel SystemsIn CONCUR'13, LNCS 8052, pages 319-333. Springer, 2013. ( Web page | PDF | BibTeX + Abstract )
doi: 10.1007/978-3-642-40184-8_23
SS13
S. Schmitz and Ph. SchnoebelenThe Power of Well-Structured SystemsIn CONCUR'13, LNCS 8052, pages 5-24. Springer, 2013. ( Web page | PDF | BibTeX + Abstract )
doi: 10.1007/978-3-642-40184-8_2
BS13b
N. Bertrand and Ph. SchnoebelenSolving stochastic Büchi games on infinite arenas with a finite attractorIn QAPL'13, Electronic Proceedings in Theoretical Computer Science 117, pages 116-131. 2013. ( PDF | BibTeX + Abstract )
doi: 10.4204/EPTCS.117.8

2012

JKS12
P. Jancar, P. Karandikar and Ph. SchnoebelenUnidirectional channel systems can be testedIn IFIP TCS'12, LNCS 7604, pages 149-163. Springer, 2012. ( PDF | BibTeX + Abstract )
doi: 10.1007/978-3-642-33475-7_11
SS12
S. Schmitz and Ph. SchnoebelenAlgorithmic Aspects of WQO Theory.  Lecture Notes. 2012. ( Web page | PDF | BibTeX )
BMO+12
P. Bouyer, N. Markey, J. Ouaknine, Ph. Schnoebelen and J. WorrellOn Termination and Invariance for Faulty Channel SystemsFormal Aspects of Computing 24(4-6), pages 595-607, 2012. ( PDF | BibTeX + Abstract )
doi: 10.1007/s00165-012-0234-7
KS12
P. Karandikar and Ph. SchnoebelenCutting Through Regular Post Embedding ProblemsIn CSR'12, LNCS 7353, pages 229-240. Springer, 2012. ( PDF | PDF (long version) | BibTeX + Abstract )
doi: 10.1007/978-3-642-30642-6_22
HSS12
S. Haddad, S. Schmitz and Ph. SchnoebelenThe Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched NetsIn LICS'12, pages 355-364. IEEE Computer Society Press, 2012. ( Web page | PDF | BibTeX + Abstract )
doi: 10.1109/LICS.2012.46

2011

SS11
S. Schmitz and Ph. SchnoebelenMultiply-Recursive Upper Bounds with Higman's LemmaIn ICALP'11, LNCS 6756, pages 441-452. Springer, 2011. ( Web page | PDF | PDF (long version) | BibTeX + Abstract )
doi: 10.1007/978-3-642-22012-8_35
FFSS11
D. Figueira, S. Figueira, S. Schmitz and Ph. SchnoebelenAckermannian and Primitive-Recursive Bounds with Dickson's LemmaIn LICS'11, pages 269-278. IEEE Computer Society Press, 2011. ( Web page | PDF | PDF (long version) | BibTeX + Abstract )
doi: 10.1109/LICS.2011.39

2010

CS10a
P. Chambart and Ph. SchnoebelenComputing blocker sets for the Regular Post Embedding ProblemIn DLT'10, LNCS 6224, pages 136-147. Springer, 2010. ( PDF | PDF (long version) | BibTeX + Abstract )
doi: 10.1007/978-3-642-14455-4_14
Sch10a
Ph. SchnoebelenLossy Counter Machines Decidability Cheat SheetIn RP'10, LNCS 6227, pages 51-75. Springer, 2010. ( PDF | BibTeX + Abstract )
doi: 10.1007/978-3-642-15349-5_4
Sch10b
Ph. SchnoebelenRevisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri NetsIn MFCS'10, LNCS 6281, pages 616-628. Springer, 2010. ( PDF | BibTeX + Abstract )
doi: 10.1007/978-3-642-15155-2_54
CS10b
P. Chambart and Ph. SchnoebelenPumping and Counting on the Regular Post Embedding ProblemIn ICALP'10, LNCS 6199, pages 64-75. Springer, 2010. ( PDF | PDF (long version) | BibTeX + Abstract )
doi: 10.1007/978-3-642-14162-1_6
CS10c
P. Chambart and Ph. SchnoebelenToward a compositional theory of leftist grammars and transformationsIn FoSSaCS'10, LNCS 6014, pages 237-251. Springer, 2010. ( PDF | BibTeX + Abstract )
doi: 10.1007/978-3-642-12032-9_17

2008

CS08a
P. Chambart and Ph. SchnoebelenMixing Lossy and Perfect Fifo ChannelsIn CONCUR'08, LNCS 5201, pages 340-355. Springer, 2008. ( PDF | PS | PS.GZ | PDF (long version) | PS (long version) | PS.GZ (long version) | BibTeX + Abstract )
doi: 10.1007/978-3-540-85361-9_28
CS08b
P. Chambart and Ph. SchnoebelenThe Ordinal Recursive Complexity of Lossy Channel SystemsIn LICS'08, pages 205-216. IEEE Computer Society Press, 2008. ( PDF | BibTeX + Abstract )
doi: 10.1109/LICS.2008.47
CS08c
P. Chambart and Ph. SchnoebelenThe ω-Regular Post Embedding ProblemIn FoSSaCS'08, LNCS 4962, pages 97-111. Springer, 2008. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1007/978-3-540-78499-9_8
BMO+08
P. Bouyer, N. Markey, J. Ouaknine, Ph. Schnoebelen and J. WorrellOn Termination for Faulty Channel MachinesIn STACS'08, Leibniz International Proceedings in Informatics 1, pages 121-132. Leibniz-Zentrum für Informatik, 2008. ( PDF | PS | PS.GZ | BibTeX + Abstract )

2007

BBS07
C. Baier, N. Bertrand and Ph. SchnoebelenVerifying nondeterministic probabilistic channel systems against ω-regular linear-time propertiesACM Transactions on Computational Logic 9(1), 2007. ( Web page | PDF | PS | BibTeX + Abstract )
doi: 10.1145/1297658.1297663
CS07
P. Chambart and Ph. SchnoebelenPost Embedding Problem is not Primitive Recursive, with Applications to Channel SystemsIn FSTTCS'07, LNCS 4855, pages 265-276. Springer, 2007. ( PDF | PS | PS.GZ | PDF (long version) | BibTeX + Abstract )
doi: 10.1007/978-3-540-77050-3_22
Sch07
Ph. SchnoebelenModel Checking Branching-Time LogicsIn TIME'07, page 5. IEEE Computer Society Press, 2007. ( PDF | PS | PS.GZ | Slides | BibTeX )
doi: 10.1109/TIME.2007.52

2006

BBS06a
C. Baier, N. Bertrand and Ph. SchnoebelenOn Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel SystemsIn LPAR'06, LNAI 4246, pages 347-361. Springer, 2006. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1007/11916277_24
BBS06b
C. Baier, N. Bertrand and Ph. SchnoebelenSymbolic verification of communicating systems with probabilistic message losses: liveness and fairnessIn FORTE'06, LNCS 4229, pages 212-227. Springer, 2006. ( PDF | PS | PS.GZ | PDF (long version) | PS (long version) | PS.GZ (long version) | BibTeX + Abstract )
doi: 10.1007/11888116_17
KS06
A. Kucera and Ph. SchnoebelenA General Approach to Comparing Infinite-State Systems with Their Finite-State SpecificationsTheoretical Computer Science 358(2-3), pages 315-333, 2006. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1016/j.tcs.2006.01.021
BS06
N. Bertrand and Ph. SchnoebelenA short visit to the STS hierarchyIn EXPRESS'05, ENTCS 154(3), pages 59-69. Elsevier Science Publishers, 2006. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1016/j.entcs.2006.05.007
RS06
A. Rabinovich and Ph. SchnoebelenBTL2 and the expressive power of ECTL+Information and Computation 204(7), pages 1023-1044, 2006. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1016/j.ic.2005.07.006
DLS06
S. Demri, F. Laroussinie and Ph. SchnoebelenA Parametric Analysis of the State Explosion Problem in Model CheckingJournal of Computer and System Sciences 72(4), pages 547-575, 2006. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1016/j.jcss.2005.11.003
LMS06
F. Laroussinie, N. Markey and Ph. SchnoebelenEfficient Timed Model Checking for Discrete-Time SystemsTheoretical Computer Science 353(1-3), pages 249-271, 2006. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1016/j.tcs.2005.11.020
MS06
N. Markey and Ph. SchnoebelenMu-Calculus Path CheckingInformation Processing Letters 97(6), pages 225-230, 2006. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1016/j.ipl.2005.11.010
BBS06c
C. Baier, N. Bertrand and Ph. SchnoebelenA note on the attractor-property of infinite-state Markov chainsInformation Processing Letters 97(2), pages 58-63, 2006. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1016/j.ipl.2005.09.011

2005

BS05
B. Bouyssonouse and J. Sifakis (eds.)Embedded Systems Design: The ARTIST Roadmap for Research and Development, LNCS 3436. Springer, 2005. ( Web page | BibTeX )
doi: 10.1007/b106761
ABRS05
P. A. Abdulla, N. Bertrand, A. Rabinovich and Ph. SchnoebelenVerification of Probabilistic Systems with Faulty CommunicationInformation and Computation 202(2), pages 141-165, 2005. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1016/j.ic.2005.05.008
LS05
D. Lugiez and Ph. SchnoebelenDecidable first-order transition logics for PA-processesInformation and Computation 203(1), pages 75-113, 2005. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1016/j.ic.2005.02.003
BFLS05
S. Bardin, A. Finkel, J. Leroux and Ph. SchnoebelenFlat acceleration in symbolic model checkingIn ATVA'05, LNCS 3707, pages 474-488. Springer, 2005. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1007/11562948_35

2004

Sch04a
Ph. SchnoebelenThe Verification of Probabilistic Lossy Channel SystemsIn Validation of Stochastic Systems, LNCS 2925, pages 445-465. Springer, 2004. ( PDF | PS | PS.GZ | BibTeX + Abstract )
MS04a
N. Markey and Ph. SchnoebelenSymbolic Model Checking for Simply-Timed SystemsIn FORMATS'04/FTRTFT'04, LNCS 3253, pages 102-117. Springer, 2004. ( PDF | PS | PS.GZ | Slides | BibTeX + Abstract )
MS04b
N. Markey and Ph. SchnoebelenTSMV: A Symbolic Model Checker for Quantitative Analysis of SystemsIn QEST'04, pages 330-331. IEEE Computer Society Press, 2004. ( PDF | PS | PS.GZ | Slides | BibTeX + Abstract )
doi: 10.1109/QEST.2004.10028
KS04
A. Kucera and Ph. SchnoebelenA General Approach to Comparing Infinite-State Systems with Their Finite-State SpecificationsIn CONCUR'04, LNCS 3170, pages 372-386. Springer, 2004. ( PDF | BibTeX + Abstract )
doi: 10.1007/978-3-540-28644-8_24
LMS04
F. Laroussinie, N. Markey and Ph. SchnoebelenModel Checking Timed Automata with One or Two ClocksIn CONCUR'04, LNCS 3170, pages 387-401. Springer, 2004. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1007/978-3-540-28644-8_25
Sch04b
Ph. Schnoebelen (ed.)Proceedings of the 5th International Workshop on Verification of Infinite State Systems (INFINITY'03), Marseilles, France, September 2003, ENTCS 98. Elsevier Science Publishers, 2004. ( BibTeX )
doi: 10.1016/j.entcs.2003.10.001
BS04
N. Bertrand and Ph. SchnoebelenVerifying Nondeterministic Channel Systems With Probabilistic Message LossesIn AVIS'04. 2004. ( PDF | BibTeX + Abstract )
MS04c
N. Markey and Ph. SchnoebelenA PTIME-Complete Matching Problem for SLP-Compressed WordsInformation Processing Letters 90(1), pages 3-6, 2004. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1016/j.ipl.2004.01.002

2003

Sch03a
Ph. SchnoebelenThe Complexity of Temporal Logic Model CheckingIn AiML'02, pages 393-436. King's College Publication, 2003. Invited paper. ( PDF | PS | PS.GZ | BibTeX )
MS03
N. Markey and Ph. SchnoebelenModel Checking a Path (Preliminary Report)In CONCUR'03, LNCS 2761, pages 251-265. Springer, 2003. ( PDF | PS | PS.GZ | Slides | BibTeX + Abstract )
doi: 10.1007/b11938
Sch03b
Ph. SchnoebelenOracle circuits for branching-time model checkingIn ICALP'03, LNCS 2719, pages 790-801. Springer, 2003. ( PDF | PS | PS.GZ | BibTeX + Abstract )
BS03
N. Bertrand and Ph. SchnoebelenModel Checking Lossy Channels Systems Is Probably DecidableIn FoSSaCS'03, LNCS 2620, pages 120-135. Springer, 2003. ( PDF | PS | PS.GZ | BibTeX + Abstract )
LST03
F. Laroussinie, Ph. Schnoebelen and M. TuruaniOn the Expressivity and Complexity of Quantitative Branching-Time Temporal LogicsTheoretical Computer Science 297(1-3), pages 297-315, 2003. ( PS | PS.GZ | BibTeX + Abstract )
doi: 10.1016/S0304-3975(02)00644-8

2002

HS02
S. Hornus and Ph. SchnoebelenOn Solving Temporal Logic QueriesIn AMAST'02, LNCS 2422, pages 163-177. Springer, 2002. ( PDF | PS | PS.GZ | BibTeX + Abstract )
Sch02
Ph. SchnoebelenVerifying Lossy Channel Systems has Nonprimitive Recursive ComplexityInformation Processing Letters 83(5), pages 251-261, 2002. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1016/S0020-0190(01)00337-4
MS02
B. Masson and Ph. SchnoebelenOn Verifying Fair Lossy Channel SystemsIn MFCS'02, LNCS 2420, pages 543-555. Springer, 2002. ( PDF (long version) | PS (long version) | PS.GZ (long version) | BibTeX + Abstract )
LS02a
A. Labroue and Ph. SchnoebelenAn Automata-Theoretic Approach to the Reachability Analysis of RPPS SystemsNordic Journal of Computing 9(2), pages 118-144, 2002. ( PS | PS.GZ | BibTeX + Abstract )
LMS02a
F. Laroussinie, N. Markey and Ph. SchnoebelenTemporal Logic with Forgettable PastIn LICS'02, pages 383-392. IEEE Computer Society Press, 2002. ( PDF | PS | PS.GZ | Slides | BibTeX + Abstract )
doi: 10.1109/LICS.2002.1029846
DS02
S. Demri and Ph. SchnoebelenThe Complexity of Propositional Linear Temporal Logics in Simple CasesInformation and Computation 174(1), pages 84-103, 2002. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1006/inco.2001.3094
LMS02b
F. Laroussinie, N. Markey and Ph. SchnoebelenOn Model Checking Durational Kripke Structures (Extended Abstract)In FoSSaCS'02, LNCS 2303, pages 264-279. Springer, 2002. ( PDF | PS | PS.GZ | Slides | BibTeX + Abstract )
DLS02
S. Demri, F. Laroussinie and Ph. SchnoebelenA Parametric Analysis of the State Explosion Problem in Model Checking (Extended Abstract)In STACS'02, LNCS 2285, pages 620-631. Springer, 2002. ( PDF | PS | PS.GZ | BibTeX + Abstract )
LS02b
D. Lugiez and Ph. SchnoebelenThe Regular Viewpoint on PA-ProcessesTheoretical Computer Science 274(1-2), pages 89-115, 2002. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1016/S0304-3975(00)00306-6

2001

BBF+01
B. Bérard, M. Bidoit, A. Finkel, F. Laroussinie, A. Petit, L. Petrucci and Ph. SchnoebelenSystems and Software Verification. Model-Checking Techniques and Tools. Springer, 2001. ( Web page | BibTeX )
Sch01a
Ph. SchnoebelenBisimulation and Other Undecidable Equivalences for Lossy Channel SystemsIn TACS'01, LNCS 2215, pages 385-399. Springer, 2001. ( PDF | PS | PS.GZ | BibTeX + Abstract )
Sch01b
Ph. SchnoebelenSpécification et vérification des systèmes concurrents.  Mémoire d'habilitation, Université Paris 7, Paris, France, October 2001. ( PS | PS.GZ | BibTeX )
FS01
A. Finkel and Ph. SchnoebelenWell-Structured Transition Systems Everywhere!  Theoretical Computer Science 256(1-2), pages 63-92, 2001. ( PDF | PS | PS.GZ | BibTeX + Abstract )
doi: 10.1016/S0304-3975(00)00102-X
LMS01
F. Laroussinie, N. Markey and Ph. SchnoebelenModel checking CTL+ and FCTL is hardIn FoSSaCS'01, LNCS 2030, pages 318-331. Springer, 2001. ( PDF | PS | PS.GZ | Slides | BibTeX + Abstract )

2000

LS00a
I. A. Lomazova and Ph. SchnoebelenSome Decidability Results for Nested Petri NetsIn PSI'99, LNCS 1755, pages 208-220. Springer, 2000. ( PS | PS.GZ | BibTeX )
CCL+00
G. Canet, S. Couffin, J.-J. Lesage, A. Petit and Ph. SchnoebelenTowards the Automatic Verification of PLC Programs Written in Instruction ListIn SMC 2000, pages 2449-2454. Argos Press, 2000. ( PS | PS.GZ | BibTeX + Abstract )
doi: 10.1109/ICSMC.2000.884359
DCR+00
O. De Smet, S. Couffin, O. Rossi, G. Canet, J.-J. Lesage, Ph. Schnoebelen and H. PapiniSafe Programming of PLC Using Formal Verification MethodsIn ICP 2000, pages 73-78. PLCopen, 2000. ( PS | PS.GZ | BibTeX )
RS00
O. Rossi and Ph. SchnoebelenFormal modeling of timed function blocks for the automatic verification of Ladder Diagram programsIn ADPM 2000, pages 177-182. Shaker Verlag, 2000. ( PS | PS.GZ | BibTeX )
CDP+00
G. Canet, B. Denis, A. Petit, O. Rossi and Ph. SchnoebelenUn cadre pour la vérification automatique de programmes ILIn CIFA 2000, pages 693-698. Union des Chercheurs Ingénieurs et Scientifiques, Villeneuve d'Ascq, France, 2000. ( PS | PS.GZ | BibTeX )
LS00b
D. Lugiez and Ph. SchnoebelenDecidable First-Order Transition Logics for PA-ProcessesIn ICALP 2000, LNCS 1853, pages 342-353. Springer, 2000. ( PS | PS.GZ | BibTeX )
SS00
Ph. Schnoebelen and N. SidorovaBisimulation and the Reduction of Petri NetsIn ICATPN 2000, LNCS 1825, pages 409-423. Springer, 2000. ( PS | PS.GZ | BibTeX )
BLS00
B. Bérard, A. Labroue and Ph. SchnoebelenVerifying Performance Equivalence for Timed Basic Parallel ProcessesIn FoSSaCS 2000, LNCS 1784, pages 35-47. Springer, 2000. ( PS | PS.GZ | BibTeX )
LS00c
F. Laroussinie and Ph. SchnoebelenThe State-Explosion Problem from Trace to Bisimulation EquivalenceIn FoSSaCS 2000, LNCS 1784, pages 192-207. Springer, 2000. ( PS | PS.GZ | BibTeX )
LS00d
F. Laroussinie and Ph. SchnoebelenSpecification in CTL+Past for verification in CTLInformation and Computation 156(1-2), pages 236-263, 2000. ( PS | PS.GZ | BibTeX )
doi: 10.1006/inco.1999.2817

1999

DJS99
C. Dufourd, P. Jancar and Ph. SchnoebelenBoundedness of Reset P/T NetsIn ICALP'99, LNCS 1644, pages 301-310. Springer, 1999. ( PS | PS.GZ | BibTeX + Abstract )
SBB+99
Ph. Schnoebelen, B. Bérard, M. Bidoit, F. Laroussinie and A. PetitVérification de logiciels : techniques et outils du model-checking. Vuibert, 1999. ( Web page | BibTeX )
Sch99
Ph. SchnoebelenDecomposable Regular Languages and the Shuffle OperatorEATCS Bulletin 67, pages 283-289, 1999. ( PDF | PS | PS.GZ | BibTeX )

1998

DFS98
C. Dufourd, A. Finkel and Ph. SchnoebelenReset Nets between Decidability and UndecidabilityIn ICALP'98, LNCS 1443, pages 103-115. Springer, 1998. ( PS | PS.GZ | BibTeX + Abstract )
doi: 10.1007/BFb0055044
FS98
A. Finkel and Ph. SchnoebelenFundamental Structures in Well-Structured Infinite Transition SystemsIn LATIN'98, LNCS 1380, pages 102-118. Springer, 1998. ( PS | PS.GZ | BibTeX )
doi: 10.1007/BFb0054314

1997

KS97a
O. Kouchnarenko and Ph. SchnoebelenA Model for Recursive-Parallel ProgramsIn INFINITY'96, ENTCS 5, page 30. Elsevier Science Publishers, 1997. ( Web page | PDF | PS | PS.GZ | BibTeX )
doi: 10.1016/S1571-0661(05)82512-5
KS97b
O. Kouchnarenko and Ph. SchnoebelenA Formal Framework for the Analysis of Recursive-Parallel ProgramsIn PaCT'97, LNCS 1277, pages 45-59. Springer, 1997. ( Web page | PDF | PS | PS.GZ | BibTeX )
doi: 10.1007/3-540-63371-5_6

1996

KS96
O. Kouchnarenko and Ph. SchnoebelenModèles formels pour les programmes récursifs-parallèlesIn RENPAR'96, pages 85-88. 1996. ( PS | PS.GZ | BibTeX )

1995

LS95
F. Laroussinie and Ph. SchnoebelenA Hierarchy of Temporal Logics with PastTheoretical Computer Science 148(2), pages 303-324, 1995. ( PS | PS.GZ | BibTeX )
doi: 10.1016/0304-3975(95)00035-U
LPS95
F. Laroussinie, S. Pinchinat and Ph. SchnoebelenTranslations between Modal Logics of Reactive SystemsTheoretical Computer Science 140(1), pages 53-71, 1995. ( PS | PS.GZ | BibTeX )
doi: 10.1016/0304-3975(94)00204-V

1994

LPS94
F. Laroussinie, S. Pinchinat and Ph. SchnoebelenTranslation Results for Modal Logics of Reactive SystemsIn AMAST'93, Workshops in Computing, pages 299-310. Springer-Verlag, 1994. ( BibTeX )
APS94
C. Autant, W. Pfister and Ph. SchnoebelenPlace Bisimulations for the Reduction of Labeled Petri Nets with Silent MovesIn ICCI'94, pages 230-246. 1994. ( PS | PS.GZ | BibTeX )
PLS94
S. Pinchinat, F. Laroussinie and Ph. SchnoebelenLogical Characterizations of Truly Concurrent Bisimulation.  Technical Report 114, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, March 1994. ( PS | PS.GZ | BibTeX )
LS94
F. Laroussinie and Ph. SchnoebelenA Hierarchy of Temporal Logics with PastIn STACS'94, LNCS 775, pages 47-58. Springer-Verlag, 1994. ( BibTeX )
doi: 10.1007/3-540-57785-8_130

1992

AS92
C. Autant and Ph. SchnoebelenPlace Bisimulations in Petri NetsIn APN'92, LNCS 616, pages 45-61. Springer-Verlag, 1992. ( BibTeX )
doi: 10.1007/3-540-55676-1_3

1991

CS91
F. Cherief and Ph. Schnoebelenτ-Bisimulations and Full Abstraction for Refinement of ActionsInformation Processing Letters 40(4), pages 219-222, 1991. ( BibTeX )
doi: 10.1016/0020-0190(91)90081-R
Sch91
Ph. SchnoebelenExperiments on Processes with BacktrackingIn CONCUR'91, LNCS 527, pages 480-494. Springer-Verlag, 1991. ( BibTeX )
doi: 10.1007/3-540-54430-5_108
ABS91
C. Autant, Z. Belmesk and Ph. SchnoebelenStrong Bisimilarity on Nets RevisitedIn PARLE'91, LNCS 506, pages 295-312. Springer-Verlag, 1991. ( BibTeX )
doi: 10.1007/3-540-54152-7_71
CLS91
H. Comon, D. Lugiez and Ph. SchnoebelenA Rewrite-Based Type Discipline for a Subset of Computer AlgebraJournal of Symbolic Computation 11(4), pages 349-368, 1991. ( BibTeX )

1990

ABS90
C. Autant, Z. Belmesk and Ph. SchnoebelenA Net-Theoretic Approach to the Efficient Implementation of the FP2 Parallel LanguageIn APN'90, pages 451-470. 1990. ( BibTeX )
Sch90
Ph. SchnoebelenSémantique du parallélisme et logique temporelle. Application au langage FP2.  Thèse de doctorat, Institut National Polytechnique de Grenoble, France, June 1990. ( BibTeX )
SP90
Ph. Schnoebelen and S. PinchinatOn the Weak Adequacy of Branching-Time Temporal LogicIn ESOP'90, LNCS 432, pages 377-388. Springer-Verlag, 1990. ( BibTeX )
doi: 10.1007/3-540-52592-0_75

1989

SJ89
Ph. Schnoebelen and Ph. JorrandPrinciples of FP2: Term Algebras for Specification of Parallel MachinesIn Languages for Parallel Architectures: Design, Semantics, Implementation Models, chapter 5, pages 223-273. John Wiley & Sons, Ltd., 1989. ( BibTeX )

1988

Sch88a
Ph. SchnoebelenRefined Compilation of Pattern-Matching for Functional LanguagesScience of Computer Programming 11(2), pages 133-159, 1988. ( BibTeX )
doi: 10.1016/0167-6423(88)90002-0
Sch88b
Ph. SchnoebelenRefined Compilation of Pattern-Matching for Functional LanguagesIn ALP'88, LNCS 343, pages 233-243. Springer-Verlag, 1988. ( BibTeX )
doi: 10.1007/3-540-50667-5_75

1987

SS87
P. Schäfer and Ph. SchnoebelenSpecification of a Pipelined Event-Driven Simulator Using FP2In PARLE'87, LNCS 258, pages 311-328. Springer-Verlag, 1987. ( BibTeX )
doi: 10.1007/3-540-17943-7_136
Sch87
Ph. SchnoebelenRewriting Techniques for the Temporal Analysis of Communicating ProcessesIn PARLE'87, LNCS 259, pages 402-419. Springer-Verlag, 1987. ( BibTeX )
doi: 10.1007/3-540-17945-3_23

About LSV

Search this list

Search the LSV database


highlight select