scientific article; zbMATH DE number 3997145

zbMath0615.68016MaRDI QIDQ4723281

Joost N. Kok

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

tokensinfinite sequences of finite workssemantic models for data flow nets

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (8)

On schematological equivalence of partially interpreted dataflow networks ⋮ Concurrent transition systems ⋮ Towards a complete hierarchy of compositional dataflow models ⋮ Specification and verification of concurrent systems by causality and realizability ⋮ Clocks in dataflow languages ⋮ The expressive power of indeterminate dataflow primitives ⋮ The algebra of stream processing functions ⋮ A proof of the Kahn principle for input/output automata

This page was built for publication: