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.
With the rapid advancement of autonomous driving and vehicular communication technology, intelligent intersection management has shown great promise in improving transportation efficiency. In a typical intelligent intersection, an intersection manager communicates with autonomous vehicles wirelessly and schedules their crossing of the intersection. Previous system designs, however, do not address...
Cyber Physical Systems are composition of physical processes and discrete computational elements. Modeling and verification of such systems require mechanisms that incorporate continuos behaviour for monitoring physical events and descrete behaviour for computational elements. Passage of time is a fundamental property to be modelled and hybrid systems incorporate this aspect directly in the automaton...
We present Neo, a framework for designing pre-verified protocol components that can be instantiated and connected in an arbitrarily large hierarchy (tree), with a guarantee that the whole system satisfies a given safety property. We employ the idea of network invariants to handle correctness for arbitrary depths in the hierarchy. Orthogonally, we leverage a parameterized model checker (Cubicle) to...
In this paper, we consider a binary parallel composition of FSMs (that are probably partial) and discuss how to check whether this composition is safe or not, i.e. in fact, we check whether there are no deadlocks and livelocks in the composition. We propose a technique for checking this property step-by-step: at the first step we analyze the components separately, at the second step we build the global...
This paper considers a team of cooperative, homogeneous robots operating in a nondeterministic environment, performing complex high-level tasks. We concurrently solve the problems of dynamic task assignment and reactive planning in a centralized fashion, allowing goal reassignment as needed in response to changes in the environment. To this end, we model the team of robots as a switched system whose...
The Small Aircraft Transportation System (SATS) protocol, developed at NASA, aims to increase air transportation access for smaller communities and improve the transportation of people, services, and goods by a more effective use of over 5,000 small public airports in the United States. By using model checking and I/O automata, a number of different groups have verified many of the operational properties...
With the development of Web Service composition, more and more diversified and complex business demands are satisfied. But the logical validity cannot be guaranteed. After a short view of recent research efforts of formal modeling and verification about Web Service, this paper proposes a new formal model for WS-BPEL described Web Service composition. The specification language of the model is LOTOS...
In this paper, we present the formal modeling and automatic parameterized verification of a distributed air traffic control protocol called the Small Aircraft Transportation System (SATS). Each aircraft is modeled as a timed automaton with (possibly unbounded) counters. SATS is then described as the composition of N such aircraft, where N is a parameter from the natural numbers. We verify several...
We propose a stateless packet filtering technique based on finite-state automata (FSA). FSAs provide a comprehensive framework with well-defined composition operations that enable the generation of stateless filters from high-level specifications and their compilation into efficient executable code without resorting to various opportunistic optimization algorithms. In contrast with most traditional...
Verification of real-time systems - e.g. communication protocols or embedded controllers - is an important task. One method to detect errors is called bounded model checking (BMC). In BMC the system is iteratively unfolded and then transformed into a satisfiability problem. If an appropriate solver finds the $k$-th instance to be satisfiable a counterexample for a given safety property has been found...
In this work, we present a results from case study on testing a highly configurable, safety-critical system from the railway domain using model-based risk-oriented testing. In the construction of the system and test models, we face the following problems: (i) A domain expert will usually not be knowledgeable in the construction of system models, but has very detailed knowledge which configurations...
In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. Based on the two experiences we evaluate the approaches and draw initial conclusions with respect to their relative capabilities, strengths and usability.To the best of our knowledge, this is the first hands-on evaluation of the two models,...
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...
The increased availability of mobile broadband connec- tions enables the expansion of software downloads to mobile devices. This leads to greater number of available services and a better utilisation of the computational power of mobile devices. The downside of this increased software availability is an increase in the possible attack vectors. One scenario is the misuse of resources, for example,...
Verifying a communication protocol means ensuring that it is free of logical errors prior to implementing it. That is, the goal of verification is to guarantee that the protocol does exactly what the designer intended. Techniques for verifying protocols differ depending on the protocol modeling techniques used. All techniques begin by modeling the protocol as a collection of processes. Each process...
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.