Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Characteristic formulae for processes with divergence
Information and Computation
Three logics for branching bisimulation
Journal of the ACM (JACM)
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
On Communicating Finite-State Machines
Journal of the ACM (JACM)
On finite representations of infinite-state behaviours
Information Processing Letters
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
L(A) = L(B)? decidability results from complete formal systems
Theoretical Computer Science
Well-structured transition systems everywhere!
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
The regular viewpoint on PA-processes
Theoretical Computer Science
Impossible futures and determinism
Information Processing Letters
Communication and Concurrency
Simulation preorder over simple process algebras
Information and Computation
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
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
Another Look at Abstraction in Process Algebra (Extended Abstract)
ICALP '87 Proceedings of the 14th International Colloquium, on Automata, Languages and Programming
The Complete Axiomatization of Cs-congruence
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Multiway Synchrinizaton Verified with Coupled Simulation
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Model checking lossy vector addition systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Lossy counter machines decidability cheat sheet
RP'10 Proceedings of the 4th international conference on Reachability problems
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
| Hi-index | 0.00 |
We introduce a generic family of behavioral relations for which the regular equivalence problem (i.e., comparing an arbitrary transition system to some finite-state specification) can be reduced to the model checking problem against simple modal formulae. As an application, we derive decidability of several regular equivalence problems for well-known families of infinite-state systems.