Nested semantics over finite trees are equationally hard

Luca Aceto، نويسنده , , Fokkink، Wan 1965- نويسنده , , Rob van Glabbeek، نويسنده , , Anna Ingolfsdottir، نويسنده ,

روزنامه با شماره پیاپی سال 2004

30

203

232

Hennessy–Milner logic , Process algebra , BCCSP , Nested simulation , Possible futures , Nested trace semantics , Equationallogic , Complete axiomatizations , Non-finitely based algebras , concurrency

Information and Computation

2004

Information and Computation

262237