Brno University of Technology

About: Brno University of Technology is a education organization based out in Brno, Czechia. It is known for research contribution in the topics: Fracture mechanics & Filter (video). The organization has 6339 authors who have published 15226 publications receiving 194088 citations. The organization is also known as: Vysoké učení technické v Brně & BUT.

Solving Civil Engineering Problems by Means of Fuzzy and Stochastic MCDM Methods: Current State and Future Research

Abstract: The present review examines decision-making methods developed for dealing with uncertainties and applied to solve problems of civil engineering. Several methodological difficulties emerging from uncertainty quantification in decision-making are identified. The review is focused on formal methods of multiple criteria decision-making (MCDM). Handling of uncertainty by means of fuzzy logic and probabilistic modelling is analysed in light of MCDM. A sensitivity analysis of MCDM problems with uncertainties is discussed. An application of stochastic MCDM methods to a design of safety critical objects of civil engineering is considered. Prospects of using MCDM under uncertainty in developing areas of civil engineering are discussed in brief. These areas are design of sustainable and energy efficient buildings, building information modelling, and assurance of security and safety of built property. It is stated that before long the decision-making in civil engineering may face several methodological problems: the need to combine fuzzy and probabilistic representations of uncertainties in one decision-making matrix, the necessity to extend a global sensitivity analysis to all input elements of a MCDM problem with uncertainties, and an application of MCDM methods in the areas of civil engineering where decision-making under uncertainty is presently not common.

When simulation meets antichains: on checking language inclusion of nondeterministic finite (tree) automata

Abstract: We describe a new and more efficient algorithm for checking universality and language inclusion on nondeterministic finite word automata (NFA) and tree automata (TA). To the best of our knowledge, the antichain-based approach proposed by De Wulf et al. was the most efficient one so far. Our idea is to exploit a simulation relation on the states of finite automata to accelerate the antichain-based algorithms. Normally, a simulation relation can be obtained fairly efficiently, and it can help the antichain-based approach to prune out a large portion of unnecessary search paths. We evaluate the performance of our new method on NFA/TA obtained from random regular expressions and from the intermediate steps of regular model checking. The results show that our approach significantly outperforms the previous antichain-based approach in most of the experiments.