A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Completeness results for linear logic on Petri nets
1997
Annals of Pure and Applied Logic
Completeness is shown for several versions of Girard's linear logic with respect to Petri nets as the class of models. One logic considered is the @-free fragment of intuitionistic linear logic without the exponential !. For this fragment Petri nets form a sound and complete model. The strongest logic considered is intuitionistic linear logic, with @, *, &, @ and the exponential ! ("of course"), and forms of quantification. This logic is shown sound and complete with respect to atomic nets
doi:10.1016/s0168-0072(96)00024-3
fatcat:ksaovrfevjbfve5griq4bk5uxy