Counting Paths: Nondeterminism as Linear Algebra

DOI10.1109/TSE.1984.5010307MaRDI QIDQ3216112zbMATH OpenFDO

Authors David B. Benson

Publication date 1984

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSE.1984.5010307

zbMATH Keywords

actual state transition sequenceconvergent iterative programsdeterministic divergencenondeterministic divergencenondeterministic programsnonnegative matricesspectral radius

Mathematics Subject Classification ID

Theory of operating systems (68N25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Algebraic laws for nondeterminism and concurrency
• Two most nondeterministic programs
• On flowchart theories. II: The nondeterministic case
• Functional behavior of nondeterministic and concurrent programs
• scientific article; zbMATH DE number 5198953

Cited in

(2)

• A Term-Graph Syntax for Algebras over Multisets
• Non-deterministic structures of computation

This page was built for publication: Counting Paths: Nondeterminism as Linear Algebra

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