نتایج جستجو برای: discrete event systems
تعداد نتایج: 1482433 فیلتر نتایج به سال:
In recent years, formal methods have been used as an important tool for performance evaluation and verification of a wide range of systems. In the view points of engineers and practitioners, however, there are still some major difficulties in using formal methods. In this paper, we introduce a new formal modeling language to fill the gaps between object-oriented programming languages (OOPLs) us...
We study the problem of synthesising controllers for discrete event systems. Traditionally this problem is tackled in a linear time setting. Moreover, the desired subset of the computations of the uncontrolled system (often called a plant) is speciied by automata theoretic means. Here we formulate the problem in a branching time framework. We use a class of labelled transition systems to model ...
In many application domains events are not Poisson distributed. For some applications it even makes sense to (more or less) assume that events are distributed in the worst possible way (e.g. in networks, packets often arrive in bursts). In this Section we study systems from a worst-case perspective. In particular, we analyze the price of not being able to foresee the future. This is a phenomeno...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید