| Process Algebra with Five-Valued Conditions (1999) | |||||||||||||||||
Abstract | |||||||||||||||||
| . We propose a ve-valued logic that can be motivated from an algorithmic point of view and from a logical perspective. This logic is combined with process algebra. For process algebra with ve-valued logic we present an operational semantics in SOS-style and a completeness result. Finally, we discuss some generalizations. Key words & Phrases: Concurrency, process algebra, many-valued logic, conditional guard construct, conditional composition. 1991 CR Categories: F.3, F.4.3, I.1. 1 Introduction Assume P is some simple program or algorithm. Then the initial behaviour of if then P else P depends on evaluation of the condition : either it yields an immediate error, or it starts performing P , or it diverges in evaluation of . Note that the second possibility only requires that is either true or false. The following three nonclassical truth values accommodate these intuitions: Meaningless. Typical examples are errors that are detectable during execution such as a type-clash or... | |||||||||||||||||
Details der Publikation | |||||||||||||||||
| |||||||||||||||||