Jensen, K., Coloured Petri nets, in: W. Brauer, W. Reisig and G. Rozenberg, editors, Advances in Petri Nets (1986), pp. 248--299.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....But if we use such techniques simply the cost for the verification still becomes large and the state explosion problem may occur. In order to reduce the verification costs, Ref. 4] propose techniques to merge equivalent states into one and make a reduced size s reachability graph called OS graph [5] from the original reachability graph. Ref. 6, 7] propose another kind of efficient reachability anal ysis techniques using symbolic reachability graph. Ref. 8, 9] use invariants for reducing the verification costs. Ref. 10, 11] use stochastic Petri nets, and Ref. 12] uses compositional high ....

....inconsistent with each other. Generally we can check whether a system includes a deadlock state or not by constructing the reachability graph of the system. Here, we adopt a policy to check the deadlock free property or liveness property of a given system by constructing an occur rence graph[5], which is known as a kind of abstraction of the reachability graph. To construct an occurrence graph, we transform a given specification (consisting of several CPNs and synchronization among them) into UESTION START QUESTION E Figure 3. Specification of Total System Derived from Fig.2 the ....

[Article contains additional citation context not shown here]

K. Jensen: "Coloured Petri Nets", EATCS Mono- graphs in Theoretical Computer Science Vol. 2., Springer-Verlag, (1997).

....more expressive than basic Petri Nets. In this setting, validation of complex speci cations is often performed through simulation and testing, i.e. by executing the speci cation looking for bugs, e.g. as in methodology based on the construction of the reachability graph of Colored Petri Nets [25]. In order to study algorithmic techniques for the analysis of a vast range of concurrency models it seems important to nd a uniform framework to reason about their characteristic features. In our approach we will adopt linear logic [Girard, 1987] as a uni ed logical framework for concurrency. ....

....of rst order LO programs with universally quanti ed goals. By working in the general setting of linear logic, we obtain a framework that can be applied to other speci cation languages for concurrent systems like multiset rewriting over rst order atomic formulas [12] and Colored Petri Nets [25]. The bottom up evaluation procedure can also be viewed as a xpoint semantics that allows us to compute the set of all goals that are linear logical consequences of a given (extended) LO program. The xpoint semantics is based on an e ective xpoint operator and on a symbolic and nite ....

[Article contains additional citation context not shown here]

Jensen, K. (1997). Coloured Petri-Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 1, 2 and 3. Monographs in Theoretical Computer Science. Springer-Verlag.

....of Petri nets allow type information for the control states and complex functions on the transitions. Petri nets model both states and actions explicitly and are generally considered a versatile formalism for modelling di erent kinds of systems. Here we use Coloured Petri nets introduced by Jensen [30]. Abstraction is usually applied on a high level formalism which generates a Kripke structure. The idea is that if irrelevant details are omitted from the high level model, the resulting Kripke structure will be smaller and thus easier to model check. Lakos [36] has presented an abstraction re ....

K. Jensen. Coloured Petri Nets, volume 1. Springer, Berlin, 1997.

....and analysis of real time systems, in particular for Ada programs [9, 10] and railway systems [11] 1.3 Coloured Petri Nets Earlier work has mainly focused on deadlock detection and violations of safety properties. This paper presents our application of Coloured Petri Nets (CP nets or CPNs) [12, 13] and the supporting Design CPN tool [14] for the scheduling and input output processing analysis in Avionics Mission Systems. This work is based on our previous modelling and analysis of AMS using CPnets [15, 16] Coloured Petri Nets [12, 13] are a graphically oriented modelling language for the ....

....our application of Coloured Petri Nets (CP nets or CPNs) 12, 13] and the supporting Design CPN tool [14] for the scheduling and input output processing analysis in Avionics Mission Systems. This work is based on our previous modelling and analysis of AMS using CPnets [15, 16] Coloured Petri Nets [12, 13] are a graphically oriented modelling language for the design, specification, and verification of concurrent and distributed systems. CPNs are based on Petri Nets and the functional programming language Standard ML (SML) 17] Petri Nets provide the primitives for modelling concurrency and ....

[Article contains additional citation context not shown here]

Jensen, K., 1997, Coloured Petri Nets. Basic Concepts, Analysis Method and Practical Use (Vol. 1-3), Monographs in Theoretical Computer Science, Second Edition, Springer-Verlag.

....respect to planning, having a LL sequent A B C, we do not know which one of the resources B or C would become the result of execution of particular action. Therefore a way to handle sequents like A B C within Petri nets we may choose between stochastic Petri nets [27] and coloured Petri nets [15], sometimes misleadingly called high level nets. In such a way the model can be speci ed within Algorithm PNGameSolver(init ; proof ; H ; goal) begin upper cycle: for 8t 2 T OR node for 8disj 2 t AND node . if notAchievable(disj ) then continue upper cycle end if end for end for ....

