Publications : Philippe SCHNOEBELEN

[Sch21]

Ph. Schnoebelen. On flat lossy channel machines. In Proceedings of the 29th Annual EACSL Conference on Computer Science Logic (CSL'21), Leibniz International Proceedings in Informatics, pages 37:1--37:22, Ljubljana, Slovenia, January 2021. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2021.37.
[ BibTex | DOI | Web page | PDF ]

[GHK⁺20]

J. Goubault-Larrecq, S. Halfon, P. Karandikar, K. Narayan Kumar, and Ph. Schnoebelen. The Ideal Approach to Computing Closed Subsets in Well-Quasi-Orderings. In Well-Quasi Orders in Computation, Logic, Language and Reasoning, volume 53 of Trends In Logic, pages 55--105. Springer, 2020.
doi: 10.1007/978-3-030-30229-0_3.
[ BibTex | DOI ]

[DSS20]

M. Džamonja, S. Schmitz, and Ph. Schnoebelen. On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders. In Well-Quasi Orders in Computation, Logic, Language and Reasoning, volume 53 of Trends In Logic, pages 2--54. Springer, 2020.
doi: 10.1007/978-3-030-30229-0_2.
[ BibTex | DOI ]

[KS19]

P. Karandikar and Ph. Schnoebelen. The height of piecewise-testable languages and the complexity of the logic of subwords. Logical Methods in Computer Science, 15(2):6:1--6:27, April 2019.
[ BibTex | Web page | PDF ]

[HS19]

S. Halfon and Ph. Schnoebelen. On shuffle products, acyclic automata and piecewise-testable languages. Information Processing Letters, 145:68--73, 2019.
doi: 10.1016/j.ipl.2019.01.012.
[ BibTex | DOI ]

[LPSS19]

J. Leroux, M. Praveen, G. Sutre, and Ph. Schnoebelen. On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. Logical Methods in Computer Science, 15(4), 2019.
doi: 10.23638/LMCS-15(4:15)2019.
[ BibTex | DOI | PDF ]

[Sch17]

Ph. Schnoebelen. Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk). In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS'17), volume 83 of Leibniz International Proceedings in Informatics, pages 85:1--85:4, Aalborg, Denmark, August 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2017.85.
[ BibTex | DOI | Web page | PDF ]

[HSZ17]

S. Halfon, Ph. Schnoebelen, and G. Zetzsche. Decidability, complexity, and expressiveness of first-order logic over the subword ordering. In Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'17), pages 1--12, Reykjavik, Iceland, June 2017. IEEE Press.
doi: 10.1109/LICS.2017.8005141.
[ BibTex | DOI | Web page ]

[KS15a]

P. Karandikar and Ph. Schnoebelen. Decidability in the logic of subsequences and supersequences. In Proceedings of the 35th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), volume 45 of Leibniz International Proceedings in Informatics, pages 84--97, Bangalore, India, December 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2015.84.
[ BibTex | DOI | Web page | PDF ]

[KS15b]

P. Karandikar and Ph. Schnoebelen. Generalized Post Embedding Problems. Theory of Computing Systems, 56(4):697--716, May 2015.
doi: 10.1007/s00224-014-9561-9.
[ BibTex | DOI | Web page | PDF ]

[JKS15]

P. Jancar, P. Karandikar, and Ph. Schnoebelen. On Reachability for Unidirectional Channel Systems Extended with Regular Tests. Logical Methods in Computer Science, 11(2:2), April 2015.
doi: 10.2168/LMCS-11(2:2)2015.
[ BibTex | DOI | Web page | PDF ]

[KKS15]

P. Karandikar, M. Kufleitner, and Ph. Schnoebelen. On the index of Simon's congruence for piecewise testability. Information Processing Letters, 15(4):515--519, April 2015.
doi: 10.1016/j.ipl.2014.11.008.
[ BibTex | DOI | Web page | PDF ]

[HSS14]

C. Haase, S. Schmitz, and Ph. Schnoebelen. The Power of Priority Channel Systems. Logical Methods in Computer Science, 10(4:4), December 2014.
doi: 10.2168/LMCS-10(4:4)2014.
[ BibTex | DOI | Web page | PDF ]

[KNS14]

P. Karandikar, M. Niewerth, and Ph. Schnoebelen. On the state complexity of closures and interiors of regular languages with subwords. Research Report 1406.0690, Computing Research Repository, November 2014. 24 pages.
[ BibTex | Web page | PDF ]

[LS14]

J. Leroux and Ph. Schnoebelen. On Functions Weakly Computable by Petri Nets and Vector Addition Systems. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), volume 8762 of Lecture Notes in Computer Science, pages 190--202, Oxford, UK, September 2014. Springer.
doi: 10.1007/978-3-319-11439-2_15.
[ BibTex | DOI | Web page | PDF ]

[KS14]

P. Karandikar and Ph. Schnoebelen. On the state complexity of closures and interiors of regular languages with subwords. In Proceedings of the 16th Workshop on Descriptional Complexity of Formal Systems (DCFS'14), volume 8614 of Lecture Notes in Computer Science, pages 234--245, Turku, Finland, August 2014. Springer-Verlag.
doi: 10.1007/978-3-319-09704-6_21.
[ BibTex | DOI | Web page | PDF ]

[BS13a]

N. Bertrand and Ph. Schnoebelen. Computable fixpoints in well-structured symbolic model checking. Formal Methods in System Design, 43(2):233--267, October 2013.
doi: 10.1007/s10703-012-0168-y.
[ BibTex | DOI | Web page | PDF ]

[SS13]

S. Schmitz and Ph. Schnoebelen. The Power of Well-Structured Systems. In Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), volume 8052 of Lecture Notes in Computer Science, pages 5--24, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40184-8_2.
[ BibTex | DOI | Web page | PDF ]

