21 search results - page 1 / 5 » Equivalence Checking for Infinite Systems Using Parameterize... |
CONCUR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
MEMOCODE
2008
IEEE
15 years 3 months ago
2008
IEEE
Equivalence checking is a classical verification method determining if a finite-state concurrent system (protocol) satisfies its desired external behaviour (service) by compari...
104
click to vote
WLP
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
LPAR
2010
Springer
14 years 7 months ago
2010
Springer
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reas...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...