Farwer, B., A linear logic view of object Petri nets, Fundamenta Informaticae 37 (1999), pp. 225--246. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Rewriting Logic as a Unifying Framework for Petri Nets - Stehr, Meseguer, Csaba (2001) (Correct)
.... y address how similar representations could be de ned for other Petri net classes, such as colored Petri nets based on (higher order) programming languages [39] nets with macroplaces [2, 3] nets with FIFO places [30, 40, 29, 27] object oriented variants of Petri nets [68, 44] and object nets [73, 74, 28, 75] where nets are viewed as token objects. We conclude this introduction with a brief overview of the paper: After introducing rewriting logic together with the underlying membership equational logic in the following section, we introduce in Section 3 a category of place transition nets together ....
....logic has the advantage of being more general, in the sense that it goes beyond Petri net like models and hence provides a bridge to formalisms that are quite di erent from ordinary Petri nets. Yet another interesting generalization of Petri nets are di erent variants of object Petri nets [73, 74, 28, 75], where tokens can themselves be nets with their own dynamic behaviour. A quite di erent line of research is the integration of object oriented techniques with Petri nets. As a result there are a number of variants of object oriented Petri nets [68, 44] where the tokens are objects according to ....
B. Farwer. A linear logic view of object Petri nets. Fundamenta Informaticae, 37(3):225-246, 1999.
Towards a Linear Logic Based Calculus for Structural.. - Farwer Self-citation (Farwer) (Correct)
.... of Linear Logic where the reachability of a certain marking in the net corresponds to the derivability of the associated sequent in a fragment of the Linear Logic sequent calculus ( Bro89] MOM89] These results extend also to a class of coloured Petri nets as illustrated in [Far98c] and [Far99]. 2.3 Combining Petri Nets and Linear Logic In this paper we follow the definitions given in [Far98a] using Linear Logic formulae both as inscriptions of Petri Nets i.e. as arc inscriptions and guards and also as tokens that move through a system represented by a Petri net. The evolution of ....
..... #L # serves as such a t binding. Each variable is assigned a unique formula even if it has multiple appearances in the multiset union of the arc inscriptions. Therefore it is su#cient for # to be defined on the set of relevant variables. We briefly repeat the definition of enablement given in [Far99]. Definition 2. Let LLPN = #N , #, #, W,m 0 # be a Linear Logic Petri net and t # TN . We say t is enabled with binding # i# there exists a t binding satisfying g(t) such that there is one occurrence of #(X) in the place p # . t for each occurrence of X in W (p, t) i.e. #p # . t . #X ....
[Article contains additional citation context not shown here]
B. Farwer. A Linear Logic View of Object Petri Nets. Fundamenta Informaticae, 37(3):225--246, 1999.
Relating State-Based and Process-Based Concurrency through.. - Cervesato, Scedrov (2006) (Correct)
No context found.
Farwer, B., A linear logic view of object Petri nets, Fundamenta Informaticae 37 (1999), pp. 225--246.
The Logical Meeting Point of Multiset Rewriting and Process.. - Cervesato (2004) (3 citations) (Correct)
No context found.
B. Farwer. A linear logic view of object Petri nets. Fundamenta Informaticae, 37(3):225-- 246, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC