Nonaxiomatisability of Equivalences over Finite State Processes
暂无分享,去创建一个
[1] Alexander Moshe Rabinovich. A Complete Axiomatisation for Trace Congruence of Finite State Behaviors , 1993, MFPS.
[2] Maurice Boffa,et al. Une remarque sur les systèmes complets d'identités rationnelles , 1990, RAIRO Theor. Informatics Appl..
[3] Z. Ésik,et al. Iteration Theories: The Equational Logic of Iterative Processes , 1993 .
[4] Robin Milner,et al. A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors , 1989, Inf. Comput..
[5] Faron Moller,et al. Axioms for concurrency , 1989 .
[6] Daniel Krob,et al. Complete Systems of B-Rational Identities , 1991, Theor. Comput. Sci..
[7] Jan A. Bergstra,et al. Process Algebra with Iteration and Nesting , 1994, Comput. J..
[8] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[9] Peter Sewell. Bisimulation is not finitely (first order) equationally axiomatisable , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.
[10] Arto Salomaa,et al. Two Complete Axiom Systems for the Algebra of Regular Events , 1966, JACM.
[11] Rob J. van Glabbeek,et al. A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours , 1993, MFCS.
[12] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[13] J. Conway. Regular algebra and finite machines , 1971 .
[14] S C Kleene,et al. Representation of Events in Nerve Nets and Finite Automata , 1951 .
[15] Luca Aceto,et al. Axiomatizing Prefix Iteration with Silent Steps , 1995 .
[16] Davide Sangiorgi,et al. Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .
[17] Rob J. van Glabbeek,et al. The Linear Time-Branching Time Spectrum (Extended Abstract) , 1990, CONCUR.
[18] Luca Aceto,et al. A Menagerie of Non-Finitely Based Process Semantics over BPA*: From Ready Simulation Semantics to Completed Traces , 1996 .
[19] Robin Milner,et al. A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..
[20] Wan Fokkink,et al. A Complete Equational Axiomatization for Prefix Iteration , 1994, Inf. Process. Lett..
[21] Luca Aceto,et al. A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces , 1998, Mathematical Structures in Computer Science.
[22] Zoltán Ésik,et al. Iteration Theories of Synchronization Trees , 1993, Inf. Comput..
[23] Peter Sewell,et al. The Algebra of Finite State Processes , 1995 .
[24] L. Aceto,et al. A Complete Equational Axiomatization for Prefix Iteration with Silent Steps , 1995 .
[25] Dexter Kozen. A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , 1994, Inf. Comput..
[26] Hans Zantema,et al. Basic Process Algebra with Iteration: Completeness of its Equational Axioms , 1993, Comput. J..
[27] Wan J. Fokkink. A complete equational axiomatisation for prefix iteration , 1994 .
[28] Zoltán Ésik,et al. Equational axioms for regular sets , 1993, Mathematical Structures in Computer Science.
[29] Flemming Nielson,et al. The Typed lambda-Calculus with First-Class Processes , 1989, PARLE.
[30] Calvin C. Elgot,et al. Realization of Events by Logical Nets , 1958, JACM.
[31] Jos L. M. Vrancken,et al. The Algebra of Communicating Processes With Empty Process , 1997, Theor. Comput. Sci..