50

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.				50
Short Citation				(Haddad/Girault 1987)
Year				1987
Special Name				Regular Nets
Descendant of				CPN
Constructs	Inherent	Place		rf: CPN
		Transition		rf: CPN
		Flow Relation		rf: CPN
		Token		rf: CPN
	New	Invented	Adapted
			Included
		Borrowed	Included
			Added
Syntactic Rules	Added			X
	Restricted			(1) Given two places, then either their colour sets are identical or their colour sets have an empty intersection (p. 77).
Remarks				further restrictions on the incidence matrix
Alternative Publications
Binary Vector	Inherent	[P1]		na
		[P2]		na
		[P3]		na
		[P4]		na
		[P5]		na
		[P6]		na
		[P7]		na
		[P8]		na
		[P9]		na
		[P10]		na
		[P11]		na
		[P12]		na
		[P13]		na
		[P14]
		[P15]		na
	Explicit	[P16]		na
		[P17]		na
		[P18]		na
		[P19]		na
		[P20]		na
		[P21]		na
	Domain	[P22]		na
		[P23]		na
		[P24]		na
		[P25]		na
		[P26]		na
		[P27]		na
		[P28]		na
		[P29]		na
		[P30]		na
		[P31]		na
Expressiveness Values	Total			na
	Inherent			na
	Explicit			na
	Domain Specifics			na
Partially Redundant Constructs	Conjunctive Concepts			na
	Linked Concepts			na