Results 11 - 20 of 183

Modelling the WAP Transaction Service using Coloured Petri Nets

by Steven Gordon, Jonathan Billington - Proceedings of the First International Conference on Mobile Data Access, LNCS 1748 , 1999
"... The Wireless Application Protocol (WAP) is an architecture designed to support the provision of wireless Internet services to mobile users with hand-held devices. The Wireless Transaction Protocol is a layer of WAP that provides a reliable request-response service suited for Web applications. In thi ..."
Abstract - Cited by 8 (5 self) - Add to MetaCart
. In this paper Coloured Petri nets are used to model and generate the possible primitive sequences of the request-response Transaction Service. From the results we conclude that the service specification lacks an adequate description of what constitutes the end of a transaction. No other deficiencies were found

Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs

by Sören Christensen, Niels Damgaard Hansen - Applications and Theory of Petri Nets, volume 691 of LNCS , 1992
"... In this paper we show how to extend Coloured Petri Nets (CP-nets), with three new modelling primitivesplace capacities, test arcs and inhibitor arcs. The new modelling primitives are introduced to improve the possibilities of creating models that are on the one hand compact and comprehensive and ..."
Abstract - Cited by 60 (1 self) - Add to MetaCart
In this paper we show how to extend Coloured Petri Nets (CP-nets), with three new modelling primitivesplace capacities, test arcs and inhibitor arcs. The new modelling primitives are introduced to improve the possibilities of creating models that are on the one hand compact and comprehensive

Analyzing Paths in Time Petri Nets

by Louchka Popova-zeugmann, Dirk Schlatter , 1999
"... . In this paper, a parametric description of a transition sequence in a Time Petri net is introduced. The minimal and maximal time duration of a transition sequence are shown to be integers and furthermore the min/max path passes only integer-states. A necessary condition for the reachability of an ..."
Abstract - Cited by 14 (7 self) - Add to MetaCart
of an arbitrary state is given. Keywords: Time Petri Net, integer state, reachability of a state, parametric description of a transition sequence 1. Introduction One of the most adequate ways of modeling and analyzing concurrent systems with an infinite state space is given by the theory of Petri nets

Transactions and Zero-Safe Nets

by Roberto Bruni, Ugo Montanari - Advances in Petri Nets: Unifying Petri Nets, Lect. Notes in Comput. Sci. 2128 , 2001
"... When employing Petri nets to model distributed systems, one must be aware that the basic activities of each component can vary in duration and can involve smaller internal activities, i.e., that transitions are conceptually refined into transactions. We present an approach to the modeling of transac ..."
Abstract - Cited by 16 (8 self) - Add to MetaCart
When employing Petri nets to model distributed systems, one must be aware that the basic activities of each component can vary in duration and can involve smaller internal activities, i.e., that transitions are conceptually refined into transactions. We present an approach to the modeling

WS-Net: A Petri-net Based Specification Model for Web Services

by Jia Zhang, Carl K. Chang, Jen-yao Chung, Seong W. Kim - Proc. ICWS , 2004
"... The emerging paradigm of web services opens a new way of web application design and development to quickly develop and deploy web applications by integrating independently published web services components to conduct new business transactions. As research aiming at facilitating web services integrat ..."
Abstract - Cited by 25 (1 self) - Add to MetaCart
that the component provides to other components; interconnection net specifies the services that the component acquires to accomplish its mission; and interoperation net describes the internal operational behaviors of the component. As an architectural model that formalizes the architectural topology and behaviors

Combining Petri Nets and PA-Processes

by Richard Mayr - International Symposium on Theoretical Aspects of Computer Software (TACS'97), volume 1281 of LNCS , 1997
"... . Petri nets and PA-processes are incomparable models of infinite state concurrent systems. We define a new model PAN (= PA + PN) that subsumes both of them and is thus strictly more expressive than Petri nets. It extends Petri nets with the possibility to call subroutines. We show that the reachabi ..."
Abstract - Cited by 5 (3 self) - Add to MetaCart
. Petri nets and PA-processes are incomparable models of infinite state concurrent systems. We define a new model PAN (= PA + PN) that subsumes both of them and is thus strictly more expressive than Petri nets. It extends Petri nets with the possibility to call subroutines. We show

On Parametrical Sequences in Time Petri Nets

by Louchka Popova-zeugmann - Proceedings of the CS&P'97 Workshop , 1997
"... For more then 20 years time dependent Petri nets have been defined and have been used for modeling and analyzing of concurrent systems. At first sight both notions exclude each other. We use the time in order to define possible starts- and deadlines for the actions of a given system. Nevertheless th ..."
Abstract - Cited by 6 (3 self) - Add to MetaCart
For more then 20 years time dependent Petri nets have been defined and have been used for modeling and analyzing of concurrent systems. At first sight both notions exclude each other. We use the time in order to define possible starts- and deadlines for the actions of a given system. Nevertheless

Object Oriented Modelling with Object Petri Nets

by Charles Lakos - In: Advances in Petri Nets. LNCS , 1997
"... : This paper informally introduces Object Petri Nets (OPNs) with a number of examples. OPNs support a thorough integration of object-oriented concepts into Petri Nets, including inheritance and the associated polymorphism and dynamic binding. They have a single class hierarchy which includes both to ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
case study of using OPNs to model a cooperative editor for hierarchical diagrams. This extended example demonstrates the applicability of OPNs to the modelling of non-trivial concurrent systems. The methodology for deriving a Petri Net model is to adapt an object-oriented design methodology: the Object

Proving liveness properties of concurrent programs using petri-nets

by Fredrik Loch
"... Abstract With the increased scale of distributed computations the complexity of liveness proofs have increased. In this paper we endeavor to simplify the process of verifying a concurrent system using well know modeling techniques. The choice of modeling tool as well as the proof is based on future ..."
Abstract - Add to MetaCart
in loop modeling. This is used to clarify the translation of the original proof to our petri-net representation. With these results we discuss the usefulness of our approach and compare it to other methods of ensuring liveness.

M-nets: an Algebra of High-level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages

by Eike Best, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel, Elisabeth Pelz
"... This paper describes a high-level Petri net model called Mnets (for modular multilabelled nets). A distinctive feature of this model is that it allows both: unfolding, as do most other high-level net models; and composition -- in particular, synchronisation -- in a process algebraic style, turning t ..."
Abstract - Cited by 21 (9 self) - Add to MetaCart
This paper describes a high-level Petri net model called Mnets (for modular multilabelled nets). A distinctive feature of this model is that it allows both: unfolding, as do most other high-level net models; and composition -- in particular, synchronisation -- in a process algebraic style, turning
Results 11 - 20 of 183