[1] Michele V., Abrusci and Paul, Ruet, Non-commutative logic I: the multiplicative fragment, Annals of Pure and Applied Logic, vol. 101 (1999), no. 1, pp. 29-64.Google Scholar

[2] Y., Bar-Hillel, C., Gaifman, and E., Shamir, On categorial and phrase-structure grammars, Bulletin of the Research Council of Israel, vol. F (1960), no. 9, pp. 1-16.Google Scholar

[3] Denis, Bechet, Philippe de, Groote, and Christian, Retoré, A complete axiomatisation of the inclusion of series-parallel partial orders, Rewriting Techniques and Applications, RTA'97 (H., Comon, editor), LNCS, vol. 1232, Springer Verlag, 1997, pp. 230-240.

[4] Eike, Best and RaymondDevillers, Sequential and concurrent behaviour inPetri net theory, Theoretical Computer Science, vol. 55 (1987), pp. 87-136.Google Scholar

[5] Wojciech, Buszkowski,Mathematical linguistics and proof theory, Handbook of logic and language (J., van Benthem and A., ter Meulen, editors), North-Holland Elsevier, Amsterdam, 1997, pp. 683-736.

[6] Phillipe, Darondeau, Deriving unbounded Petri nets from formal languages, Rapport de Recherche 3365, INRIA, fevrier 1998, http://www.inria.fr/.

[7] Philippe de, Groote, Partially commutative linear logic: sequent calculus and phase semantics, Third Roma workshop: Proofs and linguistic categories — applications of logic to the analysis and implementation of natural language (Michele, Abrusci and Claudia, Casadio, editors), Bologna: CLUEB, 1996, pp. 199-208.

[8] Akim, Demaille, Logiques linéaires hybrides et leurs modalités, Thése de doctorat, spécialité informatique, Ecole Nationale Supérieure des Télécommunications de Paris, juin 1999.

[9] Uffe, Engeberg and Glynn, Winskel, Completeness results for linear logic on Petri nets, Annals of Pure and Applied Logic, vol. 86 (1997), no. 2, pp. 101-135.Google Scholar

[10] Vijay, Gehlot, A proof-theoretic approach to semantics of concurrency, Ph.D. thesis, University of Pennsylvania, 1992.

[11] Jean-Yves, Girard, Linear logic, Theoretical Computer Science, vol. 50 (1987), no. 1, pp. 1-102.Google Scholar

[12] François, Girault, Formalisation en logique linéaire du fonctionnement des réseaux de Petri, Thése de doctorat, spécialité informatique industrielle, Université Paul Sabatier, Toulouse, décembre 1997.

[13] Ursula, Goltz and Wolfgang, Reisig, The non sequential behaviour of Petri nets, Information and Computation, vol. 57 (1983), pp. 125-147.Google Scholar

[14] Luis, Allan Künzle, Raisonnement temporel basé sur les réseaux de Petri pour des syst`emes manipulant des ressources, Thése de doctorat, spécialité informatique industrielle, Universit é Paul Sabatier, Toulouse, septembre 1997.

[15] Joachim, Lambek, The mathematics of sentence structure, American Mathematical Monthly, vol. 65 (1958), pp. 154-169.Google Scholar

[16] Alain, Lecomte and Christian, Retoré, Extending Lambek grammars: a logical account of minimalist grammars, Proceedings of the 39th annual meeting of the Association for Computational Linguistics, ACL 2001 (Toulouse), vol. 354-361, ACL, July 2001.

[17] JoséMeseguer, and UgoMontanari, Petri nets are monoids, Information and Computation, vol. 88 (1990), pp. 105-155.Google Scholar

[18] Rolf, H. Möhring, Computationally tractable classes of ordered sets, Algorithms and order (I., Rival, editor), NATO ASI series C, vol. 255, Kluwer, 1989, pp. 105-194.

[19] Madhavan, Mukund, Petri nets and step transition systems, International Journal of Foundations of Computer Science, vol. 3 (1992), no. 4, pp. 443-478.Google Scholar

[20] Mati, Pentus, Lambek grammars are context-free, Logic In Computer Science, LICS'93, IEEE Computer Society Press, 1993.

[21] Brigitte, Pradin-Chézalviel, Luis Allan, Künzle, François, Girault, and Robert, Valette, Calculating duration of concurrent scenarios in time Petri nets, APII - Journal Européen des Syst`emes Automatisés, vol. 33 (1999), no. 8-9, pp. 943-958.Google Scholar

[22] Christian, Retoré, Réseaux et séquents ordonnés, Thése de Doctorat, spécialité Mathématiques, Université Paris 7, février 1993.

[23] Christian, Retoré, Petri-nets step-transitions and proofs in partially commutative linear logic, Technical report, 4288, INRIA, 2001, http://www.inria.fr/.Google Scholar

[24] Christian, Retoré, Logique linéaire et syntaxe des langues, Habilitation `a diriger des recherches, Université de Nantes, 2002, 196 pp., http://perso.wanadoo.fr/christian.retore/.Google Scholar

[25] Paul, Ruet, Logique non-commutative et programmation concurrente, Thése de doctorat, spécialité logique et fondements de l'informatique, Université Paris 7, 1997.

[26] Edward, Stabler, Derivational minimalism, Logical Aspects ofComputational Linquistics, LACL 96 (Christian, Retoré, editor), LNCS/LNAI, vol. 1328, Springer-Verlag, 1997, pp. 68-95.

[27] Anne Sjerp, Troelstra, Lectures in linear logic, CSLI LectureNotes, vol. 29, CSLI, 1992, (distributed by Cambridge University Press).

[28] J., Valdes, R. E., Tarjan, and E. L., Lawler, The recognition of Series-Parallel digraphs, SIAMJournal on Computing, vol. 11 (1982), no. 2, pp. 298-313.