350 research outputs found
Encoding Higher Level Extensions of Petri Nets in Answer Set Programming
Answering realistic questions about biological systems and pathways similar
to the ones used by text books to test understanding of students about
biological systems is one of our long term research goals. Often these
questions require simulation based reasoning. To answer such questions, we need
formalisms to build pathway models, add extensions, simulate, and reason with
them. We chose Petri Nets and Answer Set Programming (ASP) as suitable
formalisms, since Petri Net models are similar to biological pathway diagrams;
and ASP provides easy extension and strong reasoning abilities. We found that
certain aspects of biological pathways, such as locations and substance types,
cannot be represented succinctly using regular Petri Nets. As a result, we need
higher level constructs like colored tokens. In this paper, we show how Petri
Nets with colored tokens can be encoded in ASP in an intuitive manner, how
additional Petri Net extensions can be added by making small code changes, and
how this work furthers our long term research goals. Our approach can be
adapted to other domains with similar modeling needs
On the Use of Queueing Petri Nets for Modeling and Performance Analysis of Distributed Systems
Predictive performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed systems. However, as systems grow in size and complex-ity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. The challenge stems from the limited model expressivenes
Modeling and Simulation of Task Allocation with Colored Petri Nets
The task allocation problem is a key element in the solution of several applications from different engineering fields. With the explosion of the amount of information produced by the today Internet-connected solutions, scheduling techniques for the allocation of tasks relying on grids, clusters of computers, or in the cloud computing, is at the core of efficient solutions. The task allocation is an important problem within some branch of the computer sciences and operations research, where it is usually modeled as an optimization of a combinatorial problem with the inconvenience of a state explosion problem. This chapter proposes the modeling of the task allocation problem by the use of Colored Petri nets. The proposed methodology allows the construction of compact models for task scheduling problems. Moreover, a simulation process is possible within the constructed model, which allows the study of some performance aspects of the task allocation problem before any implementation stage
Petri net modeling and performance analysis of can fieldbus
The CAN FB (Controller Area Network FieldBus) has been in existence for ten years. It supports automated manufacturing and process control environments to interconnect intelligent devices such as valves, sensors, and actuators. CAN FieldBus has a high bit rate and the ability to detect errors. It is immune to noise and resistant to shock, vibration, and heat. Two recently introduced mechanisms, Distributed Priority Queue (DPQ) and Priority Promotion (PP) enable CAN FieldBus networks to share out the system bandwidth and grant ail upper bound on the transmission times so as to meet the requirements in real-time communications. Modeling and analysis of such networks are an important research area for their wide applications in manufacturing automation.
This thesis presents a Petri net methodology which models and analyzes CAN FieldBus access protocol. A Reachability Graph of the Petri net model is -utilized to study the behavioral properties of the protocol. A timed Petri net simulator is used to evaluate the performance of the protocol. Performance measures include the completion time for successful events and operations. Operational parameters investigated using the Petri Net model are FieldBus speed, the length of each frame, and the number of frames in a message
ATAMM analysis tool
Diagnostics software for analyzing Algorithm to Architecture Mapping Model (ATAMM) based concurrent processing systems is presented. ATAMM is capable of modeling the execution of large grain algorithms on distributed data flow architectures. The tool graphically displays algorithm activities and processor activities for evaluation of the behavior and performance of an ATAMM based system. The tool's measurement capabilities indicate computing speed, throughput, concurrency, resource utilization, and overhead. Evaluations are performed on a simulated system using the software tool. The tool is used to estimate theoretical lower bound performance. Analysis results are shown to be comparable to the predictions
Petri nets: 2. Applications
Petri nets offer a versatile modeling framework for complex, distributed, concurrent systems and have been used in a wide range of modeling applications. In Part 1 of this two-part article, we have seen important features and representational power of the Petri net model. We have also seen how the application of firing rules enables Petri nets to capture the dynamics or behavior of the modeled system. In this part, we will first understand how important system properties are modeled by Petri nets and then look into the applications of Petri net models
Simulator for concurrent processing data flow architectures
A software simulator capability of simulating execution of an algorithm graph on a given system under the Algorithm to Architecture Mapping Model (ATAMM) rules is presented. ATAMM is capable of modeling the execution of large-grained algorithms on distributed data flow architectures. Investigating the behavior and determining the performance of an ATAMM based system requires the aid of software tools. The ATAMM Simulator presented is capable of determining the performance of a system without having to build a hardware prototype. Case studies are performed on four algorithms to demonstrate the capabilities of the ATAMM Simulator. Simulated results are shown to be comparable to the experimental results of the Advanced Development Model System
A Process for Continuous Validation of Self-Adapting Component Based Systems
International audienceIn this paper we propose an approach to integrate the use of time-related stochastic properties in a continuous design process based on models at runtime. Time-related specifica-tion of services are an important aspect of component-based architectures, for instance in distributed, volatile networks of computation nodes. The models at runtime approach eases the management of such architectures by maintaining abstract models of architectures synchronized with the physical, distributed execution platform. For self-adapting systems, prediction of delays and throughput of a component assembly is of utmost importance to take adaptation decision and accept evolutions that conform to time specifications. To this aim we define a metamodel extension based on stochastic Petri nets as an internal time model for prediction. We design a library of patterns to ease the specification and prediction of common time properties of models at runtime and make the synchronization of behaviors and structural changes easier. Our prediction engine is fast enough to perform prediction at runtime in a realistic setting and validate models at runtime
- …