Back to Search
Start Over
Nested semantics over finite trees are equationally hard
- Source :
-
Information & Computation . Jun2004, Vol. 191 Issue 2, p203-232. 30p. - Publication Year :
- 2004
-
Abstract
- 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. [Copyright &y& Elsevier]
- Subjects :
- *INFORMATION theory
*MATHEMATICS
*ALGEBRA
*MATHEMATICAL analysis
Subjects
Details
- Language :
- English
- ISSN :
- 08905401
- Volume :
- 191
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Information & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 13105923
- Full Text :
- https://doi.org/10.1016/j.ic.2004.02.001