Title of article
Nested semantics over finite trees are equationally hard
Author/Authors
Luca Aceto، نويسنده , , Fokkink، Wan 1965- نويسنده , , Rob van Glabbeek، نويسنده , , Anna Ingolfsdottir، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
30
From page
203
To page
232
Keywords
Hennessy–Milner logic , Process algebra , BCCSP , Nested simulation , Possible futures , Nested trace semantics , Equationallogic , Complete axiomatizations , Non-finitely based algebras , concurrency
Journal title
Information and Computation
Serial Year
2004
Journal title
Information and Computation
Record number
262237
Link To Document