The completeness of linear logic for Petri net models

DOI10.1093/jigpal/9.4.549zbMath0980.03024OpenAlexW2013323317MaRDI QIDQ2743640

Keiko Ishihara, Kunihiko Hiraishi

Publication date: 12 March 2002

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/9.4.549

zbMATH Keywords

completenessPetri netsclosure operationlinear logicexponentialnondistributive quantales

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Quantales (06F07)

Related Items (5)

Linear and affine logics with temporal, spatial and epistemic operators ⋮ Debits and Credits in Petri Nets and Linear Logic ⋮ Phase semantics and Petri net interpretation for resource-sensitive strong negation ⋮ On linear logic planning and concurrency ⋮ Gentzen-type calculi for involutive quantales

This page was built for publication: The completeness of linear logic for Petri net models