The paper considers the problem of dynamic modeling of complex natural and technical objects. The objects that have hierarchical structure are in focus. It is proposed to use new multilevel relatively finite automata models as formal models of such objects. A new algorithm based on deductive synthesis that allows automatically build automata models is presented. Automata models and the algorithm are implemented in program system. A number of examples of building models in the domain of Internet of Things are given
In the work a description of an automata model of standard algorithm for constructing a correct solu...
This thesis describes a method for automatically generating theories in a first order logic with ari...
This paper proposes a general method to synthesize a least restrictive supervisor for a large discre...
The paper introduces a method for adaptive deductive synthesis of state models, of complex objects, ...
This paper introduces and discusses automata systems as a new way for formal languages processing. I...
This is the first book on automated model building, a discipline of automated deduction that is of g...
Abstract—Requirements modelling helps software engineers understand a system’s required behaviour an...
[[abstract]]A formal language system supporting general product machines is proposed in this paper. ...
[[abstract]]A formal language system supporting general product machines is proposed in t...
In this paper we introduce DEGAS (Dynamic Entities Get Autonomous Status), an active temporal data m...
Automatically generating a program from its specification eliminates a large source of errors that i...
This report documents the program and the outcomes of Dagstuhl Seminar 17201 "Formal Synthesis of Cy...
Several tools exist providing support for model-based design of supervisors in high-tech and cyber-p...
The Bachelor's Thesis introduces the theory of formal languages and finite automata. It describes ge...
In this paper we introduce Degas (Dynamic Entities Get Autonomous Status), an active temporal data m...
In the work a description of an automata model of standard algorithm for constructing a correct solu...
This thesis describes a method for automatically generating theories in a first order logic with ari...
This paper proposes a general method to synthesize a least restrictive supervisor for a large discre...
The paper introduces a method for adaptive deductive synthesis of state models, of complex objects, ...
This paper introduces and discusses automata systems as a new way for formal languages processing. I...
This is the first book on automated model building, a discipline of automated deduction that is of g...
Abstract—Requirements modelling helps software engineers understand a system’s required behaviour an...
[[abstract]]A formal language system supporting general product machines is proposed in this paper. ...
[[abstract]]A formal language system supporting general product machines is proposed in t...
In this paper we introduce DEGAS (Dynamic Entities Get Autonomous Status), an active temporal data m...
Automatically generating a program from its specification eliminates a large source of errors that i...
This report documents the program and the outcomes of Dagstuhl Seminar 17201 "Formal Synthesis of Cy...
Several tools exist providing support for model-based design of supervisors in high-tech and cyber-p...
The Bachelor's Thesis introduces the theory of formal languages and finite automata. It describes ge...
In this paper we introduce Degas (Dynamic Entities Get Autonomous Status), an active temporal data m...
In the work a description of an automata model of standard algorithm for constructing a correct solu...
This thesis describes a method for automatically generating theories in a first order logic with ari...
This paper proposes a general method to synthesize a least restrictive supervisor for a large discre...