[BS13b]

N. Bertrand and Ph. Schnoebelen. Solving stochastic Büchi games on infinite arenas with a finite attractor. In Proceedings of the 11th International Workshop on Quantitative Aspects of Programming Languages (QAPl'13), volume 117 of Electronic Proceedings in Theoretical Computer Science, pages 116--131, Rome, Italy, June 2013.
doi: 10.4204/EPTCS.117.8.
[ BibTex | DOI | Web page | PDF ]

[SS12]

S. Schmitz and Ph. Schnoebelen. Algorithmic Aspects of WQO Theory. Lecture Notes, August 2012.
[ BibTex | Web page | PDF ]

[BMO⁺12]

P. Bouyer, N. Markey, J. Ouaknine, Ph. Schnoebelen, and J. Worrell. On Termination and Invariance for Faulty Channel Systems. Formal Aspects of Computing, 24(4-6):595--607, July 2012.
doi: 10.1007/s00165-012-0234-7.
[ BibTex | DOI | Web page | PDF ]

[KS12]

P. Karandikar and Ph. Schnoebelen. Cutting Through Regular Post Embedding Problems. In Proceedings of the 7th International Computer Science Symposium in Russia (CSR'12), volume 7353 of Lecture Notes in Computer Science, pages 229--240, Nizhni Novgorod, Russia, July 2012. Springer.
doi: 10.1007/978-3-642-30642-6_22.
[ BibTex | DOI | Web page | PDF ]

[HSS12]

S. Haddad, S. Schmitz, and Ph. Schnoebelen. The Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets. In Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science (LICS'12), pages 355--364, Dubrovnik, Croatia, June 2012. IEEE Computer Society Press.
doi: 10.1109/LICS.2012.46.
[ BibTex | DOI | Web page | PDF ]

[SS11]

S. Schmitz and Ph. Schnoebelen. Multiply-Recursive Upper Bounds with Higman's Lemma. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP'11) -- Part II, volume 6756 of Lecture Notes in Computer Science, pages 441--452, Zürich, Switzerland, July 2011. Springer.
doi: 10.1007/978-3-642-22012-8_35.
[ BibTex | DOI | Web page | PDF ]

[FFSS11]

D. Figueira, S. Figueira, S. Schmitz, and Ph. Schnoebelen. Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. In Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS'11), pages 269--278, Toronto, Canada, June 2011. IEEE Computer Society Press.
doi: 10.1109/LICS.2011.39.
[ BibTex | DOI | Web page | PDF ]

[Sch10a]

Ph. Schnoebelen. Lossy Counter Machines Decidability Cheat Sheet. In Proceedings of the 4th Workshop on Reachability Problems in Computational Models (RP'10), volume 6227 of Lecture Notes in Computer Science, pages 51--75, Brno, Czech Republic, August 2010. Springer.
doi: 10.1007/978-3-642-15349-5_4.
[ BibTex | DOI | Web page | PDF ]

[Sch10b]

Ph. Schnoebelen. Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS'10), volume 6281 of Lecture Notes in Computer Science, pages 616--628, Brno, Czech Republic, August 2010. Springer.
doi: 10.1007/978-3-642-15155-2_54.
[ BibTex | DOI | Web page | PDF ]

[CS10a]

P. Chambart and Ph. Schnoebelen. Computing blocker sets for the Regular Post Embedding Problem. In Proceedings of the 14th International Conference on Developments in Language Theory (DLT'10), volume 6224 of Lecture Notes in Computer Science, pages 136--147, London, Ontario, Canada, August 2010. Springer.
doi: 10.1007/978-3-642-14455-4_14.
[ BibTex | DOI | Web page | PDF ]

[CS10b]

P. Chambart and Ph. Schnoebelen. Pumping and Counting on the Regular Post Embedding Problem. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) -- Part II, volume 6199 of Lecture Notes in Computer Science, pages 64--75, Bordeaux, France, July 2010. Springer.
doi: 10.1007/978-3-642-14162-1_6.
[ BibTex | DOI | Web page | PDF ]

[CS10c]

P. Chambart and Ph. Schnoebelen. Toward a compositional theory of leftist grammars and transformations. In Proceedings of the 13th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'10), volume 6014 of Lecture Notes in Computer Science, pages 237--251, Paphos, Cyprus, March 2010. Springer.
doi: 10.1007/978-3-642-12032-9_17.
[ BibTex | DOI | Web page | PDF ]

[Sch08]

Ph. Schnoebelen. The complexity of lossy channel systems. Invited talk, Workshop Automata and Verification (AV'08), Mons, Belgium, August 2008.
[ BibTex ]

[CS08a]

P. Chambart and Ph. Schnoebelen. Mixing Lossy and Perfect Fifo Channels. In Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), volume 5201 of Lecture Notes in Computer Science, pages 340--355, Toronto, Canada, August 2008. Springer.
doi: 10.1007/978-3-540-85361-9_28.
[ BibTex | DOI | Web page | PS | PDF ]

[CS08c]

P. Chambart and Ph. Schnoebelen. The Ordinal Recursive Complexity of Lossy Channel Systems. In Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS'08), pages 205--216, Pittsburgh, Pennsylvania, USA, June 2008. IEEE Computer Society Press.
doi: 10.1109/LICS.2008.47.
[ BibTex | DOI | Web page | PDF ]

[CS08b]

P. Chambart and Ph. Schnoebelen. The ω-Regular Post Embedding Problem. In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), volume 4962 of Lecture Notes in Computer Science, pages 97--111, Budapest, Hungary, March-April 2008. Springer.
doi: 10.1007/978-3-540-78499-9_8.
[ BibTex | DOI | Web page | PS | PDF ]

[BMO⁺08]

P. Bouyer, N. Markey, J. Ouaknine, Ph. Schnoebelen, and J. Worrell. On Termination for Faulty Channel Machines. In Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS'08), volume 1 of Leibniz International Proceedings in Informatics, pages 121--132, Bordeaux, France, February 2008. Leibniz-Zentrum für Informatik.
[ BibTex | Web page | PS | PDF ]

[CS07]

P. Chambart and Ph. Schnoebelen. Post Embedding Problem is not Primitive Recursive, with Applications to Channel Systems. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 265--276, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_22.
[ BibTex | DOI | Web page | PS | PDF ]

[BBS07]

C. Baier, N. Bertrand, and Ph. Schnoebelen. Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Transactions on Computational Logic, 9(1), December 2007.
doi: 10.1145/1297658.1297663.
[ BibTex | DOI | Web page | PS | PDF ]

[Sch07]

Ph. Schnoebelen. Model Checking Branching-Time Logics. In Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME'07), page 5, Alicante, Spain, June 2007. IEEE Computer Society Press.
doi: 10.1109/TIME.2007.52.
[ BibTex | DOI | Web page | PS | PDF ]

[BBS06b]

C. Baier, N. Bertrand, and Ph. Schnoebelen. On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. In Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'06), volume 4246 of Lecture Notes in Artificial Intelligence, pages 347--361, Phnom Penh, Cambodia, November 2006. Springer.
doi: 10.1007/11916277_24.
[ BibTex | DOI | Web page | PS | PDF ]

[Sch06]

Ph. Schnoebelen. De nouvelles applications pour le model-checking. Invited lecture, Journées à l'occasion des 20 ans du LIPN, Villetaneuse, France, November 2006.
[ BibTex ]

[SBS06]

Ph. Schnoebelen, A. Bouajjani, and G. Sutre. ACI Sécurité Informatique PERSÉE --- Rapport final, November 2006. 12 pages.
[ BibTex | Web page | PDF ]

[BBS06c]

C. Baier, N. Bertrand, and Ph. Schnoebelen. Symbolic verification of communicating systems with probabilistic message losses: liveness and fairness. In Proceedings of 26th IFIP WG6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'06), volume 4229 of Lecture Notes in Computer Science, pages 212--227, Paris, France, September 2006. Springer.
doi: 10.1007/11888116_17.
[ BibTex | DOI | Web page | PS | PDF ]

[KS06]

A. Kučera and Ph. Schnoebelen. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. Theoretical Computer Science, 358(2-3):315--333, August 2006.
doi: 10.1016/j.tcs.2006.01.021.
[ BibTex | DOI | Web page | PS | PDF ]

[BS06]

N. Bertrand and Ph. Schnoebelen. A short visit to the STS hierarchy. In Proceedings of the 12th International Workshop on Expressiveness in Concurrency (EXPRESS'05), volume 154 of Electronic Notes in Theoretical Computer Science, pages 59--69, San Francisco, California, USA, July 2006. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2006.05.007.
[ BibTex | DOI | Web page | PS | PDF ]

[RS06]

A. Rabinovich and Ph. Schnoebelen. BTL_2 and the expressive power of ECTL^+. Information and Computation, 204(7):1023--1044, July 2006.
doi: 10.1016/j.ic.2005.07.006.
[ BibTex | DOI | Web page | PS | PDF ]

[DLS06]

S. Demri, F. Laroussinie, and Ph. Schnoebelen. A Parametric Analysis of the State Explosion Problem in Model Checking. Journal of Computer and System Sciences, 72(4):547--575, June 2006.
doi: 10.1016/j.jcss.2005.11.003.
[ BibTex | DOI | Web page | PS | PDF ]

[LMS06]

F. Laroussinie, N. Markey, and Ph. Schnoebelen. Efficient Timed Model Checking for Discrete-Time Systems. Theoretical Computer Science, 353(1-3):249--271, March 2006.
doi: 10.1016/j.tcs.2005.11.020.
[ BibTex | DOI | Web page | PS | PDF ]

[MS06]

N. Markey and Ph. Schnoebelen. Mu-Calculus Path Checking. Information Processing Letters, 97(6):225--230, March 2006.
doi: 10.1016/j.ipl.2005.11.010.
[ BibTex | DOI | Web page | PS | PDF ]

[BBS06a]

C. Baier, N. Bertrand, and Ph. Schnoebelen. A note on the attractor-property of infinite-state Markov chains. Information Processing Letters, 97(2):58--63, January 2006.
doi: 10.1016/j.ipl.2005.09.011.
[ BibTex | DOI | Web page | PS | PDF ]

[ABRS05]

P. A. Abdulla, N. Bertrand, A. Rabinovich, and Ph. Schnoebelen. Verification of Probabilistic Systems with Faulty Communication. Information and Computation, 202(2):141--165, November 2005.
doi: 10.1016/j.ic.2005.05.008.
[ BibTex | DOI | Web page | PS | PDF ]

[LS05]

D. Lugiez and Ph. Schnoebelen. Decidable first-order transition logics for PA-processes. Information and Computation, 203(1):75--113, November 2005.
doi: 10.1016/j.ic.2005.02.003.
[ BibTex | DOI | Web page | PS | PDF ]

[S⁺05]

Ph. Schnoebelen et al. ACI Sécurité Informatique PERSÉE --- Rapport à mi-parcours, November 2005. 8 pages.
[ BibTex ]

[BFLS05]

S. Bardin, A. Finkel, J. Leroux, and Ph. Schnoebelen. Flat acceleration in symbolic model checking. In Proceedings of the 3rd International Symposium on Automated Technology for Verification and Analysis (ATVA'05), volume 3707 of Lecture Notes in Computer Science, pages 474--488, Taipei, Taiwan, October 2005. Springer.
doi: 10.1007/11562948_35.
[ BibTex | DOI | Web page | PS | PDF ]

[MS04b]

N. Markey and Ph. Schnoebelen. Symbolic Model Checking for Simply-Timed Systems. In Proceedings of the Joint Conferences Formal Modelling and Analysis of Timed Systems (FORMATS'04) and Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'04), volume 3253 of Lecture Notes in Computer Science, pages 102--117, Grenoble, France, September 2004. Springer.
[ BibTex | Web page | PS | PDF ]

[MS04c]

N. Markey and Ph. Schnoebelen. TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems. In Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST'04), pages 330--331, Enschede, The Netherlands, September 2004. IEEE Computer Society Press.
doi: 10.1109/QEST.2004.10028.
[ BibTex | DOI | Web page | PS | PDF ]

[KS04]

A. Kučera and Ph. Schnoebelen. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. In Proceedings of the 15th International Conference on Concurrency Theory (CONCUR'04), volume 3170 of Lecture Notes in Computer Science, pages 372--386, London, UK, August 2004. Springer.
doi: 10.1007/978-3-540-28644-8_24.
[ BibTex | DOI | Web page | PDF ]

[LMS04]

F. Laroussinie, N. Markey, and Ph. Schnoebelen. Model Checking Timed Automata with One or Two Clocks. In Proceedings of the 15th International Conference on Concurrency Theory (CONCUR'04), volume 3170 of Lecture Notes in Computer Science, pages 387--401, London, UK, August 2004. Springer.
doi: 10.1007/978-3-540-28644-8_25.
[ BibTex | DOI | Web page | PS | PDF ]

[BS04]

N. Bertrand and Ph. Schnoebelen. Verifying Nondeterministic Channel Systems With Probabilistic Message Losses. In Proceedings of the 3rd International Workshop on Automated Verification of Infinite-State Systems (AVIS'04), Barcelona, Spain, April 2004.
[ BibTex | Web page | PDF ]

[Sch04]

Ph. Schnoebelen. The Verification of Probabilistic Lossy Channel Systems. In Validation of Stochastic Systems: A Guide to Current Research, volume 2925 of Lecture Notes in Computer Science, pages 445--465. Springer, 2004.
[ BibTex | Web page | PS | PDF ]

[MS04a]

N. Markey and Ph. Schnoebelen. A PTIME-Complete Matching Problem for SLP-Compressed Words. Information Processing Letters, 90(1):3--6, January 2004.
doi: 10.1016/j.ipl.2004.01.002.
[ BibTex | DOI | Web page | PS | PDF ]

[MS03b]

N. Markey and Ph. Schnoebelen. TSMV v1.0. Available at http://www.lsv.ens-cachan.fr/~markey/TSMV/, October 2003. See description in [MS04b]. Written in C (about 4000 lines on top of NuSMV v2.1.2).
[ BibTex | Web page ]

[MS03a]

N. Markey and Ph. Schnoebelen. Model Checking a Path (Preliminary Report). In Proceedings of the 14th International Conference on Concurrency Theory (CONCUR'03), volume 2761 of Lecture Notes in Computer Science, pages 251--265, Marseilles, France, August 2003. Springer.
doi: 10.1007/b11938.
[ BibTex | DOI | Web page | PS | PDF ]

[BFNS03]

S. Bardin, A. Finkel, D. Nowak, and Ph. Schnoebelen. Note de synthèse à 6 mois. Contract Report P11L03/F01304/0 + 50.0241, collaboration entre EDF et le LSV, July 2003. 43 pages.
[ BibTex ]

[Sch03c]

Ph. Schnoebelen. Oracle circuits for branching-time model checking. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP'03), volume 2719 of Lecture Notes in Computer Science, pages 790--801, Eindhoven, The Netherlands, June 2003. Springer.
[ BibTex | Web page | PS | PDF ]

[Sch03b]

Ph. Schnoebelen. Model Checking Branching-Time Temporal Logics. Invited talk, Franco-Israeli Workshop on Semantics and Verification of Hardware and Software Systems, Tel-Aviv, Israel, May 2003.
[ BibTex ]

[BS03]

N. Bertrand and Ph. Schnoebelen. Model Checking Lossy Channels Systems Is Probably Decidable. In Proceedings of the 6th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'03), volume 2620 of Lecture Notes in Computer Science, pages 120--135, Warsaw, Poland, April 2003. Springer.
[ BibTex | Web page | PS | PDF ]

[LST03]

F. Laroussinie, Ph. Schnoebelen, and M. Turuani. On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. Theoretical Computer Science, 297(1-3):297--315, March 2003.
doi: 10.1016/S0304-3975(02)00644-8.
[ BibTex | DOI | Web page | PS ]

[Sch03a]

Ph. Schnoebelen. The Complexity of Temporal Logic Model Checking. In Selected Papers from the 4th Workshop on Advances in Modal Logics (AiML'02), pages 393--436, Toulouse, France, 2003. King's College Publication. Invited paper.
[ BibTex | Web page | PS | PDF ]

[HS02a]

N. Halbwachs and Ph. Schnoebelen. Vérification de propriétés quantitatives. Final report, Action Spécifique 22 du Département STIC du CNRS, December 2002.
[ BibTex ]

[HS02b]

S. Hornus and Ph. Schnoebelen. On Solving Temporal Logic Queries. In Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology (AMAST'02), volume 2422 of Lecture Notes in Computer Science, pages 163--177, Saint Gilles les Bains, Reunion Island, France, September 2002. Springer.
[ BibTex | Web page | PS | PDF ]

[Sch02b]

Ph. Schnoebelen. Verifying Lossy Channel Systems has Nonprimitive Recursive Complexity. Information Processing Letters, 83(5):251--261, September 2002.
doi: 10.1016/S0020-0190(01)00337-4.
[ BibTex | DOI | Web page | PS | PDF ]

[MS02]

B. Masson and Ph. Schnoebelen. On Verifying Fair Lossy Channel Systems. In Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS'02), volume 2420 of Lecture Notes in Computer Science, pages 543--555, Warsaw, Poland, August 2002. Springer.
[ BibTex | Web page ]

[LMS02b]

F. Laroussinie, N. Markey, and Ph. Schnoebelen. Temporal Logic with Forgettable Past. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), pages 383--392, Copenhagen, Denmark, July 2002. IEEE Computer Society Press.
doi: 10.1109/LICS.2002.1029846.
[ BibTex | DOI | Web page | PS | PDF ]

[LS02a]

A. Labroue and Ph. Schnoebelen. An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. Nordic Journal of Computing, 9(2):118--144, July 2002.
[ BibTex | Web page | PS ]

[Sch02a]

Ph. Schnoebelen. Temporal Logic and Verification. Invited tutorial, 5th Summer School on Modelling and Verifying Parallel Processes (MOVEP'02), Nantes, France, June 2002.
[ BibTex ]

[DS02]

S. Demri and Ph. Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases. Information and Computation, 174(1):84--103, April 2002.
doi: 10.1006/inco.2001.3094.
[ BibTex | DOI | Web page | PS | PDF ]

[LMS02a]

F. Laroussinie, N. Markey, and Ph. Schnoebelen. On Model Checking Durational Kripke Structures (Extended Abstract). In Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'02), volume 2303 of Lecture Notes in Computer Science, pages 264--279, Grenoble, France, April 2002. Springer.
[ BibTex | Web page | PS | PDF ]

[DLS02]

S. Demri, F. Laroussinie, and Ph. Schnoebelen. A Parametric Analysis of the State Explosion Problem in Model Checking (Extended Abstract). In Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS'02), volume 2285 of Lecture Notes in Computer Science, pages 620--631, Antibes Juan-les-Pins, France, March 2002. Springer.
[ BibTex | Web page | PS | PDF ]

[LS02c]

D. Lugiez and Ph. Schnoebelen. The Regular Viewpoint on PA-Processes. Theoretical Computer Science, 274(1-2):89--115, March 2002.
doi: 10.1016/S0304-3975(00)00306-6.
[ BibTex | DOI | Web page | PS | PDF ]

[LS02b]

A. Labroue and Ph. Schnoebelen. An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. In Proceedings of the 8th International Workshop on Expressiveness in Concurrency (EXPRESS'01), volume 52 of Electronic Notes in Theoretical Computer Science, pages 1--20, Aalborg, Denmark, February 2002. Elsevier Science Publishers.
doi: 10.1016/S1571-0661(04)00213-0.
[ BibTex | DOI | Web page | PS | PDF ]

[Sch01a]

Ph. Schnoebelen. Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems. In Proceedings of the 4th International Workshop on Theoretical Aspects of Computer Software (TACS'01), volume 2215 of Lecture Notes in Computer Science, pages 385--399, Sendai, Japan, October 2001. Springer.
[ BibTex | Web page | PS | PDF ]

[Sch01b]

Ph. Schnoebelen. Spécification et vérification des systèmes concurrents. Mémoire d'habilitation, Université Paris 7, Paris, France, October 2001.
[ BibTex | Web page | PS ]

[FS01]

A. Finkel and Ph. Schnoebelen. Well-Structured Transition Systems Everywhere! Theoretical Computer Science, 256(1-2):63--92, April 2001.
doi: 10.1016/S0304-3975(00)00102-X.
[ BibTex | DOI | Web page | PS | PDF ]

[LMS01]

F. Laroussinie, N. Markey, and Ph. Schnoebelen. Model checking CTL^+ and FCTL is hard. In Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'01), volume 2030 of Lecture Notes in Computer Science, pages 318--331, Genova, Italy, April 2001. Springer.
[ BibTex | Web page | PS | PDF ]

[BBF⁺01]

B. Bérard, M. Bidoit, A. Finkel, F. Laroussinie, A. Petit, L. Petrucci, and Ph. Schnoebelen. Systems and Software Verification. Model-Checking Techniques and Tools. Springer, 2001.
[ BibTex | Web page ]

[DCR⁺00]

O. De Smet, S. Couffin, O. Rossi, G. Canet, J.-J. Lesage, Ph. Schnoebelen, and H. Papini. Safe Programming of PLC Using Formal Verification Methods. In Proceedings of the 4th International PLCopen Conference on Industrial Control Programming (ICP 2000), pages 73--78, Utrecht, The Netherlands, October 2000. PLCopen.
[ BibTex | Web page | PS ]

[CCL⁺00]

G. Canet, S. Couffin, J.-J. Lesage, A. Petit, and Ph. Schnoebelen. Towards the Automatic Verification of PLC Programs Written in Instruction List. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (SMC 2000), pages 2449--2454, Nashville, Tennessee, USA, October 2000. Argos Press.
doi: 10.1109/ICSMC.2000.884359.
[ BibTex | DOI | Web page | PS ]

[RS00]

O. Rossi and Ph. Schnoebelen. Formal modeling of timed function blocks for the automatic verification of Ladder Diagram programs. In Proceedings of the 4th International Conference on Automation of Mixed Processes: Hybrid Dynamic Systems (ADPM 2000), pages 177--182, Dortmund, Germany, September 2000. Shaker Verlag.
[ BibTex | Web page | PS ]

[CDP⁺00]

G. Canet, B. Denis, A. Petit, O. Rossi, and Ph. Schnoebelen. Un cadre pour la vérification automatique de programmes IL. In Actes de la 1ère Conférence Internationale Francophone d'Automatique (CIFA 2000), pages 693--698, Lille, France, July 2000. Union des Chercheurs Ingénieurs et Scientifiques, Villeneuve d'Ascq, France.
[ BibTex | Web page | PS ]

[LS00d]

D. Lugiez and Ph. Schnoebelen. Decidable First-Order Transition Logics for PA-Processes. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP 2000), volume 1853 of Lecture Notes in Computer Science, pages 342--353, Geneva, Switzerland, July 2000. Springer.
[ BibTex | Web page | PS ]

[SS00]

Ph. Schnoebelen and N. Sidorova. Bisimulation and the Reduction of Petri Nets. In Proceedings of the 21st International Conference on Applications and Theory of Petri Nets (ICATPN 2000), volume 1825 of Lecture Notes in Computer Science, pages 409--423, Århus, Denmark, June 2000. Springer.
[ BibTex | Web page | PS ]

[LST00]

F. Laroussinie, Ph. Schnoebelen, and M. Turuani. On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. In Proceedings of the 4th Latin American Symposium on Theoretical Informatics (LATIN 2000), volume 1776 of Lecture Notes in Computer Science, pages 437--446, Punta del Este, Uruguay, April 2000. Springer.
doi: 10.1007/10719839_43.
[ BibTex | DOI | Web page | PS | PDF ]

[BLS00]

B. Bérard, A. Labroue, and Ph. Schnoebelen. Verifying Performance Equivalence for Timed Basic Parallel Processes. In Proceedings of the 3rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2000), volume 1784 of Lecture Notes in Computer Science, pages 35--47, Berlin, Germany, March 2000. Springer.
[ BibTex | Web page | PS ]

[LS00b]

F. Laroussinie and Ph. Schnoebelen. The State-Explosion Problem from Trace to Bisimulation Equivalence. In Proceedings of the 3rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2000), volume 1784 of Lecture Notes in Computer Science, pages 192--207, Berlin, Germany, March 2000. Springer.
[ BibTex | Web page | PS ]

[Sch00]

Ph. Schnoebelen. Le problème de l'explosion du nombre d'états. Invited talk, 8ème Journées Montoises d'Informatique Théorique (JM 2000), Marne-la-Vallée, France, March 2000.
[ BibTex ]

[LS00a]

F. Laroussinie and Ph. Schnoebelen. Specification in CTL+Past for verification in CTL. Information and Computation, 156(1-2):236--263, January 2000.
doi: 10.1006/inco.1999.2817.
[ BibTex | DOI | Web page | PS ]

[LS00c]

I. A. Lomazova and Ph. Schnoebelen. Some Decidability Results for Nested Petri Nets. In Proceedings of the 3rd International Andrei Ershov Memorial Conference on Perspectives of System Informatics (PSI'99), volume 1755 of Lecture Notes in Computer Science, pages 208--220, Novosibirsk, Russia, 2000. Springer.
[ BibTex | Web page | PS ]

[DJS99]

C. Dufourd, P. Jančar, and Ph. Schnoebelen. Boundedness of Reset P/T Nets. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP'99), volume 1644 of Lecture Notes in Computer Science, pages 301--310, Prague, Czech Republic, July 1999. Springer.
[ BibTex | Web page | PS ]

[SBB⁺99]

Ph. Schnoebelen, B. Bérard, M. Bidoit, F. Laroussinie, and A. Petit. Vérification de logiciels : techniques et outils du model-checking. Vuibert, April 1999.
[ BibTex | Web page ]

[Sch99]

Ph. Schnoebelen. Decomposable Regular Languages and the Shuffle Operator. EATCS Bulletin, 67:283--289, February 1999.
[ BibTex | Web page | PS | PDF ]

[LPS98]

F. Laroussinie, A. Petit, and Ph. Schnoebelen. Le model-checking, une technique de vérification en plein essor. I --- Principes et techniques. Contract report, EDF/DER/MOS - LSV, October 1998.
[ BibTex ]

[Sch98a]

Ph. Schnoebelen. Le model-checking, une technique de vérification en plein essor. III --- Spécifier pour vérifier. Contract report, EDF/DER/MOS - LSV, October 1998.
[ BibTex ]

[BCD⁺98]

B. Bérard, G. Cécé, C. Dufourd, A. Finkel, F. Laroussinie, A. Petit, Ph. Schnoebelen, and G. Sutre. Le model-checking, une technique de vérification en plein essor. II --- Quelques outils. Contract report, EDF/DER/MOS - LSV, October 1998.
[ BibTex ]

[LS98]

D. Lugiez and Ph. Schnoebelen. The Regular Viewpoint on PA-Processes. In Proceedings of the 9th International Conference on Concurrency Theory (CONCUR'98), volume 1466 of Lecture Notes in Computer Science, pages 50--66, Nice, France, September 1998. Springer.
doi: 10.1007/BFb0055615.
[ BibTex | DOI | Web page | PS | PDF ]

[DFS98]

C. Dufourd, A. Finkel, and Ph. Schnoebelen. Reset Nets between Decidability and Undecidability. In Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP'98), volume 1443 of Lecture Notes in Computer Science, pages 103--115, Aalborg, Denmark, July 1998. Springer.
doi: 10.1007/BFb0055044.
[ BibTex | DOI | Web page | PS ]

[Sch98b]

Ph. Schnoebelen. Regular Tree Languages for Process Algebra. Invited lecture, 3rd International Workshop on Verification of Infinite State Systems (INFINITY'98), Aalborg, Denmark, July 1998.
[ BibTex ]

[FS98]

A. Finkel and Ph. Schnoebelen. Fundamental Structures in Well-Structured Infinite Transition Systems. In Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN'98), volume 1380 of Lecture Notes in Computer Science, pages 102--118, Campinas, Brasil, April 1998. Springer.
doi: 10.1007/BFb0054314.
[ BibTex | DOI | Web page | PS ]

[DS98]

S. Demri and Ph. Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS'98), volume 1373 of Lecture Notes in Computer Science, pages 61--72, Paris, France, February 1998. Springer.
doi: 10.1007/BFb0028549.
[ BibTex | DOI | Web page | PS ]

[KS97a]

O. Kouchnarenko and Ph. Schnoebelen. A Formal Framework for the Analysis of Recursive-Parallel Programs. In Proceedings of the 4th International Conference on Parallel Computing Technologies (PaCT'97), volume 1277 of Lecture Notes in Computer Science, pages 45--59, Yaroslavl, Russia, September 1997. Springer.
doi: 10.1007/3-540-63371-5_6.
[ BibTex | DOI | Web page | PS | PDF ]

[LS97]

F. Laroussinie and Ph. Schnoebelen. Specification in CTL+Past, Verification in CTL. In Proceedings of the 4th International Workshop on Expressiveness in Concurrency (EXPRESS'97), volume 7 of Electronic Notes in Theoretical Computer Science, pages 161--184, Santa Margherita Ligure, Italy, September 1997. Elsevier Science Publishers.
doi: 10.1016/S1571-0661(05)80472-4.
[ BibTex | DOI | Web page | PS | PDF ]

[KS97b]

O. Kouchnarenko and Ph. Schnoebelen. A Model for Recursive-Parallel Programs. In Proceedings of the 1st International Workshop on Verification of Infinite State Systems (INFINITY'96), volume 5 of Electronic Notes in Theoretical Computer Science, page 30, Pisa, Italy, 1997. Elsevier Science Publishers.
doi: 10.1016/S1571-0661(05)82512-5.
[ BibTex | DOI | Web page | PS | PDF ]

[KS96]

O. Kouchnarenko and Ph. Schnoebelen. Modèles formels pour les programmes récursifs-parallèles. In Actes des 8èmes Rencontres Francophones du Parallélisme (RENPAR'96), pages 85--88, Bordeaux, France, May 1996.
[ BibTex | Web page | PS ]

[LS96]

F. Laroussinie and Ph. Schnoebelen. Translations for Model-Checking Temporal Logic with Past. In Actes des 5èmes Journées sur la Formalisation des Activités Concurrentes (FAC'96), pages 17--19, Toulouse, France, February 1996. Invited talk.
[ BibTex ]

[SL95]

Ph. Schnoebelen and F. Laroussinie. Temporal Logic with Past for the Specification and Verification of Reactive Systems. In Proceedings of the Conference Problèmes Actuels des Sciences Naturelles et Humaines, pages 143--146, Yaroslavl, Russia, November 1995. Yaroslavl University Press. Invited talk.
[ BibTex ]

[LS95]

F. Laroussinie and Ph. Schnoebelen. A Hierarchy of Temporal Logics with Past. Theoretical Computer Science, 148(2):303--324, September 1995.
doi: 10.1016/0304-3975(95)00035-U.
[ BibTex | DOI | Web page | PS ]

[LPS95]

F. Laroussinie, S. Pinchinat, and Ph. Schnoebelen. Translations between Modal Logics of Reactive Systems. Theoretical Computer Science, 140(1):53--71, March 1995.
doi: 10.1016/0304-3975(94)00204-V.
[ BibTex | DOI | Web page | PS ]

[APS94]

C. Autant, W. Pfister, and Ph. Schnoebelen. Place Bisimulations for the Reduction of Labeled Petri Nets with Silent Moves. In Proceedings of the 6th International Conference on Computing and Information (ICCI'94), pages 230--246, Peterborough, Ontario, Canada, May 1994.
[ BibTex | Web page | PS ]

[PLS94]

S. Pinchinat, F. Laroussinie, and Ph. Schnoebelen. Logical Characterizations of Truly Concurrent Bisimulation. Technical Report 114, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, March 1994.
[ BibTex | Web page | PS ]

[LS94]

F. Laroussinie and Ph. Schnoebelen. A Hierarchy of Temporal Logics with Past. In Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science (STACS'94), volume 775 of Lecture Notes in Computer Science, pages 47--58, Caen, France, February 1994. Springer-Verlag.
doi: 10.1007/3-540-57785-8_130.
[ BibTex | DOI ]

[LPS94]

F. Laroussinie, S. Pinchinat, and Ph. Schnoebelen. Translation Results for Modal Logics of Reactive Systems. In Proceedings of the 3rd International Conference on Algebraic Methodology and Software Technology (AMAST'93), Workshops in Computing, pages 299--310, Twente, The Netherlands, 1994. Springer-Verlag.
[ BibTex ]

[AS92]

C. Autant and Ph. Schnoebelen. Place Bisimulations in Petri Nets. In Proceedings of the 13th International Conference on Applications and Theory of Petri Nets (APN'92), volume 616 of Lecture Notes in Computer Science, pages 45--61, Sheffield, UK, June 1992. Springer-Verlag.
doi: 10.1007/3-540-55676-1_3.
[ BibTex | DOI ]

[CS91]

F. Cherief and Ph. Schnoebelen. τ-Bisimulations and Full Abstraction for Refinement of Actions. Information Processing Letters, 40(4):219--222, November 1991.
doi: 10.1016/0020-0190(91)90081-R.
[ BibTex | DOI ]

[Sch91]

Ph. Schnoebelen. Experiments on Processes with Backtracking. In Proceedings of the 2nd International Conference on Concurrency Theory (CONCUR'91), volume 527 of Lecture Notes in Computer Science, pages 480--494, Amsterdam, The Netherlands, August 1991. Springer-Verlag.
doi: 10.1007/3-540-54430-5_108.
[ BibTex | DOI ]

[ABS91]

C. Autant, Z. Belmesk, and Ph. Schnoebelen. Strong Bisimilarity on Nets Revisited. In Proceedings of the 3rd International Conference Parallel Architectures and Languages Europe (PARLE'91), Volume II: Parallel Languages, volume 506 of Lecture Notes in Computer Science, pages 295--312, Eindhoven, The Netherlands, June 1991. Springer-Verlag.
doi: 10.1007/3-540-54152-7_71.
[ BibTex | DOI ]

[CLS91]

H. Comon, D. Lugiez, and Ph. Schnoebelen. A Rewrite-Based Type Discipline for a Subset of Computer Algebra. Journal of Symbolic Computation, 11(4):349--368, April 1991.
[ BibTex ]

[BS90]

Z. Belmesk and Ph. Schnoebelen. Une généralisation des présentations FP2 basée sur la théorie des réseaux. Research Report 832-I, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, November 1990.
[ BibTex ]

[Sch90a]

Ph. Schnoebelen. Congruence Properties of the Process Equivalence Induced by Temporal Logic. Research Report 831-I, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, October 1990.
[ BibTex ]

[ABS90]

C. Autant, Z. Belmesk, and Ph. Schnoebelen. A Net-Theoretic Approach to the Efficient Implementation of the FP2 Parallel Language. In Proceedings of the 11th International Conference on Applications and Theory of Petri Nets (APN'90), pages 451--470, Paris, France, June 1990.
[ BibTex ]

[Sch90b]

Ph. Schnoebelen. Sé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. Pinchinat. On the Weak Adequacy of Branching-Time Temporal Logic. In Proceedings of the 3rd European Symposium on Programming (ESOP'90), volume 432 of Lecture Notes in Computer Science, pages 377--388, Copenhagen, Denmark, May 1990. Springer-Verlag.
doi: 10.1007/3-540-52592-0_75.
[ BibTex | DOI ]

[SJ89]

Ph. Schnoebelen and Ph. Jorrand. Principles of FP2: Term Algebras for Specification of Parallel Machines. In Languages for Parallel Architectures: Design, Semantics, Implementation Models, chapter 5, pages 223--273. John Wiley & Sons, Ltd., December 1989.
[ BibTex ]

[JHI⁺89]

Ph. Jorrand, J.-M. Hufflen, M. B. Ibáñez, T. Karasek, S. Rogé, Ph. Schnoebelen, and A. Véron. Parallel Specification of the Connection Method on an FP2 Machine. Esprit Project 415, Deliverable D17, October 1989.
[ BibTex ]

[Sch88a]

Ph. Schnoebelen. Refined Compilation of Pattern-Matching for Functional Languages. Science of Computer Programming, 11(2):133--159, December 1988.
doi: 10.1016/0167-6423(88)90002-0.
[ BibTex | DOI ]

[Sch88b]

Ph. Schnoebelen. Refined Compilation of Pattern-Matching for Functional Languages. In Proceedings of the 1st International Workshop on Algebraic and Logic Programming (ALP'88), volume 343 of Lecture Notes in Computer Science, pages 233--243, Gaussig, German Democratic Republic, November 1988. Springer-Verlag.
doi: 10.1007/3-540-50667-5_75.
[ BibTex | DOI ]

[SLC88]

Ph. Schnoebelen, D. Lugiez, and H. Comon. A Semantics for Polymorphic Subtypes in Computer Algebra. Research Report 711, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, March 1988.
[ BibTex ]

[SS87]

P. Schäfer and Ph. Schnoebelen. Specification of a Pipelined Event-Driven Simulator Using FP2. In Proceedings of the 1st International Conference Parallel Architectures and Languages Europe (PARLE'87), Volume I: Parallel Architectures, volume 258 of Lecture Notes in Computer Science, pages 311--328, Eindhoven, The Netherlands, June 1987. Springer-Verlag.
doi: 10.1007/3-540-17943-7_136.
[ BibTex | DOI ]

[Sch87]

Ph. Schnoebelen. Rewriting Techniques for the Temporal Analysis of Communicating Processes. In Proceedings of the 1st International Conference Parallel Architectures and Languages Europe (PARLE'87), Volume II: Parallel Languages, volume 259 of Lecture Notes in Computer Science, pages 402--419, Eindhoven, The Netherlands, June 1987. Springer-Verlag.
doi: 10.1007/3-540-17945-3_23.
[ BibTex | DOI ]

[Sch86b]

Ph. Schnoebelen. μ-FP2: A Prototype Interpreter for FP2. Research Report 573, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, January 1986.
[ BibTex ]

[Sch86a]

Ph. Schnoebelen. About the Implementation of FP2. Research Report 574, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, January 1986.
[ BibTex ]

[Sch85a]

Ph. Schnoebelen. The Semantics of Concurrency in FP2. Research Report 558, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, October 1985.
[ BibTex ]

[Sch85b]

Ph. Schnoebelen. Sémantique du parallélisme en FP2. Rapport de DEA, Université de Grenoble, France, June 1985.
[ BibTex ]

[JHM⁺85]

Ph. Jorrand, J.-M. Hufflen, A. Marty, J.- Ch. Marty, and Ph. Schnoebelen. FP2: The Language and its Formal Definition. Research Report 537, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, May 1985.
[ BibTex ]

This file was generated by bibtex2html 1.98.