Talk:Kahn process networks

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Process firing semantics as Petri nets

This is a bit misleading: standard Petri nets cannot express FIFOs, so a KPN as a whole does not correspond to a Petri net. Rp (talk) 15:01, 26 January 2009 (UTC)[reply]

Conflicting diagrams

The state machine and the Petri net disagree on whether the execution of a process upon reading a token may write multiple tokens to its output. The textual description isn't clear on this. Rp (talk) 15:01, 26 January 2009 (UTC)[reply]

Multiple outputs?

The Petri net diagram doesn't describe what to do when there are multiple output channels. Rp (talk) 15:01, 26 January 2009 (UTC)[reply]

Formalisation welcome

Are cycles allowed? Can two processes read or write to the same FIFO? (Presumably not.) Do we really have just blank "tokens" or are they distinguishable, do they carry data for instance? The article doesn't say. Rp (talk) 15:01, 26 January 2009 (UTC)[reply]

Forbidden channel testing and PE resource

"Timing or execution order of processes must not affect the result and therefore testing input channels for tokens is forbidden."

Why should testing input channels always have an effect on timing or execution order?

"The single token in the PE resource place forbids that the process is executed simultaneously for different input data."

What does PE stand for and why resource?

Thanks, --Abdull (talk) 09:13, 11 October 2010 (UTC)[reply]

Reference problems

The references in this article ( except one I added ) are all written as flat text. These should be inlined at the right points with ref tags. Unixtastic (talk) 02:04, 18 November 2010 (UTC)[reply]