 |
 |
 |
 |
|
|
||
|---|---|---|
|
tel-00200440v1
HDR
Jean-Baptiste Yunès. Automates Cellulaires; Fonctions Booléennes Autre [cs.OH]. Université Paris-Diderot - Paris VII, 2007 |
||
|
hal-00527852v1
Pré-publication, Document de travail
Eugene Asarin, Aldric Degorre. Two Size Measures for Timed Languages A short version (without appendix) of this paper will appear in proceedings of FSTTCS'2010 (in LI.. 2010 |
||
|
hal-00157955v1
Communication dans un congrès
Eugene Asarin. Does Church-Turing thesis apply outside computer science? Transgressive Computing 2006, A conference in honor of Jean Della Dora, 2006, Granada, Spain. 2006 |
||
|
tel-00161124v1
Thèse
Tayssir Touili. Analyse symbolique de systèmes infinis basée sur les automates: Application à la vérification de systèmes paramétrés et dynamiques Autre [cs.OH]. Université Paris-Diderot - Paris VII, 2003. Français |
||
|
hal-00160790v1
Article dans une revue
Ines Klimann. Some representations for series on idempotent semirings Kybernetika, 2003, 39 (2), pp.177-192 |
||
|
hal-00019977v1
Communication dans un congrès
Jean-Eric Pin. On reversible automata I. Simon. Proceedings of the first LATIN conference, 1992, Saõ-Paulo, Brazil. Springer, pp.401-416, 1992, Lecture Notes in Computer Science 583 |
||
|
inria-00099917v1
Communication dans un congrès
Anne Bouillard, Bruno Gaujal, Jean Mairesse. Extremal throughputs in free-choice nets Springer. 26th International Conference on Application and Theory of Petri Nets 2005, 2005, Miami, Florida, United States. 3536, pp.108-127, 2004, Lecture Notes in Computer Science |
||
|
inria-00099681v1
Communication dans un congrès
Anne Bouillard, Jean Mairesse. Generating series for the trace group Developments in Language Theory 2003 (DLT'03), 2003, Szeged, Hungary. Springer, 2710, pp.159-170, 2003, Lecture Notes in Computer Science |
||
|
hal-00113779v1
Chapitre d'ouvrage
Jean-Eric Pin. Tropical Semirings J. Gunawardena. Idempotency (Bristol, 1994), Cambridge Univ. Press, Cambridge, pp.50-69, 1998, Publ. Newton Inst. 11 |
||
|
hal-00112620v1
Chapitre d'ouvrage
Karsten Henckell, Jean-Eric Pin. Ordered monoids and J-trivial monoids J.-C. Birget, S. Margolis, J. Meakin and M. Sapir. Algorithmic problems in Groups and Semigroups (Lincoln, NE, 1998), Birkhäusern, Boston, MA, USA, pp.121-137, 2000, Trends in Mathematics |
||
|
hal-00113768v1
Communication dans un congrès
Jean-Eric Pin. Positive varieties and infinite words 1998, Springer, Berlin, pp.76-87, 1998, Lecture Notes in Comput. Sci. 1380 |
||
|
hal-00340780v1
Communication dans un congrès
Jean-Eric Pin, Jacques Sakarovitch. Some operations and transductions that preserve rationality 6th GI Conference, 1983, Berlin, Germany. Springer Verlag, 145, pp.277-288, 1983, Lecture Notes in Computer Science |
||
|
hal-00340771v1
Communication dans un congrès
Jean-Eric Pin. Sur un cas particulier de la conjecture de Cerný 5th ICALP, Jul 1978, Berlin, Allemagne. Springer, Berlin, 62, pp.345-352, 1978, Lecture Notes in Computer Science |
||
|
hal-00340803v1
Communication dans un congrès
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin. Duality and equational theory of regular languages ICALP 2008, Jul 2008, Reykjavik, Iceland. 5126, pp.246-257, 2008, Lecture Notes in Computer Science |
||
|
hal-00340773v1
Communication dans un congrès
Jean-Eric Pin. Utilisation de l'algèbre linéaire en théorie des automates AFCET. 1er Colloque AFCET-SMF de Mathématiques Appliquées, Sep 1978, Palaiseau, France. pp.85-92, 1978 |
||
|
hal-00340806v1
Communication dans un congrès
Antonio Cano Gómez, Giovanna Guaiana, Jean-Eric Pin. When does partial commutative closure preserve regularity? ICALP 2008, 2008, Reykjavik, Iceland. Springer Verlag, 5126, pp.209-220, 2008, Lecture Notes in Computer Science |
||
|
hal-00340776v1
Chapitre d'ouvrage
Jean-Eric Pin. Le problème de la synchronisation et la conjecture de Cerný A. De Luca. Non-commutative structures in algebra and geometric combinatorics vol. 109, CNR (Consiglio nazionale delle ricerche, Italy), pp.37-48, 1981, Quaderni de la Ricerca Scientifica |
||
|
hal-00340797v1
Chapitre d'ouvrage
Olivier Carton, Dominique Perrin, Jean-Eric Pin. Automata and semigroups recognizing infinite words J. Flum, E. Grädel and T. Wilke. Logic and Automata, History and perspectives, Amsterdam University Press, pp.585-596, 2007 |
||
|
tel-00011326v1
Thèse
Olivier Serre. Contribution à l'étude des jeux sur des graphes de processus à pile Autre [cs.OH]. Université Paris VIII Vincennes-Saint Denis, 2004. Français |
||
|
hal-00306255v1
Article dans une revue
Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun. Infinite-state high-level MSCs: Model-checking and realizability Journal of Computer and System Sciences, Elsevier, 2006, 72 (4), pp.617--647 |
||
|
inria-00072394v2
Article dans une revue
Bruno Gaujal, Stefan Haar, Jean Mairesse. Blocking a transition in a Free Choice net and what it tells about its throughput Journal of Computer and System Sciences, Elsevier, 2003, 66 (3), pp.515-548. <10.1016/S0022-0000(03)00039-4> |
||
|
tel-00255024v1
Thèse
Mathias Samuelides. Automates d'arbres à jetons Autre [cs.OH]. Université Paris-Diderot - Paris VII, 2007. Français |
||
|
hal-00308119v1
Communication dans un congrès
Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka. Election, Naming and Cellular Edge Local Computations International Conference on Graph Transformation (ICGT 2004) (EATCS best paper award), Sep 2004, Italy. Springer, 3256, pp.242--256, 2004, Lecture notes in computer science |
||
|
hal-00110134v1
Communication dans un congrès
Mihaela Sighireanu, Tayssir Touili. Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism Ahmed Bouajjani. Infinity, 2006, Bonn, Germany. 2006 |
||
|
hal-00306317v1
Communication dans un congrès
Paul Gastin, Benjamin Lerman, Marc Zeitoun. Distributed games and distributed control for asynchronous systems Proc. of the 6th Symposium Latin American Theoretical INformatics, LATIN04, 2004, Argentina. M. Farach-Colton, 2976, pp.455-465, 2004 |
||
|
hal-00306320v1
Communication dans un congrès
Loïc Hélouët, Claude Jard, Marc Zeitoun. Covert channels detection in protocols using scenarios Security Protocols Verification, SPV'03, 2003, France. M. Rusinowitch, pp.2125, 2003 |
||
|
hal-00306314v1
Communication dans un congrès
Paul Gastin, Pierre Moro, Marc Zeitoun. Minimization of counterexamples in SPIN S. Graf and L. Mounier. Model Checking Software: Proc. of the 11th International SPIN Workshop, SPIN04, 2004, Barcelone, Spain. 2989, pp.92-108, 2004, Lecture Notes in Computer Science. <10.1007/b96721> |
||
|
hal-00306315v1
Communication dans un congrès
Paul Gastin, Benjamin Lerman, Marc Zeitoun. Distributed games with causal memory are decidable for series-parallel systems K. Lodaya and M. Mahajan. Proc. of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS04, 2004, Chennai, India. 3328, pp.275-286, 2004, Lecture Notes in Computer Science. <10.1007/b104325> |
||
|
hal-00306319v1
Communication dans un congrès
Loïc Hélouët, Marc Zeitoun, Aldric Degorre. Scenarios and covert channels, another game... GDV 04, 2005, Boston, United States. 119, pp.93--116, 2005 |
||
|
tel-00011377v1
Thèse
Jean-Loup Guillaume. Analyse statistique et modélisation des grands réseaux d'interactions. Réseaux et télécommunications [cs.NI]. Université Paris-Diderot - Paris VII, 2004. Français |
||
|
|
||