Map
Index
Random
Help
Topics
th

Topic: Petri net transitions and events

topics > computer science > Group: parallel processing



Topic:
asynchronous processing
Topic:
event time
Topic:
events
Topic:
Petri net
Topic:
calculus of communicating processes
Topic:
proving concurrent programs
Topic:
requirement specification by behaviors
Topic:
state machine
Topic:
synchronized processing
Subtopic: Petri net as concurrency up

Quote: Petri nets feature proper concurrency; i.e., the priority of causality over temporal order, and partial independence [»petrCA_1996]

Subtopic: transition as elementary, instantaneous up

Quote: the firing of a Petri net transition is instantaneous and nonsimultaneous; a primitive event [»peteJL9_1977]
Quote: primitive events in Petri nets are instantaneous and nonsimultaneous; simplifies analysis [»peteJL_1981]
Quote: a Petri net transition is an elementary process that can not be subdivided; occurs as one act [»petrCA1_1966]

Subtopic: transitions up

Quote: for atomic objects, a transition can have only one pre-state and post-state while states can have multiple pre/post-transitions [»holtAW11_1980]
Quote: a Petri net is a relation defining which new states replace which new states when a transition occurs [»petrCA_1996]

Subtopic: firing rules up

Quote: in a Petri-net, a process consumes all products in its pre-set and produces its post-set; a product is produced or consumed by any process [»holtAW_1979]
Quote: Petri's original firing rule required no tokens at the outputs; a form of zero testing [»peteJL_1981]
Quote: a Petri net transition fires when each of its input places has a token; firing moves a token to each of its output places [»ramaCV9_1980]
Quote: predicate/transition (PrT) Petri nets use high-level transitions/places, algebraic/logical conditions, and distinguishable tokens [»bellF6_1991]

Subtopic: coincidence in a Petri net up

Quote: coincidence in a system occurs when one transition always occurs with another; e.g., enter a train as leave the platform [»holtAW3_1979]
Quote: coincident transitions imply that two roles interact in a common activity; the transitions express the same fact [»holtAW3_1979]
Quote: can judge incidence between states or transitions but not the coincidence of either; e.g., a clock dial is between 1 and 2 vs. exactly 1; i.e., continuous motion [»petrCA_1996]

Subtopic: interaction as communication up

Quote: an interaction occurs when all the needed resources are present; represent by moving markers from pre-states to post-states [»holtAW3_1979]
Quote: interaction is the atom of behavior of the calculus of communication systems; i.e., passing a datum between processes [»milnR1_1993]
Quote: an interaction transmits a name (a means of access) from one process to another

Subtopic: conflicting transitions up

Quote: a conflict in a Petri net occurs when an object is on the left-hand side of multiple actions; indeterminate which actions actually occurs [»petrCA1_1966]
Quote: in a conflict-free net, the action is fully specified; otherwise have an incomplete net with information supplied from elsewhere [»petrCA1_1966]
Quote: a conflict in a Petri net occurs when an action can deactivate other actions

Subtopic: event time up

Quote: a nonprimitive event in a Petri net is modeled by a start event and an end event [»peteJL_1981]
Quote: a Petri net treats time as a partial order on event occurrence; no inherent measure of time
[»peteJL9_1977]

Related Topics up

Topic: asynchronous processing (30 items)
Topic: event time (45 items)
Topic: events (44 items)
Topic: Petri net (44 items)
Topic: calculus of communicating processes (13 items)
Topic: proving concurrent programs (37 items)
Topic: requirement specification by behaviors (16 items)
Topic: state machine (67 items)
Topic: synchronized processing
(35 items)

Updated ;;barberCB 10/04
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.