Satisfiability of dataflow models of distributed programs

DOI10.1023/A:1012336809259MaRDI QIDQ1403191zbMATH OpenOpenAlexFDO

Authors V. V. Toporkov

Publication date 1 September 2003

Published in Programming and Computer Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1012336809259

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Decidability of the analysis problem for dataflow models of programs
• Execution termination and computation determinacy of data-flow program nets
• Data flow analysis of distributed communicating processes
• Communicating Sequential Processes. The First 25 Years
• scientific article; zbMATH DE number 3930323

Cited in

(7)

• scientific article; zbMATH DE number 7724201 (Why is no real title available?)
• Execution termination and computation determinacy of data-flow program nets
• Composition and distribution of resources for real-time computing systems
• Decidability of the analysis problem for dataflow models of programs
• A linear programming approach to general dataflow process network verification and dimensioning
• Supporting schedules of resource co-allocation for distributed computing in scalable systems
• Stability, sequentiality and demand driven evaluation in dataflow

This page was built for publication: Satisfiability of dataflow models of distributed programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1403191)