Completeness Results for Linear Logic on Petri Nets (1993)
Edit Page
Report
Scan day: 05 March 2014 UTC
13
Virus safety - good
Description: (CiteSeer) Article by Engberg and Winskel showing that Petri nets provide a class of model for linear logic that is complete.
CiteSeerX — Completeness Results for Linear Logic on Petri Nets Completeness Results for Linear Logic on Petri Nets (1993) Other Repositories/Bibliography by Uffe Engberg , Glynn Winskel , Ny Munkegade
Size: 203 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | CiteSeerX — Completeness Results for Linear Logic on Petri Nets |
| Keywords: | CiteSeerX, Uffe Engberg, Glynn Winskel, Ny Munkegade |
| Description: | CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Completeness is shown for several versions of Girard's linear logic with respect to Petri nets as the class of models. The strongest logic considered is intuitionistic linear logic, with\Omega , (, & , \Phi and the exponential ! ("of course"), and forms of quantification. This logic is shown sound and complete with respect to atomic nets (these include nets in which every transition leads to a nonempty multiset of places). The logic is remarkably expressive, enabling descriptions of the kinds of properties one might wish to show of nets; in particular, negative properties, asserting the impossibility of an assertion, can also be expressed. 1 Introduction In [EW90] it was shown how Petri nets can naturally be made into models of Girard's linear logic in such a way that many properties one might wish to state of nets become expressible in linear logic. We refer the reader to the [EW90] for more background and a discussion of other work. That paper left open the important question of com... |
| IP-address: | 130.203.136.95 |
WHOIS Info
| NS | Name Servers: NS1.PSU.EDU 128.118.25.6 NS2.PSU.EDU 128.118.70.6 |
| WHOIS | |
| Date | activated: 14-Jul-1986 last updated: 22-May-2013 expires: 31-Jul-2014 |