In this paper, we show that the non-deterministic choice "+", which was proposed as a primitive operator in Synchronization Tree Logic (STL for short) can be defined essentially by conjunction and disjunction in the μ-calculus (μM for short). This is obtained by extending the μ-calculus with the non-deterministic choice "+" (denoted by μM+) and then showing that μM+ can be translated into μM. Furthermore, we also prove that STL can be encoded into μM+ and therefore into μM. © IFIP International Federation for Information Processing 2005.
CITATION STYLE
Zhan, N., & Majster-Cederbaum, M. (2005). Deriving non-determinism from conjunction and disjunction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3731 LNCS, pp. 351–365). https://doi.org/10.1007/11562436_26
Mendeley helps you to discover research relevant for your work.