3,618 research outputs found
Membrane Systems with Priority, Dissolution, Promoters and Inhibitors and Time Petri Nets
We continue the investigations on exploring the connection between membrane
systems and time Petri nets already commenced in [4] by extending membrane
systems with promoters/inhibitors, membrane dissolution and priority for rules compared
to the simple symbol-object membrane system. By constructing the simulating
Petri net, we retain one of the main characteristics of the Petri net model, namely, the
firings of the transitions can take place in any order: we do not impose any additional
stipulation on the transition sequences in order to obtain a Petri net model equivalent to
the general Turing machine. Instead, we substantially exploit the gain in computational
strength obtained by the introduction of the timing feature for Petri nets
PETRI NET MODEL IN THE PROCESS OF SUBMISSION FOR CUSTOMER CREDIT OF BPR LAMBANG GANDA SERANG
The credit application process is one of a service that involves queues. This study aims to determine the design of the credit process application service system at the Lambang Ganda Serang Credit Bank using the Petri Net model. This study has 12 places, eight transitions, six operators, and 22 arcs of Petri Net model from credit application service system using Woped 3.2.0 version softwar
The Petri Net Model for the Collaborative Virtual Environment on the Web
[[abstract]]This paper presents a Petri Net model to analyze the workflow of a web-based multiple participants virtual environment. The presented approach not only can conspicuously help the developer to comprehend the interaction relationship between the client-server virtual environments but also to easily construct a shared virtual world. Based on the presented Petri Net model, we propose an architecture for the collaborative virtual environment and implement a multiple user 3D web browsing system, called the SharedWeb system. Problems of providing the multi-user interaction on the Web and the solutions proposed by the Petri Net model are fully elaborated here. Some experimental results along with two demonstrated virtual world are also presented.[[notice]]補正完
Hybrid Petri net model of a traffic intersection in an urban network
Control in urban traffic networks constitutes an important and challenging research topic nowadays. In the literature, a lot of work can be found devoted to improving the performance of the traffic flow in such systems, by means of controlling the red-to-green switching times of traffic signals. Different techniques have been proposed and commercially implemented, ranging from heuristic methods to model-based optimization. However, given the complexity of the dynamics and the scale of urban traffic networks, there is still a lot of scope for improvement. In this work, a new hybrid model for the traffic behavior at an intersection is introduced. It captures important aspects of the flow dynamics in urban networks. It is shown how this model can be used in order to obtain control strategies that improve the flow of traffic at intersections, leading to the future possibility of controlling several connected intersections in a distributed way
Proving a Petri net model-checker implementation
Petri nets are a widely used tool in verification through model-checking. In this approach, a Petri Net model of the system of interest is produced and its reachable states are computed, searching for erroneous executions. Compilation of such a Petri net model is one way to accelerate its verification. It consists in generating code to explore the reachable states of the considered Petri net, which avoids the use of a fixed exploration tool involving an "interpretation" of the Petri net structure. In this paper, we show how to compile Petri nets targeting the LLVM language (a high-level assembly language) and formally prove the correct-ness of the produced code. To this aim, we define a structural operational semantics for the fragment of LLVM we use. The acceleration obtained from the presented compilation techniques has been evaluated in [6]
Recommended from our members
A dynamic petri net model for iterative and interactive distributed multimedia presentation
Object Composition Petri Nets (OCPN), Priority Petri Nets (P-Net), Dynamic OCPN (DOCPN) and Enhanced P-Nets (EP-Net) have extended the original Petri Net to achieve the modeling of media synchronization and asynchronous user interactions during multimedia playback. Dynamic Petri Net (DPN) has been conceptualized to tackle existing problems in these two areas of modeling distributed multimedia systems. DPN features dynamic modeling elements which allows iteration and hence is able to reduce graph sizes of synchronous playback models while allowing greater details to be shown. DPN also introduces asynchronous event handling techniques that are powerful and effective. DPN was used in the design and modeling of a multimedia orchestration tool which is a typical representation of an application that works in a distributed multimedia system
A unifying Petri net model of non-interference and non-deducibility information flow security
In this paper we introduce FIFO Information Flow Nets (FIFN) as a model for describing information flow security properties. The FIFN is based on Petri nets and has been derived from the work described in [Var89], [Var90] and [Rou86]. Using this new model, we present the information flow security properties Non-Interference between Places (which corresponds to Non-Interference) and Non-Deducibility on Views (which corresponds to Non-Deducibility on Inputs). Then we consider a very general composition operation and show that neither Non-Interference on Places nor Non-Deducibility on Views is preserved under this composition operation. This leads us to a new definition of information flow security referred to as the Feedback Non-Deducibility on Views. We then show that this definition is preserved under the composition operation. This leads us to a new definition of information flow security referred to as the Feedback Non-Deducibility on Views. We then show that this definition is preserved under the composition operation. We then show some similarities between this property and the notion of Non-Deducibility on Strategies
- …