On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
Process algebra
A short proof of the decidability of bisimulation for normed BPA-processes
Information Processing Letters
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Deciding bisimilarity of normed context-free processes is in &Sgr; p2
Theoretical Computer Science
Characteristic formulae for processes with divergence
Information and Computation
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Bisimulation equivalence is decidable for all context-free processes
Information and Computation
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Decidability of bisimulation equivalence for normed pushdown processes
Theoretical Computer Science
Information and Computation - Special issue on EXPRESS 1997
Model checking
Decidability of bisimilarity for one-counter processes
Information and Computation
Regularity of normed PA processes
Information Processing Letters
Effective decomposability of sequential behaviours
Theoretical Computer Science
L(A) = L(B)? decidability results from complete formal systems
Theoretical Computer Science
Decidability of model checking with the temporal logic EF
Theoretical Computer Science
Deciding bisimulation-like equivalences with finite-state processes
Theoretical Computer Science
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Modal and temporal properties of processes
Modal and temporal properties of processes
Communication and Concurrency
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
Simulation preorder over simple process algebras
Information and Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Deciding DPDA Equivalence Is Primitive Recursive
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Deciding Finiteness of Petri Nets Up To Bisimulation
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
High Undecidability of Weak Bisimilarity for Petri Nets
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Simulation Is Decidable for One-Counter Nets (Extended Abstract)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Undecidability of Weak Bisimilarity for Pushdown Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Why Is Simulation Harder than Bisimulation?
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Checking Regular Properties of Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Bisimulation Collapse and the Process Taxonomy
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Weak Bisimulation and Model Checking for Basic Parallel Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Simulation Problems for One-Counter Machines
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Petri Nets and the Equivalence Problem
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Complexity of weak bisimilarity and regularity for BPA and BPP
Mathematical Structures in Computer Science
DP Lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
Theoretical Computer Science - Expressiveness in concurrency
Undecidability of weak bisimilarity for PA-processes
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Undecidability of weak bisimulation equivalence for 1-counter processes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A general approach to comparing infinite-state systems with their finite-state specifications
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Correcting a Space-Efficient Simulation Algorithm
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Information and Computation
Reachability games on extended vector addition systems with states
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On the expressiveness and decidability of higher-order process calculi
Information and Computation
Hardness of preorder checking for basic formalisms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Hardness of preorder checking for basic formalisms
Theoretical Computer Science
Decidability of behavioral equivalences in process calculi with name scoping
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Saving Space in a Time Efficient Simulation Algorithm
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
BPA bisimilarity is EXPTIME-hard
Information Processing Letters
Bisimilarity of Pushdown Automata is Nonelementary
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The paper presents a selection of recently developed and/or used techniques for equivalence-checking on infinite-state systems, and an up-to-date overview of existing results (as of September 2004).