is a scientific institution which works independently of economic, political and sectional interests. It conducts theoretical and empirical research in management and economic sciences, including selected related disciplines. The Institute encourages and assists in the publication and distribution of its research findings and is also involved in the doctoral education at the Stockholm School of...

Underspecification, which is essential for specification formalisms, is usually expressed by equivalences, simulations, or logic approaches. We introduce underspecified transition systems (UTSs) as general model general model for underspecification, where, e.g., transitions point to sets of states. We argue for the generality of the UTSs by showing that the class of all UTSs is strictly more ex...

Markov Decision Processes (MDPs) are a formulation for optimization problems in sequential decision making. Solving MDPs often requires implementing a simulator for optimization algorithms to invoke when updating decision making rules known as policies. The combination of simulator and optimizer are subject to failures of specification, implementation, integration, and optimization that may pro...

A growing number of safety-critical systems is controlled by computer systems. Currently these systems are often built from scratch. The Zerberus System assists the developer in the design and implementation process. Main features of the Zerberus System are generality, dependability, real-time predictability, the ability to be certified and costefficiency. The main concept of the Zerberus Syste...

The necessity of verification tools for Knowledge Based-Systems (KBSs), that help to guarantee a certain degree of quality and reliability of these systems will increase in the future when more critical systems are developed in areas such as industry, science, business, etc. One of the objectives of the KBSs verification is to assure the consistency and completeness of the Knowledge Base (KB). ...

A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene’s theorem and Kleene algebra, were recently proposed by a subset of the authors of this paper. Examples of the systems covered include infinite streams, deterministic automata, Mealy machines and labelled transition systems. In this paper, we present a novel algorithm to dec...

Partial functions are common abstractions in formal specification notations such as Z, B and Alloy. Conversely, executable programming languages usually provide little or no support for them. In this paper we propose to add partial functions as a primitive feature to a Constraint Logic Programming (CLP) language, namely {log}. Although partial functions could be programmed on top of {log}, prov...

In Dafny, the program text is used to both specify and implement programs in the same language [24]. It then uses a fully automated theorem prover to verify that the implementation satisfies the specification. However, the prover often needs further guidance from the user, and another role of the language is to provide such necessary hints and guidance. In this paper, we present a set of verifi...

MFDM [1, 3, 5, 16, 17] is the oldest and one of the most effective Meshless Methods [4, 6, 7]. Its current outlines, including the basic MFDM procedure, its various extensions and selected applications, demonstrating power, generality and versatility of the method competitive to main contemporary solution methods are briefly considered here. The MFDM may be applied in all formulations (strong, ...

Current research in mixed-criticality systems assumes that any task of lower criticality levels can be dropped at anytime in order to guarantee the schedulability of tasks of higher criticality levels. However, in an industrial mixedcriticality system, tasks may interfere with each other only under certain scenarios. Currently a designer does not have any means to specify or control this. The p...