| [1] | Nicolas Baudru and Rémi Morin. The synthesis problem of netcharts. In Susanna Donatelli and P. S. Thiagarajan, editors, ICATPN, volume 4024 of Lecture Notes in Computer Science, pages 84-104. Springer, June 2006. [ bib | .pdf | Abstract ] |
| [2] | Nicolas Baudru and Rémi Morin. Unfolding synthesis of asynchronous automata. In Dima Grigoriev, John Harrison, and Edward A. Hirsch, editors, CSR, volume 3967 of Lecture Notes in Computer Science, pages 46-57. Springer, June 2006. [ bib | .pdf | Abstract ] |
| [3] | Peter Niebert and Hongyang Qu. Adding invariants to event zone automata. In Eugene Asarin and Patricia Bouyer, editors, FORMATS, volume 4202 of Lecture Notes in Computer Science, pages 290-305. Springer, September 2006. [ bib | .pdf | Abstract ] |
| [4] | Marcos E. Kurbán, Peter Niebert, Hongyang Qu, and Walter Vogler. Stronger reduction criteria for local first search. In Kamel Barkaoui, Ana Cavalcanti, and Antonio Cerone, editors, ICTAC, volume 4281 of Lecture Notes in Computer Science, pages 108-122. Springer, November 2006. [ bib | .pdf | Abstract ] |
| [5] | Edith Elkind, Blaise Genest, Doron Peled, and Hongyang Qu. Grey-box checking. In Elie Najm, Jean-François Pradat-Peyre, and Véronique Donzeau-Gouge, editors, FORTE, volume 4229 of Lecture Notes in Computer Science, pages 420-435. Springer, September 2006. [ bib | .pdf | Abstract ] |
| [6] | Peter Niebert and Hongyang Qu. The implementation of mazurkiewicz traces in poem. In Susanne Graf and Wenhui Zhang, editors, ATVA, volume 4218 of Lecture Notes in Computer Science, pages 508-522. Springer, October 2006. [ bib | .pdf | Abstract ] |
| [7] | Peter Niebert and Doron Peled. Efficient model checking for ltl with partial order snapshots. In Holger Hermanns and Jens Palsberg, editors, TACAS, volume 3920 of Lecture Notes in Computer Science, pages 272-286. Springer, April 2006. [ bib | Abstract ] |
| [8] | Roberto Maieli and Paul Ruet. Interactive correctness criterion for multiplicative-additive proof-nets. June 2006. LICS 2006 short paper. [ bib | Abstract ] |
| [9] | Nicolas Baudru and Rémi Morin. Synthesis of safe message-passing systems. In Vikraman Arvind and Sanjiva Prasad, editors, FSTTCS, volume 4855 of Lecture Notes in Computer Science, pages 277-289. Springer, 2007. [ bib ] |
| [10] | Luigi Santocanale. Derived semidistributive lattices. Accepted for presention at the conference OAL 2007, Nashville, USA, june 12 2007, January 2007. [ bib | .pdf ] |
| [11] | Luigi Santocanale. Derived semidistributive lattices. Accepted for publication in the journal Algebra Universalis, July 2007. [ bib | Abstract ] |
| [12] | Luigi Santocanale. On the join depenency relation in multinomial lattices. Order, 24(3):155-179, August 2007. @Springer. [ bib | Abstract ] |
| [13] | Luigi Santocanale. A nice labelling for tree-like event structures of degree 3. In L. Caires and V.T. Vasconcelos, editors, CONCUR 2007, volume 4703 of Lecture Notes in Computer Science, pages 151-165, Berlin Heidelberg, September 2007. Springer-Verlag. @Springer-Verlag. [ bib | Abstract ] |
| [14] | Walid Belkhir and Luigi Santocanale. The variable hierarchy for the games μ-calculus. Accepted for publication in the journal Annals of Pure and Applied Logic, October 2007. [ bib | Abstract ] |
| [15] | Yde Venema and Luigi Santocanale. Completeness for flat modal fixpoint logics. In Nachum Dershowitz and Andrei Voronkov, editors, LPAR 2007, volume 4790 of Lecture Notes in Artificial Intelligence, pages 499-513. Springer-Verlag, October 2007. @Springer-Verlag. [ bib | .pdf | Abstract ] |
| [16] | Walid Belkhir and Luigi Santocanale. Undirected graphs of entanglement 2. In V. Arvind and S. Prasad, editors, FSTTCS 2007, volume 4855 of Lecture Notes in Computer Science, pages 508-519. Springer-Verlag, December 2007. @Springer-Verlag. [ bib | Abstract ] |
| [17] | Jérémie Chalopin, Emmanuel Godard, and Yves Métivier. Local terminations and distributed computability in anonymous networks. In Gadi Taubenfeld, editor, DISC, volume 5218 of Lecture Notes in Computer Science, pages 47-62. Springer, 2008. [ bib ] |
| [18] | Rémi Morin. Mso logic for unambiguous shared-memory systems. In Masami Ito and Masafumi Toyama, editors, Developments in Language Theory, volume 5257 of Lecture Notes in Computer Science, pages 516-528. Springer, 2008. [ bib ] |
| [19] | Rémi Morin. Semantics of deterministic shared-memory systems. In Franck van Breugel and Marsha Chechik, editors, CONCUR, volume 5201 of Lecture Notes in Computer Science, pages 36-51. Springer, 2008. [ bib ] |
| [20] | Luigi Santocanale. Combinatorics from concurrency: the nice labelling problem for event structures. In Youssef Boudabbous and Nejib Zaguia, editors, ROGICS'08, pages 411-419, May 2008. Proceedings of the International Conference on Relations, Orders and Graphs : Interaction with Computer Science. 12-17 May, 2008, Mahdia, Tunisia. [ bib | .pdf | Abstract ] |
| [21] | Pierre Ille and Paul Ruet. Cyclic extensions of order varieties. Electr. Notes Theor. Comput. Sci., 212:119-132, 2008. [ bib ] |
| [22] | Luigi Santocanale. A nice labelling for tree-like event structures of degree 3. Accepted for publication in a special issue of the journal Information and Computation dedicated to conference CONCUR 2007, May 2008. [ bib ] |
| [23] | Rémi Morin. Expressive power of non-deterministic shared-memory systems. submitted, September 2008. [ bib ] |
| [24] | Walid Belkhir and Luigi Santocanale. The variable hierarchy for the lattice μ-calculus. In Iliano Cervesato, Helmut Veith, and Andrei Voronkov, editors, LPAR 2008, volume 5330 of Lecture Notes in Computer Science, pages 605-620. Springer, November 2008. Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, Doha, Qatar, November 22-27, 2008. [ bib | .pdf | Abstract ] |
| [25] | Walid Belkhir. Algebra and Combinatorics of Parity Games. PhD thesis, Université de Provence, December 2008. [ bib ] |
| [26] | Luigi Santocanale. Structures algébriques et d'ordre en logique et concurrence, December 2008. Habiltation à Diriger les Recherches, Université de Provence. [ bib | Abstract ] |
| [27] | Luigi Santocanale. A duality for finite lattices. To be presented at the conference TACL 2009, Amsterdam, Holland, july 7-11 2009, January 2009. [ bib | .pdf ] |
| [28] | Luigi Santocanale. Topological properties of event structures. Electr. Notes Theor. Comput. Sci., 230:149-160, 2009. GETCO 2006, Geometrical and Topological Methods in Concurrency, Bonn, August 26 2006. [ bib | .pdf | Abstract ] |
| [29] | Robin Cockett and Luigi Santocanale. On the word problem for ΣΠ-categories, and the properties of two-way communication. Submitted, April 2009. [ bib | Abstract ] |
This file was generated by bibtex2html 1.93.