Results 1  10
of
195,050
Finitestate Systems
, 2012
"... Abstract. We study the succinctness of different classes of succinctly presented finite transition systems with respect to bisimulation equivalence. Our results show that synchronized product of finite automata, hierarchical graphs, and timed automata are pairwise incomparable in this sense. We more ..."
Abstract
 Add to MetaCart
Abstract. We study the succinctness of different classes of succinctly presented finite transition systems with respect to bisimulation equivalence. Our results show that synchronized product of finite automata, hierarchical graphs, and timed automata are pairwise incomparable in this sense. We
Compositional Minimization of Finite State Systems
 IN PROC. 2ND INTERNATIONAL CONFERENCE OF COMPUTERAIDED VERIFICATION
, 1991
"... In this paper we develop a compositional method for the construction of the minimal transition system that represents the semantics of a given reactive system. The point of this method is that it exploits structural properties of the reactive system in order to avoid the consideration of large inter ..."
Abstract

Cited by 41 (0 self)
 Add to MetaCart
In this paper we develop a compositional method for the construction of the minimal transition system that represents the semantics of a given reactive system. The point of this method is that it exploits structural properties of the reactive system in order to avoid the consideration of large
An Improved Algorithm for the Automatic Verification of Finite State Systems Using Temporal Logic
 In Proceedings of the Symposium on Logic in Computer Science
, 1986
"... An improved algorithm for the automatic verification of finite state systems using temporal logic ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
An improved algorithm for the automatic verification of finite state systems using temporal logic
Equivalences within NonFinite State Systems
 Proceedings of 5th IFIP Workshop on Performance Modelling and Evaluation of ATM Networks
, 1997
"... In this paper, we discuss the issues associated with proving complete equivalences within NonFinite 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 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper, we discuss the issues associated with proving complete equivalences within NonFinite 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
Equivalences within NonFinite State Systems
 Proceedings of 5th IFIP Workshop on Performance Modelling and Evaluation of ATM Networks
, 1997
"... In this paper, we discuss the issues associated with proving complete equivalences within NonFinite 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 ..."
Abstract
 Add to MetaCart
In this paper, we discuss the issues associated with proving complete equivalences within NonFinite 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
Finite State Systems in Mobile Communications
, 1996
"... Contents Table of Abbreviations x Glossary xi Summary xvi Declaration xvii Acknowledgement xviii 1 Introduction 1 1.1 Digital Communication and Error Control Coding : : : : : : : : : : : : : : : : : 1 1.2 Trellis Coding : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 1. ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
.3 Performance Estimation for Trellis Codes : : : : : : : : : : : : : : : : : : : : : : 4 1.4 Overview of the Thesis : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2 System Models and Basics 7 2.1 Trellis Codes : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 8 2
Bisimilarity of Processes with Finitestate Systems
 ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
, 1997
"... We describe a general method for deciding bisimilarity for pairs of processes where one process has finitely many states. We apply this method to pushdown processes and to PA processes. We also demonstrate that the mentioned problem is undecidable for `stateextended' PA processes. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We describe a general method for deciding bisimilarity for pairs of processes where one process has finitely many states. We apply this method to pushdown processes and to PA processes. We also demonstrate that the mentioned problem is undecidable for `stateextended' PA processes.
Fault Diagnosis for Finite State Systems
"... a a b ε b • ε ◮ A finite automaton A over Σε,f = Σ ∪ {ε, f} ◮ f is the fault action, Σ is the set of observable events ◮ kfaulty run contain f followed by more than k actions Faulty≥k (A) ◮ Non faulty run: contains no f NonFaulty(A) ..."
Abstract
 Add to MetaCart
a a b ε b • ε ◮ A finite automaton A over Σε,f = Σ ∪ {ε, f} ◮ f is the fault action, Σ is the set of observable events ◮ kfaulty run contain f followed by more than k actions Faulty≥k (A) ◮ Non faulty run: contains no f NonFaulty(A)
Checking Unwinding Conditions for Finite State Systems
"... Abstract. We consider the problem of checking the unwinding conditions of Mantel for Basic Security Predicates (BSP’s) [7], for finitestate systems. We show how the unwinding conditions can be simplified to checking conditions on a maximal simulation relation. We conclude that the time complexity o ..."
Abstract
 Add to MetaCart
Abstract. We consider the problem of checking the unwinding conditions of Mantel for Basic Security Predicates (BSP’s) [7], for finitestate systems. We show how the unwinding conditions can be simplified to checking conditions on a maximal simulation relation. We conclude that the time complexity
On Weak Equivalence of Linear Systems and Finite State Systems
"... ABSTRACT It is shown that finite state machines exist which are weakly equivalent to linear systems for some nontrivial definitions of weak equivalence. Two systems, one linear with state space R", the other with finite state spece, operate on the same stationary uncorrelated input sequence u. ..."
Abstract
 Add to MetaCart
ABSTRACT It is shown that finite state machines exist which are weakly equivalent to linear systems for some nontrivial definitions of weak equivalence. Two systems, one linear with state space R", the other with finite state spece, operate on the same stationary uncorrelated input sequence u
Results 1  10
of
195,050