Nested Semantics over Finite Trees are Equationally Hard

Forfattere

  • Luca Aceto
  • Willem Jan Fokkink
  • Rob J. van Glabbeek
  • Anna Ingólfsdóttir

DOI:

https://doi.org/10.7146/brics.v10i27.21795

Resumé

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.

Downloads

Publiceret

2003-08-07

Citation/Eksport

Aceto, L., Fokkink, W. J., Glabbeek, R. J. van, & Ingólfsdóttir, A. (2003). Nested Semantics over Finite Trees are Equationally Hard. BRICS Report Series, 10(27). https://doi.org/10.7146/brics.v10i27.21795

Nummer

Nr. 27 (2003): RS-27 Nested Semantics over Finite Trees are Equationally Hard

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).