𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Real-Time Systems || Timed Petri Nets

✍ Scribed by Cheng, Albert M. K.


Publisher
John Wiley & Sons, Inc.
Year
2002
Weight
171 KB
Category
Article
ISBN-13
9780471224624

No coin nor oath required. For personal study only.

✦ Synopsis


TIMED PETRI NETS

Petri nets were developed as an operational formalism for specifying untimed concurrent systems. They can show concurrent activities by depicting control and data flows in different parts of the modeled system. As an operational formalism, a Petri net gives a dynamic representation of the state of a system through the use of moving tokens. The original, classical, untimed Petri nets have been used successfully to model a variety of industrial systems. More recently, time extensions of Petri nets have been developed to model and analyze time-dependent or real-time systems. The fact that Petri nets can show the different active components of the modeled system at different stages of execution or at different instants of time makes this formalism especially attractive for modeling embedded systems that interact with the external environment.

8.1 UNTIMED PETRI NETS

A Petri net, or place-transition net, consists of four basic components: places, transitions, directed arcs, and tokens. A place is a state the specified system (or part of it) may be in. The arcs connect transitions to places and places to transitions. If an arc goes from a place to a transition, the place is an input for that transition and the arc is an input arc to that transition. If an arc goes from a transition to a place, the place is an output for that transition and the arc is an output arc from that transition. More than one arc may exist from a place to a transition, indicating the input place's multiplicity. A place may be empty, or may contain one or more tokens. The state of a Petri net is defined by the number of tokens in each place, known as the marking and represented by a marking vector M. M[i] is the number of tokens in place i.


πŸ“œ SIMILAR VOLUMES


On possibilistic timed safe Petri nets
✍ Sandra Sandri; JanΓ©tte Cardoso πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 196 KB

The first goal of this work is to extend a model of Timed Safe Petri Nets to allow the treatment of preference between transitions. In the proposed Possibilistic Timed Safe Petri Net, we attach a duration to each transition, which can be precise, imprecise, or fuzzy, accounting for the maximal amoun

Real-Time Systems || Verification Using
✍ Cheng, Albert M. K. πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley & Sons, Inc. βš– 192 KB πŸ‘ 1 views

Finite automata and temporal logics have been used extensively to formally verify qualitative properties of concurrent systems. The properties include deadlock-or livelock-freedom, the eventual occurrence of an event, and the satisfaction of a predicate. The need to reason with absolute time is unne

Fuzzy time semirings and fuzzy-timing co
✍ Fuming Wu πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 219 KB πŸ‘ 1 views

We define a time scale as a linear-ordered commutative monoid LOC-monoid, for . short , which generalized the continuous time scale. Using some existing operations in fuzzy set theory, we equip our fuzzy time model with the algebraic structure of a semiring. This semiring structure provides a conven

Real-Time Systems Design and Analysis (L
✍ Laplante, Phillip A. πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley & Sons, Inc. 🌐 English βš– 151 KB πŸ‘ 2 views

The leading guide to real-time systems design-revised and updated This third edition of Phillip Laplante's bestselling, practical guide to building real-time systems maintains its predecessors' unique holistic, systems-based approach devised to help engineers write problem-solving software. Dr. Lap

Approximate real-time decision making: C
✍ James F. Peters; Andrzej Skowron; Zbigniew Suraj; Witold Pedrycz; Sheela Ramanna πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 440 KB πŸ‘ 1 views

This paper considers the construction of Petri nets to simulate the computation performed by decision systems. Algorithms are given to construct Petri nets which correspond to decision rules, information systems, and real-time decision systems. Rough as well as rough fuzzy Petri net extensions of co

Real-Time Systems || Bibliography
✍ Cheng, Albert M. K. πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley & Sons, Inc. βš– 226 KB πŸ‘ 1 views