Petri Nets Step Transitions and Proofs in Partially Commutative Linear Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

Petri Nets Step Transitions and Proofs in Partially Commutative Linear Logic

Abstract

We encode the execution of Petri nets in Partially Commutative Linear Logic, an intuitionistic logic introduced by Ph. de Groote which contains both commutative and non commutative connectives. We are thus able to faithfully represent the concurrent firing of Petri nets as long as it can be depicted by a series-parallel order. This coding is inspired from the description of context-free languages by Lambek grammars. This report is an extended version (with complete proofs) of an article to appear in the proceedings of the Logic Colloquium 1999 (Utrecht).

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4288.pdf (430.47 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00072299 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00072299 , version 1

Cite

Christian Retoré. Petri Nets Step Transitions and Proofs in Partially Commutative Linear Logic. [Research Report] RR-4288, INRIA. 2001. ⟨inria-00072299⟩
123 View
140 Download

Share

Gmail Facebook Twitter LinkedIn More