scientific article; zbMATH DE number 3978366
[For the entire collection see Zbl 0578.00005.] The privileged field of classical algebra and term rewriting systems is that of strictly deterministic systems: the confluence property is generally assumed to hold, which ensures determinism about the result of the computations, even if there exist several different computation paths. In this paper, we develop a new formalism introducing a bounded nondeterministic choice operator '\(\uparrow '\) into algebraic specifications and related term rewriting systems; nondeterminism about the result becomes allowed in this framework. We define the algebraic and the operational aspects of such systems, and investigate their relationship. Methods à la Knuth-Bendix are developed for automatic theorem proving in such theories. Several examples are considered, including a toy concurrent language, for which non-trivial properties may be automatically proved.
- Rewriting with a nondeterministic choice operator
- Rewriting, computation and proof. Essays dedicated to Jean-Pierre Jouannaud on the occasion of his 60th birthday.
- scientific article; zbMATH DE number 4164155 (Why is no real title available?)
- Nondeterministic algebraic specifications and nonconfluent term rewriting
- scientific article; zbMATH DE number 7456060 (Why is no real title available?)
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 Q3742702)