Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras-Reference-Cited by-同舟云学术

Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras

Published: Issue: Volume: Page:301-316
ISSN:1571-5736
Container-title:Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008
language:
Short-container-title:

Author:

Aceto Luca,Fokkink Wan,Ingolfsdottir Anna,Mousavi MohammadReza

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-0-387-09680-3_21.pdf

Reference27 articles.

1. L. Aceto, T. Chen, W. Fokkink, and A. Ingolfsdottir. On the axiomatizability of priority. Proceedings of Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Part II}, volume 4052 of LNCS, pages 480–491, Springer, 2006.

2. L. Aceto, W. Fokkink and A. Ingolfsdottir. Ready to preorder: Get your BCCSP axiomatization for free! Proceedings of CALCO’07, volume 4624 of LNCS, pages 338–367. Springer, 2007.

3. L. Aceto, W. Fokkink, A. Ingolfsdottir, and B. Luttik. CCS with Hennessy’s merge has no finite equational axiomatization. Theoretical Computer Science, 330(3):377–405, 2005.

4. L. Aceto, W. Fokkink, A. Ingolfsdottir, and B. Luttik. Finite equational bases in process algebra: Results and open questions. In A. Middeldorp, V. van Oostrom, F. van Raamsdonk, and R. C. de Vrijer, editors, Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday, volume 3838 of LNCS, pages 338–367. Springer, 2005.

5. L. Aceto, W. Fokkink, A. Ingolfsdottir, and M.R. Mousavi. Lifting non-finite axiomatizability results to extensions of process algebras. Technical Report CSR-08-05, TU/Eindhoven, 2008.