W. Reisig. Petri Nets. Springer-Verlag, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Solving Recursive Net Equations - Eike Best And (Correct)
....a series of examples and then summarises the most important results. Keywords: Denotational semantics, Petri nets, Recursion. 1 Introduction Process algebras [1, 10, 11, 13, 18] are widely used as models for the specification of concurrent programs, and so are Petri nets and their extensions [4, 12, 16, 21]. In a process algebra one may study the algebraic properties of connectives related to operators known from programming languages. In particular, a general operator expressing (guarded or unguarded) recursion is part of many process algebras. Its transition system semantics is wellunderstood ....
W.Reisig: Petri Nets. An Introduction. Science Vol. 3, Springer-Verlag (1985).
Petri Nets, Process Algebras and Concurrent Programming Languages - Best (Correct)
....for making Petri net specific methods readily available perhaps in addition to other methods in order to solve this problem. We may contrast expressing a distributed algorithm first in a programming language and then, by a standard translation, as a net, with an approach (exemplified by [41]) of massaging an algorithm until it can be expressed as succinctly as possible by a net, independently of how it was expressed in the first place. Both approaches allow net theoretic means to be applied in proofs of correctness, and they both have their advantages and disadvantages. For ....
....program may enter the proof by the Variable initialisations are not in the syntax but can be accommodated easily. 77 p 2 p 3 in 1 = 1 hold = 2 q 2 q 3 u 3 u 2 v 3 Figure 43: Translation of Peterson s algorithm into a net 78 trap method which was first described in [2] see also [3, 7, 12, 41]) Two relevant traps are fin 1 =0; p 2 ; hold=1;q 3 g and fin 2 =0;q 2 ; hold=2; p 3 g. Both carry at least one token initially, and by the second property cited above, none of them can be emptied of tokens. Suppose now that some marking M is reachable from the initial marking M 0 such that a ....
W. Reisig: Modelling and Verification of Distributed Algorithms. Proc. CONCUR '96, U. Montanari, V. Sassone (eds), Springer-Verlag, LNCS Vol. 1119, 579--595 (1996).
Stochastic Specification and Verification - Bryans, Derrick (1999) (2 citations) (Correct)
....to assume that the packet deliveries arrive at fixed predetermined times, instead we need to model the system where they might might arrive at times determined by an exponential distribution. There are now a number of techniques which can be used to describe such systems, e.g. Petri nets [13], generalised semi Markov processes [8] and stochastic process algebras etc. In this paper we will consider stochastic process algebras, for which a number of formalisms, techniques and tools are available, e.g. PEPA [10] TIPP [9] EMPA [3] PA GS [11] and SPADES [7] Stochastic process algebras ....
W. Reisig. Petri Nets, An Introduction. Springer-Verlag, 1982.
Inheritance Conditions for Object Life Cycle Diagrams - Saake, Hartel, Jungclaus, .. (1994) (7 citations) (Correct)
....also arises with multiple inheritance. Theoretically, it is of interest to extend the framework to more advanced interpretation structures for object behaviour. The trace semantics is very natural for state transition diagrams, but too restricted for some kinds of concurrency. Petri nets [Rei85] represent another popular formalism for the description of system dynamics. OSS93] introduces a type of high level Petri nets, Nested Relation Transition nets to model procedures in complex object database applications. Nem92] uses Predicate Transition Petri nets to model dynamic aspects of ....
W. Reisig. Petri Nets. Springer-Verlag, Berlin, 1985.
Research Directions in Rewriting Logic - Meseguer (1998) (10 citations) (Correct)
....as the different variants of modal and temporal logic. As further discussed in Section 7.2, these latter logics support a nonexecutable as far as the system described is concerned level of specification above that of rewriting logic. 2. 2 A Computational Logical Example: Petri Nets Petri nets [144] provide a simple, yet rich enough, example of systems exhibiting concurrent change. Therefore, the problem of representing in logical terms the concurrent change of a Petri net system provides an interesting first illustration of how rewriting logic formalizes such change. In addition, since the ....
W. Reisig. Petri Nets. Springer-Verlag, 1985.
Temporal Linear Logic and Its Applications - Hirai (2000) (Correct)
....a resource conscious logic. The expressive power is so rich that one can construct a counter machine within the propositional fragment of linear logic. Some computational models of concurrency are applications of LL [26, 2, 20] In particular, the relation between linear logic and Petri nets [11, 36] has been well studied [16, 35, 21, 4, 23] According to [25] the algebraic point of view of Petri nets seems to be related to the algebraic semantics for linear logic [28, 34] LL has a modal storage operator which means an infinite resource. Using this operator, one can distinguish the ....
W.Resig. Petri Nets. Springer-Verlag, 1982.
Diagnosis of Distributed Discrete Event Systems, a Net.. - Fabre, al. (2001) (Correct)
.... Irisa Distributed diagnosis 11 3 Some background on Petri Nets and their unfoldings We shall use some basic notions related to Petri Nets and their unfoldings, we shamelessly borrow significant parts of this presentation from [15] 16] For the basic definitions on Petri net, we refer the reader to [19][3] Unfoldings are a way to encode the reachable markings of a Petri net by means of a special acyclic Petri net called an occurrence net. A key point is that it is enough to regard this occurrence net as a directed graph in order to compute the reachable markings of the original Petri net. We ....
W. Reisig. Petri nets. Springer Verlag, 1985.
Markov Nets: Probabilistic Models for distributed and.. - Benveniste, Fabre, Haar (2001) (1 citation) (Correct)
....of type (3) depicts a generic synchronizing transition of A 0 and A 00 . But transition of type (3) can be regarded as a transition of a Petri net, with its pre and post set of places. Extending this discussion to several concurrent automata, we naturally arrive at considering Petri nets [4][14] instead of automata and their products. For our purpose, the important facts about nets are the following : ffl States are local. Referring to our example above, the final picture involves only states x 0 and x 00 of the components, but not states of the product automaton A 0 Theta A 00 ....
W. Reisig. Petri nets. Springer Verlag, 1985.
Diagnosis of Asynchronous Discrete Event Systems, a Net.. - Beneviste, Fabre, al. (2001) (Correct)
....t. The resulting transition fires downward. When firing, it emits an alarm ff. See also figure 10. 3 Some background on Petri Nets and their unfoldings We shall use some basic notions related to Petri Nets and their unfoldings. For the basic definitions on Petri net, we refer the reader to [23][9] 12] Unfoldings are a way to encode the reachable markings of a Petri net by means of a special acyclic Petri net called an occurrence net. A key point is that it is enough to regard this occurrence net as a directed graph in order to compute the reachable markings of the original Petri net. ....
W. Reisig. Petri nets. Springer Verlag, 1985.
Implementing LTL Model Checking with Net Unfoldings - Esparza, Heljanko (2001) (3 citations) (Correct)
....of visible transitions, and executions of type II, which only contain nitely many. We will deal with these two types separately. ## is constructed in several steps: 1) Put # and (the net representation of) A# side by side. 2) For each observable place p add a complementary place (see [17]) p to #. p is marked iff p is not, and so checking that proposition p does not hold is equivalent to checking that the place p has a token. A set x # # can now be seen as a conjunction of literals, where p # x is used to denote p # (# x) 3) Add new arcs to each transition (q, x, q ....
W. Reisig. Petri Nets, An Introduction. Springer-Verlag, 1985.
Implementing LTL Model Checking with Net Unfoldings - Esparza, Heljanko (2001) (3 citations) (Correct)
....of visible transitions, and executions of type II, which only contain finitely many. We will deal with these two types separately. # # is constructed in several steps: 1) Put # and (the net representation of) A # side by side. 2) For each observable place p add a complementary place (see [17]) p to #. p is marked iff p is not, and so checking that proposition p does not hold is equivalent to checking that the place p has a token. A set x # # can now be seen as a conjunction of literals, where p # x is used to denote p # (# x) 3) Add new arcs to each transition (q, x, q ....
W. Reisig. Petri Nets, An Introduction. Springer-Verlag, 1985.
Hidden Markov Models for Distributed and Concurrent Systems - Benveniste, Fabre, Haar (2000) (Correct)
....(3) depicts a generic synchronizing transition of A 0 and A 00 . But transition of type (3) can be regarded as a transition of a Petri net, with its pre and post set of places. Extending this discussion to the product of several automata, we naturally arrive at considering Petri nets [6][22] (or simply nets for short in the sequel) instead of automata and their products 2 . For our purpose, the important facts about nets are the following : ffl States are local. Referring to our example above, the final picture involves only states x 0 and x 00 of the components, but not ....
W. Reisig. Petri nets. Springer Verlag, 1985.
Analyzing Web Service Based Business Processes - Martens (2005) (Correct)
No context found.
W. Reisig. Petri Nets. Springer-Verlag, 1985.
Simulation and Equivalence between BPEL Process Models - Martens (2005) (Correct)
No context found.
W. Reisig. Petri Nets. Springer-Verlag, 1985.
Using a Notion of Safety in Petri Nets To Analyse Real-Time.. - Ling, Schmidt (1997) (Correct)
No context found.
W. Reisig. Petri Nets, An Introduction. Springer-Verlag, 1985.
Concurrent Construction of Proof-Nets - Andreoli, Mazare (2003) (Correct)
No context found.
W. Reisig. Petri Nets. Springer Verlag, 1985. 12
Implementing LTL Model Checking with Net Unfoldings - Esparza, Heljanko (2001) (3 citations) (Correct)
No context found.
W. Reisig. Petri Nets, An Introduction. Springer-Verlag, 1985.
The Concurrency Column - Aceto (Correct)
No context found.
W. Reisig. Petri Nets. Springer-Verlag, 1985.
Hybrid Control Systems Using Timed Petri Nets: Supervisory .. - Koutsoukos, Antsaklis (1999) (Correct)
No context found.
W. Reisig. Petri Nets. Springer-Verlag, 1985.
Quality of Communication-Based Systems" Proc. of an Int. Workshop, - Http Tfs Cs (1997) (Correct)
No context found.
W. Reisig. Petri nets. Springer Verlag, 1985.
Implementing LTL Model Checking with Net Unfoldings - Esparza, Heljanko (2002) (3 citations) (Correct)
No context found.
W. Reisig. Petri Nets, An Introduction. Springer-Verlag, 1985. J. Esparza and K. Heljanko
Multiagent Systems with Workflows - Vidal, Buhler, Stahl (2004) (3 citations) (Correct)
No context found.
W. Reisig, Petri Nets, Springer-Verlag, 1985.
The Home Marking Problem and Some Related Concepts - Roxana Melinte Olivia (Correct)
No context found.
W. Reisig. Petri Nets. An Introduction, Springer-Verlag, 1985.
Temporal Linear Logic and Its Applications - Hirai (2000) (Correct)
No context found.
W.Resig. Petri Nets. Springer-Verlag, 1982.
Markov Nets: Probabilistic Models for distributed and.. - Benveniste, Fabre, Haar (1 citation) (Correct)
No context found.
W. Reisig. Petri nets. Springer Verlag, 1985.
First 50 documents Next 50
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