In this paper, we discuss the issues associated with proving complete equivalences within Non-Finite State Systems. The various forms of equivalence that can exist between two algebraically defined systems can be intractable to demonstrate if the systems have infinite state order. This problem leads us to outline the following approach for enabling us to talk about, albeit weaker, approximations of equivalence for infinite systems: The definition of successive finite approximations to equivalences, allows for the construction of simulation tools, which can provide meaningful analysis for Non-Finite State Systems (NFSS) as well as the more usual Finite State Systems. The introduction of this extra variant form of equivalence leads to a discu...
AbstractWe consider the problem of simulation preorder/equivalence between infinite-state processes ...
We consider the problem of simulation preorder/equivalence between infinite-state processes and fini...
We study the complexity of comparing pushdown automata (PDA) and context-free processes (BPA) to fi...
AbstractWe introduce a generic family of behavioral relations for which the regular equivalence prob...
The paper presents an overview of techniques and results for equivalence-checking with infinite-stat...
The paper presents a selection of recently developed and/or used techniques for equivalence-checking...
Abstract. We introduce a generic family of behavioral relations for which the problem of comparing a...
This paper provides a comprehensive summary of equivalence checking results for infinite-state syste...
This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a th...
. We consider the problem of simulation preorder/equivalence between infinite-state processes and fi...
AbstractWe introduce a generic family of behavioral relations for which the regular equivalence prob...
We present a uniform approach for proving the polynomial time decidability of various simulation and...
Abstract. We examine the problem of finite-state representability of infinitestate processes w.r.t. ...
AbstractWe examine the computational complexity of testing finite state processes for equivalence in...
Computational complexity of comparing behaviours of systems composed from interacting finite-state c...
AbstractWe consider the problem of simulation preorder/equivalence between infinite-state processes ...
We consider the problem of simulation preorder/equivalence between infinite-state processes and fini...
We study the complexity of comparing pushdown automata (PDA) and context-free processes (BPA) to fi...
AbstractWe introduce a generic family of behavioral relations for which the regular equivalence prob...
The paper presents an overview of techniques and results for equivalence-checking with infinite-stat...
The paper presents a selection of recently developed and/or used techniques for equivalence-checking...
Abstract. We introduce a generic family of behavioral relations for which the problem of comparing a...
This paper provides a comprehensive summary of equivalence checking results for infinite-state syste...
This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a th...
. We consider the problem of simulation preorder/equivalence between infinite-state processes and fi...
AbstractWe introduce a generic family of behavioral relations for which the regular equivalence prob...
We present a uniform approach for proving the polynomial time decidability of various simulation and...
Abstract. We examine the problem of finite-state representability of infinitestate processes w.r.t. ...
AbstractWe examine the computational complexity of testing finite state processes for equivalence in...
Computational complexity of comparing behaviours of systems composed from interacting finite-state c...
AbstractWe consider the problem of simulation preorder/equivalence between infinite-state processes ...
We consider the problem of simulation preorder/equivalence between infinite-state processes and fini...
We study the complexity of comparing pushdown automata (PDA) and context-free processes (BPA) to fi...