The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The paper presents a framework for model-based testing of automotive distributed system and a method of automatic assignment of testing priorities used within the framework. The proposed method utilizes classifiers for automatic assignment of testing priorities to specific parts of the tested system. The paper also introduces a set of extraneous data accompanying the modeling language that are exploited...
We demonstrate the usefulness of adding delay to infinite games with quantitative winning conditions. In a delay game, one of the players may delay her moves to obtain a lookahead on her opponent's moves. We show that determining the winner of delay games with winning conditions given by parity automata with costs is EXPTIME-complete and that exponential bounded lookahead is both sufficient and in...
This paper deals with model checking problems with respect to LTL properties under fairness assumptions. We first present an efficient algorithm to deal with a fragment of fairness assumptions and then extend the algorithm to handle arbitrary ones. Notably, by making use of some syntactic transformations, our algorithm avoids constructing corresponding Büchi automata for the whole fairness assumptions,...
Many fatal accidents of safety critical reactive systems have occurred in unexpected situations which had not been considered during the design and test phases of the systems. To prevent these accidents, reactive systems should be designed to respond appropriately to any requests of any timing from environments. Verifying this property at specification phase reduces the development costs of safety...
Control of timed systems has become a very active research area. In this paper, we revisit the complexity of safety and reachability control problems for timed automata. Generally, these problems turn out to be exptime-complete and we aim at finding tractable subclasses which admit efficient control. To this purpose, we consider the control for timed automata with a small number of clocks. We first...
The continuous run-time monitoring of the behavior of a system is a technique that is used both as a complementary approach to formal verification and testing to ensure reliability, as well as a means to discover emergent properties in a distributed system, like intrusion and event correlation. The monitors in all these scenarios can be abstractly viewed as automata that process a (unbounded) stream...
This paper introduces a new (t, n) secret sharing scheme for image encryption. The proposed method encrypts the secret image into two images as the same size of the original image, which one is the public image (called the encrypted image) and another is to be shared among n participants using a new secret sharing method based on the Shamir’s secret sharing. In the new secret sharing scheme, t (or...
The bugbear of model checking is the explosion in the number of states as the number of processes increases. Industrial-sized problems are often intractable for model checkers. We modify the most popular model checker in use today, SPIN, by replacing its internal verification search engine by a guided, random-walk based simulator. The resulting tool is called RANSPIN. The guiding mechanism used in...
Systems verification requires first to model the system to be verified, then to formalize the properties to be satisfied, and finally to describe the behaviour of the environment. This last point, known as the proof context, is often neglected. It could, however, be of great importance in order to reduce the complexity of the proof. The question is then how to formalize such a proof context. This...
Modular supervisory control of discrete-event systems, where the overall system is a synchronous (parallel) product of subsystems, is considered. The main results of this paper are formulations of sufficient conditions for the compatibility between the synchronous product and various operations stemming from supervisory control as supervised product and supremal controllable sublanguages. These results...
Ramadge and Wonham [1] gave algorithms for finding controllers in their supervisory control framework. Their automatic synthesis techniques are implemented here using binary decision diagrams [2]. This technique of symbolic representation capitalizes on loose coupling between controlled plant components. We are able to synthesize a controller for a wafer-manufacturing plant, for which an explicit...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.