ar X iv : 1 21 0 . 20 35 v 1 [ cs . S Y ] 7 O ct 2 01 2 Synthesis of Reactive Protocols for Vehicle - to - Vehicle Communication – Technical Report
نویسندگان
چکیده
We present a synthesis method for communication protocols for active safety applications that satisfy certain formal specifications on quality of service requirements. The protocols are developed to provide reliable communication services for automobile active safety applications. The synthesis method transforms a specification into a distributed implementation of senders and receivers that together satisfy the quality of service requirements by transmitting messages over an unreliable medium. We develop a specification language and an execution model for the implementations, and demonstrate the viability of our method by developing a protocol for a traffic scenario in which a car runs a red light at a busy intersection.
منابع مشابه
Improving power grid transient stability by plug-in electric vehicles
Plug-in electric vehicles (PEVs) can serve in discharge mode as distributed energy and power resources operating as vehicle-to-grid (V2G) devices and in charge mode as loads or grid-to-vehicle (G2V) devices. It has been documented that PEVs serving as V2G systems can offer possible backup for renewable power sources, can provide reactive power support, active power regulation, load balancing, p...
متن کاملar X iv : 0 71 0 . 35 19 v 1 [ cs . C C ] 1 8 O ct 2 00 7 P - matrix recognition is co - NP - complete
This is a summary of the proof by G.E. Coxson [1] that P-matrix recognition is co-NP-complete. The result follows by a reduction from the MAX CUT problem using results of S. Poljak and J. Rohn [5].
متن کاملCyber-Automotive Simulation and Evaluation Platform for Vehicular Value Added Services
An easily moving and safe transportation is an indicator in any country in the world of economic growth and well-being. For the past 100 years, innovation within the automotive sector has brought major technological advances leading to safer, cleaner and more affordable vehicles. But for the most time since the inception of the moving assembly line for vehicle production by Henry Ford, the chan...
متن کاملar X iv : 1 20 6 . 34 60 v 2 [ cs . S Y ] 28 S ep 2 01 2 ConstrainedDistributedAlgebraicConnectivity Maximization inRoboticNetworks ! — Technical Report —
We consider the problem of maximizing the algebraic connectivity of the communication graph in a network of mobile robots by moving them into appropriate positions. We define the Laplacian of the graph as dependent on the pairwise distance between the robots and we approximate the problem as a sequence of Semi-Definite Programs (SDP). We propose a distributed solution consisting of local SDP’s ...
متن کاملar X iv : 1 71 0 . 05 14 0 v 1 [ cs . C C ] 1 4 O ct 2 01 7 On complexity of multidistance graph recognition in R 1 Mikhail Tikhomirov
Let A be a set of positive numbers. A graph G is called an Aembeddable graph in R if the vertices of G can be positioned in R so that the distance between endpoints of any edge is an element of A. We consider the computational problem of recognizing A-embeddable graphs in R1 and classify all finite sets A by complexity of this problem in several natural variations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012