From Petri nets to linear logic

1991 ◽  
Vol 1 (1) ◽  
pp. 69-101 ◽  
Author(s):  
Narciso Martí-Oliet ◽  
José Meseguer

Linear logic has recently been introduced by Girard as a logic of actions that seems well suited for concurrent computation. In this paper, we establish a systematic correspondence between Petri nets, linear logic theories, and linear categories. Such a correspondence sheds new light on the relationships between linear logic and concurrency, and on how both areas are related to category theory. Categories are here viewed as concurrent systems the objects of which are states, and the morphisms of which are transitions. This is an instance of the Lambek-Lawvere correspondence between logic and category theory that cannot be expressed within the more restricted framework of the Curry-Howard correspondence.

1991 ◽  
Vol 02 (04) ◽  
pp. 297-399 ◽  
Author(s):  
NARCISO MARTÍ -OLIET ◽  
JOSÉ MESEGUER

Linear logic has been introduced by Girard as a logic of actions that seems well suited for concurrent computation. This paper surveys recent work on the applications of linear logic to concurrency, with special emphasis on Petri nets and on the use of categorical models. In particular, we present a synthesis of our previous work on the systematic correspondence between Petri nets, linear logic theories, and linear categories, and explain its relationships to work by many other authors. Throughout, we discuss the computational interpretation of the linear logic connectives and illustrate the ideas with examples. Categories play an important role in this survey. On the one hand, from a computational perspective, they are interpreted as concurrent systems whose objects are states, and whose morphisms are transitions; on the other hand, when a model-theoretic perspective is adopted, they provide a very flexible conceptual framework within which the relationships among quite different models already proposed for linear logic can be better understood; this framework also suggests the study of new models and an axiomatic treatment of classes of models. Our categorical semantics for linear logic is based on dualizing objects and permits a very simple presentation of ideas requiring a more complicated treatment in the language of *-autonomous categories.


Petri Nets ◽  
2010 ◽  
pp. 481-500 ◽  
Author(s):  
Brigitte Pradin ◽  
Robert Valette ◽  
Nicolas Rivire
Keyword(s):  

Author(s):  
Uffe Engberg ◽  
Glynn Winskel
Keyword(s):  

2002 ◽  
Vol 12 (4) ◽  
pp. 423-448
Author(s):  
NICO VERLINDEN ◽  
DIRK JANSSENS

Graph rewriting has been used extensively to model the behaviour of concurrent systems and to provide a formal semantics for them. In this paper, we investigate processes for Local Action Systems (LAS); LAS generalize several types of graph rewriting based on node replacement and embedding. An important difference between processes for Local Action Systems and the process notions that have been introduced for other systems, for example, Petri nets, is the presence of a component describing the embedding mechanism. The aim of the paper is to develop a methodology for dealing with this embedding mechanism: we introduce a suitable representation (a dynamic structure) for it, and then investigate the algebraic properties of this representation. This leads to a simple characterization of the configurations of a process and to a number of equational laws for dynamic structures. We illustrate the use of these laws by providing an equational proof of one of the basic results for LAS processes, namely that the construction yielding the result graph of a process behaves well with respect to the sequential composition of processes.


Sign in / Sign up

Export Citation Format

Share Document