Add to ORKGAbstract. The article summarizes the results of the author in the area of automated verification of systems and concurrency theory. These results are concerning the computational complexity of equivalence checking problems. The main aim of the paper is to present intuitive nonformal overview of these results
The paper presents a selection of recently developed and/or used techniques for equivalence-checking...
We study the relative complexity of equivalence relations and preorders from computability theory a...
AbstractThe complexity of the equivalence problem for several classes of simple programs with a fixe...
Equivalence checking plays a crucial role in formal verification since it is a natural relation for ...
Import 20/04/2006Prezenční výpůjčkaVŠB - Technická univerzita Ostrava. Fakulta elektrotechniky a inf...
Computational complexity of comparing behaviours of systems composed from interacting finite-state c...
International audienceEquivalence checking is a formal verification approach that consists in provin...
The paper presents an overview of techniques and results for equivalence-checking with infinite-stat...
AbstractIn implementation verification, we check that an implementation is correct with respect to a...
Abstract. Checking language equivalence (or inclusion) of finite au-tomata is a classical problem in...
A short version of this report was published at SPIN'2008.Equivalence checking is a classical verifi...
Equivalence relations are criteria for comparing the behavior of systems. They have important applic...
International audienceChecking language equivalence (or inclusion) of finite automata is a classical...
Equivalence checking plays a crucial role in formal verification to ensure the correctness of concur...
Checking language equivalence (or inclusion) of finite automata is a classical problem in Computer S...
The paper presents a selection of recently developed and/or used techniques for equivalence-checking...
We study the relative complexity of equivalence relations and preorders from computability theory a...
AbstractThe complexity of the equivalence problem for several classes of simple programs with a fixe...
Equivalence checking plays a crucial role in formal verification since it is a natural relation for ...
Import 20/04/2006Prezenční výpůjčkaVŠB - Technická univerzita Ostrava. Fakulta elektrotechniky a inf...
Computational complexity of comparing behaviours of systems composed from interacting finite-state c...
International audienceEquivalence checking is a formal verification approach that consists in provin...
The paper presents an overview of techniques and results for equivalence-checking with infinite-stat...
AbstractIn implementation verification, we check that an implementation is correct with respect to a...
Abstract. Checking language equivalence (or inclusion) of finite au-tomata is a classical problem in...
A short version of this report was published at SPIN'2008.Equivalence checking is a classical verifi...
Equivalence relations are criteria for comparing the behavior of systems. They have important applic...
International audienceChecking language equivalence (or inclusion) of finite automata is a classical...
Equivalence checking plays a crucial role in formal verification to ensure the correctness of concur...
Checking language equivalence (or inclusion) of finite automata is a classical problem in Computer S...
The paper presents a selection of recently developed and/or used techniques for equivalence-checking...
We study the relative complexity of equivalence relations and preorders from computability theory a...
AbstractThe complexity of the equivalence problem for several classes of simple programs with a fixe...