Hey,
Kahn Process Networks are defined by the usage of unbounded FIFOs with blocking reads and non-blocking writes.
I read on several sources that KPN with bounded FIFO size (i.e. blocking read and blocking write) can be implemented with SystemC (e.g. Grötker et al).
It seams that the event based scheduler in SystemC behaves different like data-driven scheduler or a demand-driven for KPNs.
I simulated the networks of Park's Dissertation shown on page 36 and 42 which should end up in an artificial deadlock (deadlock which occurs because of blocking write).
A global artificial