copycat82 Gate Problems:
with a "Dataful"-Output which Goes Schizoid

copycat82 commits plagiarism, along with ignorance. The on-going self-contradictions, the utterly-schizoid nature, were obvious (also) with the macro-gate mess of copycat82. This page points out the ignorance of the "dataful" attempts of copycat82. Other pages point out the contagiousness, etc.

copycat82: needs data, attempts to verify without data

Even the versatile strategy of E-nets is more standardized. E-net transitions are well-defined, valid logic elements. An E-net, even without data, is verifiable for many aspects, as it preserves, for example, the rule that, for each firing

These rules are true for E-nets, Petri nets, and even for SARA nodes (except its multiple-possible arcs from an "inclusive-OR" but this is again a single-token per arc). The problematic exception is copycat82, which violates each of them.

Furthermore, an E-net input may never deadlock - unless the modeler lets it with data-preferences.

With E-nets, a (net-visible) deadlock may only occur if resolution is altogether omitted (explicitly, to invoke deadlock). With copycat82, "xor" corresponds to a Y-transition without any resolution.

Deadlock may also exist within procedures, although this is not about the (visible) net. It is very probably, a bad idea to keep critical variables (semaphore, lock-for-exclusion, monitor, etc.) only as data - especially if data may be ignored by the interpreter. e.g: In the "sample application" of copycat82 (on page 150), a semaphore is only a data-variable, and it is not represented in the Petri net, at all.

Neither to verify, nor to run?

The only type of analysis copycat82 suggests, corresponds to the level-1 of VD78. i.e: The data, and program-fragments are to be ignored, at the end, although there is a possibility of zero-to-infinite tokens being released out, per any firing. This is certainly not the case with VD78 subnets.

copycat82's time problems

copycat82 is not probably, about a deterministic simulation, either, although it presents the model in those terms, imitative of E-nets. For example, how would you decide, in a simulation, when to release the (next) token from a transition/subnet? Without any time-management, that is undefined (N/A).

i.e: It is not know when the token(s) will be released, but copycat82 also says that it/they cannot wait at the input-side. i.e: As soon as enabled, (all of) the enabled transition(s), must start (altogether). If this modeler-constraint is not to be neglected, that needs the (non-deterministic) verifier to enforce some non-Petri-net timing-requirements, too.

See also: The time-confusion of copycat82, between E-nets vs. time-Petri-nets.

Further Reading

The plagiarism of copycat82 encompasses its input-gate, and its output-gate, too.

An attempt to imitate JSP primitives? Or, parallelism?

Forum: . . (Fair Menu . . . . . Fault Report? . . . . . Remedy for your case . . . . . Noticed Plagiarism?)

Referring#: 0
Last-Revised (text) on Nov. 26, 2004 . . . that was
mirror to, on June 17, 2009
Written by: Ahmed Ferzan/Ferzen R Midyat-Zila (or, Earth)
Copyright (c) 2004, 2009 Ferzan Midyat. All rights reserved.