86

M: multimedia scenario, N: negative marking, I: interruption, PG: progress, R: refinement guarded, RC: recursive execution, RS: random switch, S: places offer structured token access, SC: self concurrency, ST: stream, Z: fuzziness

automated(!t)

The action of a transition is conducted automatically.

violation(!t)

Violations are transitions that must not belong to the events permitted by an implementation.

musical(!t)

A transition performs a musical function.

idle(!p)

A place represents parts that are waiting for production.

register(!p)

A place represents a hardware register.

link_type(!p)

A place represents a hyper-media link.

monomedia(!p)

A place represents a mono-media resource.

space(!p)

A place represents an organizational unit.

resource(!p)

A place represents a (production/office) resource.

mean(!p)

A place represents a product that is produced or consumed by an activity.

firing_duration(!t, !N)

Firing, i.e. changing the marking, consumes time..

firing_delay(!t, !N)

The time between the enabling and the firing of a transition is specified.

time_enable(!t)

Whether a transition is enabled depends on temporal restrictions.

t_location(!t)

It is specified where the action takes place.

p_location(!p)

It is specified where the tokens are stored.

synchronized(!t1, ..., !tn)

Several independently enabled transitions fire simultaneously.

conflict_resolve(!t1, ..., !tn)

A rule to choose among several enabled transitions is provided.

postset_delete(!t, !f1, ..., !fn)

The firing of a transition removes tokens from output places.

unchanged(!t, !f1, ..., !fn)

The firing of a transition does not affect the marking of certain input or output places

ext_marking(!p)

The environment changes the marking of a place.

ext_enable(!t)

Whether a transition is enabled depends on (non-temporal) external information. The number of tokens within the Petri net remains unchanged.

dep_enable(!t1, ..., !tn, !t)

Whether a transition is enabled depends on the enabling of other transitions.

not_enable(!f1, ..., !fn, !t)

Whether a transition is enabled does not depend on (the marking of) certain input places.

varying (!f)

The flow relation between a place and a transition (or vice versa) changes (e.g., depending on the current marking).

fact(!t)

The transition is never enabled. It represents a fact that always holds.

action(!t)

The content of a transition is described.

capacity(!p, !N)

Each place has a capacity N (N > 1). The capacity indicates an upper bound for the number of tokens in a place.

value(!tk)

A token carries a data value of an arbitrarily complex type.

detailed_t(!t)

A transition in a Petri net can be replaced by a transition-bordered subnet (refinement) or a set of transitions (unfolding).

detailed_p(!p)

A place in a Petri net can be replaced by a place-bordered subnet (refinement) or a set of places (unfolding).

1: constructs, a: assumption, i: implied by another proposition, m: missing statement (implied by descent), na: not applicable

d: deleted, r: renamed, rf: refer to, sg: general specialization, sd: domain-specific specialization, X: semantics and name of the original construct not changed

d: deleted, r: renamed, rf: refer to, sg: general specialization, sd: domain-specific specialization, X: semantics and name of the original construct not changed, mapping: 1:N- and M:N-types of relationships, min/max: relationship types, characterized by min/max-cardinalitied

d: deleted, r: renamed, rf: refer to, sg: general specialization, sd: domain-specific specialization, X: semantics and name of the original construct not changed

r: renamed, rf: refer to, sg: general specialization, sd: domain-specific specialization, l: label, f: function, X: semantics and name of the original construct not changed

PN mentioned for the first time (according to the year of the conference, references or information by the author); may differ from the year of the evaluated publication

No.				86
Short Citation				(Best et al. 1995)
Year				1995
Special Name				M-nets (multilabeled)
Descendant of				Pr/T
Constructs	Inherent	Place		rf: Pr/T, sg/l: status (entry, exit, internal)
		Transition		rf: Pr/T, sg/l: communication interface
		Flow Relation		rf: Pr/T
		Token		rf: Pr/T
	New	Invented	Adapted
			Included
		Borrowed	Included
			Added
Syntactic Rules	Added			X
	Restricted			(1) There is always at least one entry and one exit place.
Remarks
Alternative Publications				[Benzaken et al. 1998]
Binary Vector	Inherent	[P1]		1
		[P2]		1
		[P3]		1
		[P4]		1
		[P5]
		[P6]
		[P7]
		[P8]
		[P9]
		[P10]
		[P11]
		[P12]
		[P13]
		[P14]
		[P15]		1
	Explicit	[P16]
		[P17]
		[P18]
		[P19]
		[P20]
		[P21]
	Domain	[P22]
		[P23]
		[P24]
		[P25]
		[P26]
		[P27]
		[P28]
		[P29]
		[P30]
		[P31]
Expressiveness Values	Total			0.16
	Inherent			0.33
	Explicit			0.00
	Domain Specifics			0.00
Partially Redundant Constructs	Conjunctive Concepts
	Linked Concepts