scientific article; zbMATH DE number 3924115

MaRDI QIDQ3698291zbMATH OpenFDO

Authors E. V. Trishina

Publication date 1983

zbMATH Keywords

equivalence problemflow charts

Mathematics Subject Classification ID

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

Recommendations

• On schematological equivalence of dataflow networks
• scientific article; zbMATH DE number 3928354
• Axiomatizing schemes and their behaviors
• Decidability of the analysis problem for dataflow models of programs
• scientific article; zbMATH DE number 522842

Cited in

(8)

• Investigating s-model programs for the purpose of reducing them to canonical form
• On schematological equivalence of partially interpreted dataflow networks
• On schematological equivalence of dataflow networks
• Decidability of the analysis problem for dataflow models of programs
• scientific article; zbMATH DE number 3917682 (Why is no real title available?)
• Enumeration of structured flowcharts
• scientific article; zbMATH DE number 1948400 (Why is no real title available?)
• A proof of the determinacy property of the data flow schema

This page was built for publication:

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