On the Complexity of Deciding Behavioural Equivalences and Preorders
暂无分享,去创建一个
[1] Jan A. Bergstra,et al. Readies and Failures in the Algebra of Communicating Processes , 1988, SIAM J. Comput..
[2] Jan Friso Groote,et al. Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..
[3] Emily P. Friedman. The Inclusion Problem for Simple Languages , 1976, Theor. Comput. Sci..
[4] Colin Stirling,et al. Modal and Temporal Logics for Processes , 1996, Banff Higher Order Workshop.
[5] Jeffrey D. Ullman,et al. Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.
[6] Sandeep K. Shukla,et al. HORNSAT, Model Checking, Verification and games (Extended Abstract) , 1996, CAV.
[7] Jan Friso Groote,et al. Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..
[8] Giuseppe F. Italiano,et al. On-Line Algorithms for Polynomially Solvable Satisfiability Problems , 1991, J. Log. Program..
[9] Hans Hu¨ttel,et al. Decidability, behavioural equivalences and infinite transition graphs , 1991 .
[10] José L. Balcázar,et al. Parallel Complexity in the Design and Analysis on Conurrent Systems , 1991, PARLE.
[11] Albert R. Meyer,et al. Bisimulation can't be traced , 1988, POPL '88.
[12] Robin Milner,et al. A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..
[13] Kim G. Larsen,et al. Efficient Local Correctness Checking , 1992, CAV.
[14] G. Brodal,et al. Optimal Purely Functional Priority Queues , 1996 .
[15] Josva Kleist,et al. Objects as Mobile Processes , 1996 .
[16] David Walker,et al. Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..
[17] Luca Aceto,et al. On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely Based , 1998, Theor. Comput. Sci..
[18] Jeffrey Shallit,et al. The Computational Complexity of Some Problems of Linear Algebra , 1996 .
[19] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[20] Faron Moller,et al. A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes , 1994, Mathematical Structures in Computer Science.
[21] R. J. vanGlabbeek. The linear time - branching time spectrum , 1990 .
[22] Jan A. Bergstra,et al. Decidability of bisimulation equivalence for process generating context-free languages , 1987, JACM.
[23] Laurent Mounier,et al. "On the Fly" Verification of Behavioural Equivalences and Preorders , 1991, CAV.
[24] Didier Caucal,et al. Graphes canoniques de graphes algébriques , 1990, RAIRO Theor. Informatics Appl..
[25] John E. Hopcroft,et al. Simple Deterministic Languages , 1966, SWAT.
[26] Ian Stark. Names, Equations, Relations: Practical Ways to Reason about new , 1997, TLCA.
[27] Kim G. Larsen,et al. Bisimulation through Probabilistic Testing , 1991, Inf. Comput..
[28] Didier Caucal. A Fast Algorithm to Decide on Simple Grammars Equivalence , 1989, Optimal Algorithms.
[29] Luca Aceto,et al. On a Question of Arto Salomaa: The Equational Theory of Regular Expressions over a Singleton Alphabet is not Finitely Based , 1996 .
[30] Dexter Kozen,et al. RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .
[31] Scott A. Smolka,et al. Incremental Model Checking in the Modal Mu-Calculus , 1994, CAV.
[32] Bernhard Steffen,et al. An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes , 1995, MFCS.
[33] Scott A. Smolka,et al. CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.
[34] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..
[35] Hans Hüttel,et al. Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes , 1998, J. Log. Comput..
[36] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..
[37] Jan Friso Groote,et al. A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes , 1992, Inf. Process. Lett..
[38] Faron Moller,et al. Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.
[39] Joost Engelfriet,et al. Determinacy - (Observation Equivalence = Trace Equivalence) , 1985, Theor. Comput. Sci..
[40] Samson Abramsky,et al. Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..
[41] Hans Hüttel,et al. Actions speak louder than words: proving bisimilarity for context-free processes , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.
[42] Rob J. van Glabbeek,et al. The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.
[43] Rance Cleaveland,et al. A linear-time model-checking algorithm for the alternation-free modal mu-calculus , 1993, Formal Methods Syst. Des..
[44] Rob J. van Glabbeek,et al. The Linear Time - Branching Time Spectrum II , 1993, CONCUR.
[45] Rance Cleaveland,et al. Computing Behavioural Relations, Logically , 1991, ICALP.
[46] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[47] Jan Friso Groote,et al. Structural Operational Semantics and Bisimulation as a Congruence (Extended Abstract) , 1989, ICALP.
[48] Stephen D. Brookes,et al. Possible futures, acceptances, refusals, and communicating processes , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[49] Kim G. Larsen,et al. Proof System for Hennessy-Milner Logic with Recursion , 1988, CAAP.
[50] Matthew Hennessy,et al. Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.
[51] Faron Moller,et al. A polynomial-time algorithm for deciding equivalence of normed context-free processes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[52] Lu Tian,et al. On Deciding Readiness and Failure Equivalences for Processes , 1995, Inf. Comput..
[53] Peter Bro Miltersen,et al. Fusion Trees can be Implemented with AC0 Instructions only , 1996 .
[54] Robin Milner,et al. Algebraic laws for nondeterminism and concurrency , 1985, JACM.
[55] C. A. R. Hoare,et al. A Theory of Communicating Sequential Processes , 1984, JACM.
[56] Olivier Danvy,et al. A Computational Formalization for Partial Evaluation (Extended Version) , 1996 .
[57] Ian Stark. Names, Equations, Relations: Practical Ways to Reason about 'new' , 1996 .
[58] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.
[59] Lu Tian,et al. On Deciding some Equivalences for Concurrent Processes , 1994, RAIRO Theor. Informatics Appl..
[60] Jeffrey D. Ullman,et al. Principles Of Database And Knowledge-Base Systems , 1979 .
[61] Thomas A. Henzinger,et al. Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[62] Scott A. Smolka,et al. CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.
[63] Faron Moller,et al. Decidability Results in Automata and Process Theory , 1996, Banff Higher Order Workshop.
[64] Søren Christensen. Decidability and decomposition in process algebras , 1993 .
[65] Jan Friso Groote,et al. Undecidable Equivalences for Basic Process Algebra , 1994, Inf. Comput..
[66] Sandeep K. Shukla,et al. On the Complexity of Relational Problems for Finite State Processes (Extended Abstract) , 1996, ICALP.
[67] Sérgio Vale Aguiar Campos,et al. Symbolic Model Checking , 1993, CAV.
[68] Iain Phillips,et al. Refusal Testing , 1986, Theoretical Computer Science.
[69] Henrik Reif Andersen. Model Checking and Boolean Graphs , 1992, ESOP.
[70] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[71] D. J. Walker,et al. Bisimulation and Divergence , 1990, Inf. Comput..
[72] Jan A. Bergstra,et al. Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages , 1987, PARLE.
[73] Bard Bloom,et al. Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation Problem , 1995, Sci. Comput. Program..
[74] H. James Hoover,et al. Limits to Parallel Computation: P-Completeness Theory , 1995 .
[75] Faron Moller,et al. On the computational complexity of bisimulation , 1995, CSUR.
[76] Colin Stirling,et al. Modal Logics for Communicating Systems , 1987, Theor. Comput. Sci..
[77] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[78] Jan A. Bergstra,et al. Process Algebra for Synchronous Communication , 1984, Inf. Control..
[79] P. S. Thiagarajan,et al. Regular Trace Event Structures , 1996 .
[80] Robert E. Tarjan,et al. Three Partition Refinement Algorithms , 1987, SIAM J. Comput..
[81] Glynn Winskel,et al. Presheaf Models for Concurrency , 1996, CSL.