Skip to Main content Skip to Navigation
Reports

Petri Nets Step Transitions and Proofs in Partially Commutative Linear Logic

Christian Retoré 1
1 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
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).
Document type :
Reports
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/inria-00072299
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 8:20:28 PM
Last modification on : Thursday, January 7, 2021 - 4:29:05 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:02:49 PM

Identifiers

  • HAL Id : inria-00072299, version 1

Citation

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

Share

Metrics

Record views

236

Files downloads

239