State space generation is a technique often used in software verification. Unfortunately, state spaces of non-trivial systems are often huge. On-the-fly state space generation is a well-known technique which is able to manage larger state spaces than explicit in-memory representation. The drawback is the speed of the state space generation. This paper presents motivation and early ideas on merg...

Merge-and-shrink heuristics crucially rely on effective reduction techniques, such as bisimulation-based shrinking, to avoid the combinatorial explosion of abstractions. We propose the concept of factored symmetries for merge-andshrink abstractions based on the established concept of symmetry reduction for state-space search. We investigate under which conditions factored symmetry reduction yie...

Directed model checking is a well-established technique that is tailored to fast detection of system states that violate a given safety property. This is achieved by influencing the order in which states are explored during the state space traversal. The order is typically determined by an abstract distance function that estimates a state’s distance to a nearest error state. In this paper, we p...

In undergoing this life, many people always try to do and get the best. New knowledge, experience, lesson, and everything that can improve the life will be done. However, many people sometimes feel confused to get those things. Feeling the limited of experience and sources to be better is one of the lacks to own. However, there is a very simple thing that can be done. This is what your teacher ...

We describe a symbolic heap abstraction that unifies reasoning about arrays, pointers, and scalars, and we define a fluid update operation on this symbolic heap that relaxes the dichotomy between strong and weak updates. Our technique is fully automatic, does not suffer from the kind of state-space explosion problem partition-based approaches are prone to, and can naturally express properties t...

The correct implementation of the Durbin and Koopman simulation smoother is explained. A possible misunderstanding is pointed out and clarified for both the basic state space model and for its extension that allows time-varying intercepts (mean adjustments).

A state space representation of a (singular) AR-model is defined. It is shown, in particular, that this representation determines the model uniquely up to an isomorphism and respects its behavior. An explicit construction is presented for a ”standard” AR-model.

I construct a multi-agent state space model with unawareness following Aumann (1976). Dekel, Lipman and Rustichini (1998) show that standard state space models are incapable of representing unawareness. The model circumvents the impossibility result by endowing the agent a subjective state space that differs from the full state space when he has the unawareness problem. Information is modeled a...

Ab~tract-This paper presents a method to determine a nonlinear state space model from a 6nite number of measurements of the inputs and outputs. The method is based on embedding theory for nonlinear systems, and can be viewed as an extension of the subspace identification method for linear systems. The paper describes the underlying theory and provides some guidelines for using the method in pra...

the stability analysis of islanded inverter-based microgrids (ibmgs) is increasingly an important and challenging topic due to the nonlinearity of ibmgs. in this paper, a new linear model for such microgrids as well as an iterative method to correct the linear model is proposed. using the linear model makes it easy to analyze the eigenvalues and stability of ibmgs due to the fact that it derive...