Výsledky vyhledávání - "non-finitely based algebras"

Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?

Autor: Luca Aceto, Valentina Castiglioni, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik

Publikováno v: ACM Transactions on Computational Logic, 23(4):22, 1-56. Association for Computing Machinery (ACM)
ACM Transactions on Computational Logic, 23(4):22. Association for Computing Machinery, Inc
Aceto, L, Castiglioni, V, Fokkink, W, Ingólfsdóttir, A & Luttik, B 2022, ' Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ', ACM Transactions on Computational Logic, vol. 23, no. 4, 22, pp. 1-56 . https://doi.org/10.1145/3529535

Bergstra and Klop have shown that bisimilarity has a finite equational axiomatisation over ACP/CCS extended with the binary left and communication merge operators. Moller proved that auxiliary operators are necessary to obtain a finite axiomatisation

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa7910a19045e6f8fc15641b740573d0
https://doi.org/10.1145/3529535

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

On the axiomatizability of priority II

Autor: Bethke, I., Aceto, Luca, Ponse, A., Chen, T., Ingolfsdottir, Anna, Rodenburg, P.H., Luttik, Bas, van de Pol, Jan Cornelis

Publikováno v: Theoretical Computer Science, 412(28), 3035-3044. Elsevier
Aceto, L, Chen, T, Ingolfsdottir, A, Luttik, B & van de Pol, J C 2011, ' On the Axiomatizability of Priority II ', Theoretical Computer Science, vol. 412, pp. 3035-3044 . https://doi.org/10.1016/j.tcs.2011.02.033
Theoretical Computer Science, 412, 3035-3044. Elsevier
Theoretical computer science, 412(28), 3035-3044. Elsevier

This paper contributes to the study of the equational theory of the priority operator of Baeten, Bergstra and Klop in the setting of the process algebra BCCSP. It is shown that, in the presence of at least two actions, the collection of process equat

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9871941f61da8adf437ccb465ec66a5e
https://research.tue.nl/en/publications/578dbe89-be4f-477f-9e45-bf6b228fe08f

Zobrazit plný text záznamu

CCS with Hennessy's merge has no finite-equational axiomatization

Autor: Anna Ingólfsdóttir, Wan Fokkink, Bas Luttik, Luca Aceto

Publikováno v: Theoretical Computer Science, 330(3), 377-405. Elsevier
Aceto, L, Fokkink, W, Ingolfsdottir, A & Luttik, B 2005, ' CCS with Hennessy's merge has no finite-equational axiomatization ', Theoretical Computer Science, vol. 330, no. 9, pp. 377-405 . < http://dx.doi.org/10.1016/j.tcs.2004.10.003 >
Aceto, L, Fokkink, W J, Ingólfsdóttir, A & Luttik, B 2005, ' CCS with Hennessy's merge has no finite-equational axiomatization ', Theoretical Computer Science, vol. 330, no. 3, pp. 377-405 . https://doi.org/10.1016/j.tcs.2004.10.003
Chicago Journal of Theoretical Computer Science, 330(3), 377-405

This paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free fragment of Milner's Calculus of Communicating Syst

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0dab37ba1ace1b8f3c3e72ee2feded5
https://research.tue.nl/nl/publications/bed83f78-02e2-44ae-bb53-25a5fd552d5e

Zobrazit plný text záznamu

Autor: Anna Ingólfsdóttir, Sumit Nain, Wan Fokkink, Luca Aceto

Publikováno v: Lecture Notes in Computer Science, 3629, 52-66. Springer Verlag
Vrije Universiteit Amsterdam
BRICS Report Series; No 33 (2005): RS-33 Bisimilarity is not Finitely Based over BPA with Interrupt
BRICS Report Series; Nr. 33 (2005): RS-33 Bisimilarity is not Finitely Based over BPA with Interrupt
Aceto, L, Fokkink, W, Ingolfsdottir, A & Nain, S 2004 ' Bisimilarity is not Finitely Based over BPA with Interrupt ' . < http://www.brics.dk/RS/04/24/ >
Aceto, L, Fokkink, W J, Ingólfsdóttir, A & Nain, S 2006, ' Bisimilarity is not finitely based over BPA with interrupt ', Theoretical Computer Science, vol. 366, no. 1-2, pp. 60-81 . https://doi.org/10.1016/j.tcs.2006.07.003
CALCO
Aceto, L, Fokkink, W, Ingolfsdottir, A & Nain, S 2006, ' Bisimilarity is not finitely based over BPA with interrupt ', Theoretical Computer Science, vol. 366, no. 1-2, pp. 60-81 .
Aceto, L, Fokkink, W, Ingolfsdottir, A & Nain, S 2005, Bisimilarity is not finitely based over BPA with interrupt . in J Luiz Fiadeiro, N Harman, M Roggenbach & J Rutten (eds), Proceedings of Algebra and Coalgebra in Computer Science, 1st Conference, CALCO 2005 . IEEE Computer Society Press, Lecture Notes in Computer Science, no. 3629, pp. 54-68, Conference on Algebra and Coalgebra in Computer Science (CALCO), 3-6 September 2005, Swansea, Wales, United Kingdom, 03/09/2005 . < http://www.brics.dk/RS/04/24/index.html >
Aceto, L, Fokkink, W J, Ingólfsdóttir, A & Nain, S 2005, ' Bisimilarity Is Not Finitely Based over BPA with Interrupt ', Lecture Notes in Computer Science, vol. 3629, pp. 52-66 .
BRICS Report Series; No 24 (2004): RS-24 Bisimilarity is not Finitely Based over BPA with Interrupt
BRICS Report Series; Nr. 24 (2004): RS-24 Bisimilarity is not Finitely Based over BPA with Interrupt
Scopus-Elsevier
Algebra and Coalgebra in Computer Science ISBN: 9783540286202
Theoretical Computer Science, 366(1-2), 60-81. Elsevier

This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop's basic process algebra (BPA) with the interrupt operator. Moreover, it is shown that the coll

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73871186f991be44f924ad49bee116af
https://research.vu.nl/en/publications/bd6ed3ff-2586-4382-866f-1158842853dc

Zobrazit plný text záznamu

Nested semantics over finite trees are equationally hard

Autor: Rob van Glabbeek, Wan Fokkink, Anna Ingólfsdóttir, Luca Aceto

Publikováno v: Information and Computation, 191(2), 203-232. Elsevier Inc.
BRICS Report Series; No 27 (2003): RS-27 Nested Semantics over Finite Trees are Equationally Hard
BRICS Report Series; Nr. 27 (2003): RS-27 Nested Semantics over Finite Trees are Equationally Hard
Aceto, L, Fokkink, W, Glabbeek, van, R & Ingolfsdottir, A 2004, ' Nested Semantics over Finite Trees are Equationally Hard ', Information and Computation, vol. 191, no. 2, pp. 203-232 . < http://dx.doi.org/10.1016/j.ic.2004.02.001 >
Aceto, L, Fokkink, W J, van Glabbeek, R J & Ingólfsdóttir, A 2004, ' Nested semantics over finite trees are equationally hard ', Information and Computation, vol. 191, no. 2, pp. 203-232 . https://doi.org/10.1016/j.ic.2004.02.001

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 part

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35466f4a9380a39a82e955fbdb8355a6
https://research.vu.nl/en/publications/dea1fd5a-2e11-498e-aab9-ec7159274132

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání