Nested semantics over finite trees are equationally hard

详细信息	查看全文 | 推荐本文 |

• 作者：Aceto ; Luca ; Fokkink ; Wan ; van Glabbeek ; Rob ; Ing&oacute ; lfsd&oacute ; ttir ; Anna
• 关键词：08A70 ; 03B45 ; 03C05 ; 68Q10 ; 68Q45 ; 68Q55 ; 68Q70 ; Concurrency ; Process algebra ; BCCSP ; Nested simulation ; Possible futures ; Nested trace semantics ; Equational logic ; Complete axiomatizations ; Non-finitely based algebras ; Hennessy&ndash ; Milner logic
• 刊名：Information and Computation
• 出版年：2004
• 期刊代码：132_08905401
• 类别：cp
• 出版时间：June 15, 2004
• 卷：191
• 期：2
• 页码：203-232
• 文件大小：303 K

摘要

This paper studies nested simulation and nested trace semantics over the language BCCSP, a basic formalism to express finite process behaviour. It is shown that none of these semantics affords finite (in)equational axiomatizations over BCCSP. In particular, for each of the nested semantics studied in this paper, the collection of sound, closed (in)equations over a singleton action set is not finitely based.