Finite equational bases in process algebra: Results and open questions (2005)

Cached

Download Links

by Luca Aceto , Wan Fokkink , Anna Ingolfsdottir , Bas Luttik
Venue:Processes, Terms and Cycles: Steps on the Road to Infinity, LNCS 3838
Citations:29 - 19 self

Documents Related by Co-Citation

3219 Communication and Concurrency – R Milner - 1990
53 Axioms for concurrency – F Moller - 1989
364 Process algebra for synchronous communication – J. A. Bergstra, J. W. Klop - 1984
20 CCS with Hennessy’s merge has no finite equational axiomatization – Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik - 2005
89 Turning SOS Rules into Equations – Luca Aceto, Bard Bloom, Frits Vaandrager - 1994
658 Concurrency and automata on infinite sequences – D Park - 1981
3407 Communicating Sequential Processes – C. A. R. Hoare - 2004
10 A finite equational base for CCS with left merge and communication merge – Luca Aceto, Wan Fokkink, Anna Ingolfsdottir, Bas Luttik - 2006
495 Algebraic laws for nondeterminism and concurrency – Matthew Hennessy, Robin Milner - 1985
15 On the axiomatizability of priority – Luca Aceto, Taolue Chen, Wan Fokkink, Anna Ingolfsdottir - 2006
196 Bisimulation can’t be traced – B Bloom, S Istrail, A R Meyer - 1995
33 The importance of the left merge operator in process algebras – F Moller - 1990
11 Bisimilarity is not Finitely Based over BPA with Interrupt – Luca Aceto, Willem Jan Fokkink, Anna Ingólfsdóttir, Sumit Nain - 2005
1290 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
94 The Linear Time-Branching Time Spectrum I - The Semantics of Concrete, Sequential Processes – R.J. van Glabbeek
63 Higher-level synchronising devices in Meije–SCCS. Theoretical Computer Science 37(3), pp. 245–267. A Modal Characterisation of η-Bisimulation We prove the first part of Thm. 2.5, which states that η is a modal characterisation of η-bisimulation equivalenc – Robert De Simone, Communicated M. Nivat - 1985
16 The nonexistence of finite axiomatisations for CCS congruences – F Moller - 1990
15 Nested Semantics over Finite Trees are Equationally Hard – Luca Aceto, Wan Fokkink, Rob van Glabbeek, Anna Ingolfsdottir - 2003
9 On finite alphabets and infinite bases – T Chen, W Fokkink, B Luttik, S Nain