Two most nondeterministic programs

DOI10.1016/0167-6423(86)90019-5MaRDI QIDQ1064048zbMATH OpenOpenAlexFDO

Authors J. G. Wiltink

Publication date 1986

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(86)90019-5

zbMATH Keywords

final stateinitial statesnondeterministic programs

Mathematics Subject Classification ID

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

Review text

The computations evoked by starting a program can differ with respect to termination and - in case of termination - final state. This paper contains two examples, together with formal proofs, of programs with different classes of possible computations for different initial states.

Recommendations

• scientific article; zbMATH DE number 3936484
• scientific article; zbMATH DE number 3894449
• scientific article; zbMATH DE number 3876560
• scientific article; zbMATH DE number 3980463
• Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)

Cited in

(10)

• Infinite trees, markings, and well-foundedness
• Repetitions, known or unknown?
• Counting successes: effects and transformations for non-deterministic programs
• Counting Paths: Nondeterminism as Linear Algebra
• scientific article; zbMATH DE number 3876560 (Why is no real title available?)
• scientific article; zbMATH DE number 3936484 (Why is no real title available?)
• scientific article; zbMATH DE number 3980463 (Why is no real title available?)
• scientific article; zbMATH DE number 4024793 (Why is no real title available?)
• Finite-cofinite program relations
• scientific article; zbMATH DE number 3894449 (Why is no real title available?)

This page was built for publication: Two most nondeterministic programs

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