Reinder J. Bril

Reinder J. Bril

Auto-generated profile, based on publicly available information

Reinder J. Bril

Technische Universiteit Eindhoven (TU/e), Eindhoven, The Netherlands

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 January 2007 in Real-Time Systems
Verified
Journal Article
Open access
PDF file
RDRobert I. Davis
Robert I. Davis
ABAlan Burns
Alan Burns
RBReinder J. Bril
Reinder J. Bril
JLJohan J. Lukkien
Johan J. Lukkien
Controller Area Network (CAN) is used extensively in automotive applications, with in excess of 400 million CAN enabled microcontrollers manufactured each year. In 1994 schedulability analysis was developed for CAN, showing how worst-case response times of CAN messages could be calculated and hence guarantees provided that message response times would not exceed their deadlines. This seminal research has been cited in over 200 subsequent papers and transferred to industry in the form of commercial CAN schedulability analysis tools. These tools have been used by a large number of major automotive manufacturers in the design of in-vehicle networks for a wide range of cars, millions of which have been manufactured during the last decade. This paper shows that the original schedulability analysis given for CAN messages is flawed. It may provide guarantees for messages that will in fact miss their deadlines in the worst-case. This paper provides revised analysis resolving the problems with the original approach. Further, it highlights that the priority assignment policy, previously claimed to be optimal for CAN, is not in fact optimal and cites a method of obtaining an optimal priority ordering that is applicable to CAN. The paper discusses the possible impact on commercial CAN systems designed and developed using flawed schedulability analysis and makes recommendations for the revision of CAN schedulability analysis tools.

28 April 2009 in Real-Time Systems
Verified
Journal Article
Closed access
PDF file
RBReinder J. Bril
Reinder J. Bril
JLJohan J. Lukkien
Johan J. Lukkien
WVWim F.J. Verhaegh
Wim F.J. Verhaegh

15 November 2017 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
Jeroen PloegJeroen Ploeg
Jeroen Ploeg
ESElham Semsar-Kazerooni
Elham Semsar-Kazerooni
AMAlejandro I. Morales Medina
Alejandro I. Morales Medina
JJJan F. C. M. de Jongh
Jan F. C. M. de Jongh
JSJacco van de Sluis
Jacco van de Sluis
NWNathan van de Wouw
Nathan van de Wouw
Cooperative adaptive cruise control and platooning are well-known applications in the field of cooperative automated driving. However, extension toward maneuvering is desired to accommodate common highway maneuvers, such as merging, and to enable urban applications. To this end, a layered control architecture is adopted. In this architecture, the tactical layer hosts the interaction protocols, describing the wireless information exchange to initiate the vehicle maneuvers, supported by a novel wireless message set, whereas the operational layer involves the vehicle controllers to realize the desired maneuvers. This hierarchical approach was the basis for the Grand Cooperative Driving Challenge (GCDC), which was held in May 2016 in The Netherlands. The GCDC provided the opportunity for participating teams to cooperatively execute a highway lane-reduction scenario and an urban intersection-crossing scenario. The GCDC was set up as a competition and, hence, also involving assessment of the teams' individual performance in a cooperative setting. As a result, the hierarchical architecture proved to be a viable approach, whereas the GCDC appeared to be an effective instrument to advance the field of cooperative automated driving.

1 May 2005 in Real-Time Systems
Verified
Journal Article
Closed access
PDF file
CWClemens C. Wüst
Clemens C. Wüst
LSLiesbeth Steffens
Liesbeth Steffens
WVWim F.J. Verhaegh
Wim F.J. Verhaegh
RBReinder J. Bril
Reinder J. Bril
CHChristian Hentschel
Christian Hentschel

1 May 2016
Verified
Conference Paper
Closed access
JCJingyue Cao
Jingyue Cao
PCPieter J. L. Cuijpers
Pieter J. L. Cuijpers
RBReinder J. Bril
Reinder J. Bril
JLJohan J. Lukkien
Johan J. Lukkien
Busy period analysis is often used as a basis for worst-case response time analysis of priority based systems. However, when shaping strategies are used to prevent starvation of lower priorities, it becomes difficult to achieve tightness results using this method. The reason for this is that a busy period is defined as the longest interval in which there exists pending load. It is exclusively based on execution time, and does not take the amount of provided bandwidth into account. As a consequence, it is less suitable for the study of idling systems. In particular, we do not yet have tightness results regarding the analysis of the Ethernet AVB standard, in which credit-based shaping is applied. In this paper, we propose an alternative to the use of busy periods. We show that, by defining an eligible interval in such a way that provisioning is taken into account, tight worst-case response time bounds can more easily be obtained for Ethernet AVB, at least in the case of either lower-or higher-priority interference.

3 October 2018 in Real-Time Systems
Verified
Journal Article
Open access
PDF file
JCJingyue Cao
Jingyue Cao
PCPieter J. L. Cuijpers
Pieter J. L. Cuijpers
RBReinder J. Bril
Reinder J. Bril
JLJohan J. Lukkien
Johan J. Lukkien
In the high-tech and automotive industry, bandwidth considerations and widely accepted standardization are two important reasons why Ethernet is currently being considered as an alternative solution for real-time communication (compared to traditional fieldbusses). Although Ethernet was originally not intended for this purpose, the development of the Ethernet AVB standard enables its use for transporting high-volume data (e.g. from cameras and entertainment applications) with low-latency guarantees. In complex industrial systems, the network is shared by many applications, developed by different parties. To face this complexity, the development of these applications must be kept as independent as possible. In particular, from a network point of view, progress of all communication streams must be guaranteed, and the performance for individual streams should be predictable using only information regarding the stream under study and the general parameters of the communication standard used by the network. Initial methods to guarantee latency for Ethernet AVB networks rely on the traditional busy-period analysis. Typically, these methods are based on knowledge of the inter-arrival patterns of both the stream under study and the interfering streams that also traverse the network. The desired independence is therefore not achieved. In this paper, we present an independent real-time analysis based on so-called eligible intervals, which does not rely on any assumptions on interfering priority classes other than those enforced in the Ethernet AVB standard. We prove this analysis is tight in case there is only a single higher-priority stream, and no additional information on interference is known. In case there are multiple higher-priority streams, we give conditions under which the analysis is still tight. Furthermore, we compare the results of our approach to the two most recent busy-period analyses, point out sources of pessimism in these earlier works, and argue that assuming more information on the sources of interference (e.g. a minimal inter-arrival time between interfering frames) has only limited advantages.