This paper presents CDDF, a model of computation underpinning the formal seman-tics of a number of parallel programming languages. CDDF integrates control ow elements for thedynamic construction of task graphs, and data ow elements to express dependent computationsand to decouple these using unbounded streams (Kahn process networks). It is a common groundto de ne the formal sema...

Controllability is a fundamental sanity check for open systems such as services. Existing approaches to check controllability consider Petri net models in which data aspects are usually neglected or abstracted from. This paper investigates controllability of algebraic Petri nets and sketches a symbolic analysis approach.

This paper focuses on issues related to implementing timed discrete-event systems (TDES) supervisors, and the concurrency and timing delay issues involved. In particular, we examine issues related to implementing TDES as sampled-data (SD) controllers. An SD controller is driven by a periodic clock and sees the system as a series of inputs and outputs. On each clock edge (tick event), it samples...