K. Jensen. Coloured Petri Nets. In: W. Brauer, W. Reisig, G. Rozenberg (eds). Petri Nets: Central Models and Their Properties. Proceedings of Advances in Petri Nets 1986.

....information with each other. Communication is the basis of social organization. In section 5 we give results of our first experiments with the two models. Finally, we conclude and look to future work in section 6. The CPNs that we present in this paper are designed with the Design CPN tool [4][5]. In order to keep a clear view on the models, we limit the number of agents to two. 2. The packet world 2.1 Introduction Consider a rectangular grid of size S. The grid contains a number of colored packets and agents. It is the agents job to collect the packets and bring them to their ....

....element. With such occurrence graphs we did a number of formal verifications for the CPNs of the packet world. We discuss here some results for the basic version of a world of size 5 with 2 agents that have to collect 5 packets. The tool generates a standard report (for more information see [5]) that already gives a lot of information. e.g. the Liveness Properties gives the Dead Transitions Instances for the occurrence graph. If e.g. CANT PICK is such a dead transition instance this means that for the given packet world there where no conflicts between the agents with picking up ....

K. Jensen, Coloured Petri Nets. Basic Concepts, Springer Verlag, 1992, ISBN: 3-540-60943-1.

....social skills. 1.3 Modeling MASs with Colored Petri Nets When we set out our approach the question arises how we should model the case application. Since Petri nets [1] have a long tradition to describe and analyze concurrent processes, they where excellent candidates. Colored Petri Nets (CPN) [2] combine the best of classical Petri nets and high level programming languages, and are for that very popular. CPNs have an intuitive graphical representation that paves the way for clear conceptual modeling of complex systems. The behavior of a system modeled with a CPN can be analyzed, not only ....

K. Jensen, "Coloured Petri Nets", Lecture Notes Comp. Science, nr. 254, Advances in Petri Nets, Bad Honnef, 1986.

No context found.

Jensen, K., Coloured Petri nets, in: W. Brauer, W. Reisig and G. Rozenberg, editors, Advances in Petri Nets (1986), pp. 248--299.

No context found.

K. Jensen. Coloured Petri nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Advances in Petri Nets, pages 248--299. Springer-Verlag LNCS 254, 1986.

No context found.

K. Jensen. Coloured Petri nets. In Petri Nets: Central Model and their Properties, Advances in Petri Nets 86, volume 254 of Lecture Notes in Computer Science, pages 248--299. Springer Verlag, September 1986.

No context found.

K. Jensen. Coloured Petri nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Model and their Properties, Advances in Petri Nets, Part 1, volume 254 of Lecture Notes in Computer Science, pages 248-- 299, Bad Honnef, Germany, September 1986. Springer Verlag.

No context found.

Jensen, K. (1997). Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Springer-Verlag.

No context found.

Jensen, K. (1987). Coloured Petri nets. In Brawer, W., Reisig, W., and Rozenberg, G., editors, Advances on Petri Nets '86 - Part I, volume 254 of LNCS, pages 248--299. Springer Verlag, Bad Honnef, West Germany.

No context found.

Jensen, K. (1997). Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Springer-Verlag.

No context found.

K. Jensen (1992), Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Monographs on Theoretical Computer Science, Springer.

No context found.

K. Jensen. Coloured Petri Nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and their Properties, Advances in Petri Nets, Part I, volume 254 of Lecture Notes in Computer Science. Springer-Verlag, 1986.

No context found.

K. Jensen. Coloured petri nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, LNCS 254, pages 248--299. Springer-Verlag, 1987.

No context found.

Jensen, K. Coloured Petri Nets, Springer-Verlag, Berlin, 1992.

No context found.

K. Jensen, Coloured Petri Nets, SpringerVerlag, 1992.

No context found.

K. Jensen. Coloured Petri Nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986 Part I, volume 254 of Lecture Notes in Computer Science, pages 248--299, Berlin, Germany, 1987. Springer-Verlag.

No context found.

Jensen, K.: Coloured Petri Nets. Volume 1. Springer, Berlin (1997)

No context found.

K. Jensen, Coloured Petri Nets, in Lecture Notes Computer Science, vol. 254, Advances in Petri Nets, Bad Honnef, Springer Verlag, 1986.

No context found.

K. Jensen, Coloured Petri Nets.Volume 1, Basic Concepts, 1997.

No context found.

K. Jensen, Coloured Petri Nets. Volume 2, Analysis Methods, 1997.

No context found.

K. Jensen (1992), Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Monographs on Theoretical Computer Science, Springer.

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