Sciweavers

288 search results - page 39 / 58
» An algebraic generalization of Kripke structures
Sort
View
DDECS
2006
IEEE
88views Hardware» more  DDECS 2006»
14 years 1 months ago
Minimization of Large State Spaces using Symbolic Branching Bisimulation
Abstract: Bisimulations in general are a powerful concept to minimize large finite state systems regarding some well-defined observational behavior. In contrast to strong bisimul...
Ralf Wimmer, Marc Herbstritt, Bernd Becker
MFCS
2005
Springer
14 years 1 months ago
Regular Sets of Higher-Order Pushdown Stacks
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
Arnaud Carayol
FSE
2004
Springer
84views Cryptology» more  FSE 2004»
14 years 1 months ago
Vulnerability of Nonlinear Filter Generators Based on Linear Finite State Machines
We present a realization of an LFSM that utilizes an LFSR. This is based on a well-known fact from linear algebra. This structure is used to show that a previous attempt at using a...
Jin Hong, Dong Hoon Lee 0002, Seongtaek Chee, Pala...
HYBRID
2004
Springer
14 years 1 months ago
Bisimulation of Dynamical Systems
A general notion of bisimulation is studied for dynamical systems. An algebraic characterization of bisimulation together with an algorithm for computing the maximal bisimulation r...
A. J. van der Schaft
MPC
2004
Springer
155views Mathematics» more  MPC 2004»
14 years 1 months ago
Inferring Type Isomorphisms Generically
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
Frank Atanassow, Johan Jeuring