A key advantage of the Möbius modeling environment is the ease with which one can incorporate new modeling formalisms, model composition and connection methods, and model solution methods. In this paper, we describe a new state-level abstract functional interface (AFI) for Möbius that allows numerical solution methods to communicate with Möbius state-level models via the abstraction of a labele...

Finite Element Methods (FEM) play an important role in modelling of complex systems. Models generated from FEM are of very high dimension and are difficult to handle for control system design. In this paper, an algorithm is presented that converts a system generated from FEM into the state space model of an interconnected system, thus vastly reducing the complexity of synthesizing a distributed...

A classical planning problem is the problem of computing a sequence of actions that transforms one state of the world into the desired. Traditional planners cast planning as a "split & prune" type search. These are called "refinement planners" since they start with a null plan and refine it by adding constraints. It has been shown recently that planning problems are far easier to solve when the...

in this paper, using the tight-binding model, we extend the real-space renormalization group method to time-dependent hamiltonians. we drive the time-dependent recursion relations for the renormalized tight-binding hamiltonian by decimating selective sites of lattice iteratively. the formalism is then used for the calculation of the local density of electronic states for a one dimensional quant...

Insight in the global structure of a state space is of great help in the analysis of the underlying process. We advocate the use of visualization for this purpose and present a new method to visualize the structure of very large state spaces. The method uses a clustering method to obtain a simplified representation, which is used as a backbone for the display of the entire state space. With thi...

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...