Transparent Synchronization Protocols for Compositional Real-Time Systems

Heuvel, Martijn van den; Bril, Reinder J.; Lukkien, Johan J.

doi:10.1109/tii.2011.2172448

Cited by 17 publications

(12 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Synchronization protocols have been developed to address global resource sharing in hierarchical real-time scheduling frameworks [6][7][8]. Synchronization experiments have been done also in biocomputing, where Benenson et al [9,10] have used DNA molecules as both software and hardware for finite automata of nano-scaling size.…”

Section: Literature Reviewmentioning

confidence: 99%

Testing Experiments on Synchronized Petri Nets

Pocci

Demongodin

Giambiasi

et al. 2014

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

Synchronizing sequences have been proposed in the late 60's to solve testing problems on systems modeled by finite state machines. Such sequences lead a system, seen as a black box, from an unknown current state to a known final one. This paper presents a first investigation of the computation of synchronizing sequences for systems modeled by synchronized Petri nets. In the first part of the paper, existing techniques for automata are adapted to this new setting. Later on, new approaches, that exploit the net structure to efficiently compute synchronizing sequences without an exhaustive enumeration of the state space, are presented. Note to practitionersDriving a system to a known state when its current state it is not known is a very important problem in many practical applications, such as checking communication protocols, part orienteers, digital reset circuit, etc. This topic has received a lot of attention in the past few decades. The classic approach to solve this problem considers systems modeled by automata. In particular a standard technique requires the computation of a synchronizing sequence, i.e., a sequence of inputs that drives the system to a unique final state independently of the initial state and does not require the observation of the system's outputs. This paper presents a first investigation on the computation of synchronizing sequences for systems modeled by synchronized Petri nets. Petri nets are a very intuitive model that is widely used in automation. Many analysis problems can be efficiently solved using Petri nets by taking into account the net structure, without an exhaustive enumeration of its state space. The techniques we propose for computing synchronizing sequences exploit the net structure and lead to viable algorithms that can be applied to large scale systems.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Testing Experiments on Synchronized Petri Nets

Pocci

Demongodin

Giambiasi

et al. 2014

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

show abstract

“…Van den Heuvel et al [29] extended their own fixed-priority-scheduled system [28] and they compared the synchronization overheads of BROE in MicroC/OS-II with other protocols in EDF-scheduled systems.…”

Section: B Preliminary Evaluations Of Synchronization Protocolsmentioning

confidence: 99%

“…Moreover, the shorter the component period is, the higher the context-switching overhead will be. Such implementation overheads of the synchronization protocols are ignored in this evaluation, however, and they are different for each protocol, for example, see [29].…”

Section: B Global Scheduling Penalties For Global Synchronizationmentioning

confidence: 99%

Performance evaluation of analysis methods for arbitrating non-preemptive resource access in compositional real-time systems

Heuvel

Bril

Lukkien

et al. 2014

Proceedings of the 2014 IEEE Emerging Technology and Factory Automation (ETFA)

Self Cite

View full text Add to dashboard Cite

In this paper, we compare and survey different ways to model the scheduling delays corresponding to nonpreemptive critical sections being executed by the tasks of different components that ultimately need to share one processor. We focus on the performance of compositional timing analyses for systems and we compare different protocols for the arbitration of tasks that wish to execute critical sections. Such analysis methods support timing predictable composition of independently validated components. This validation consists of analyzing the worst-case impact of critical sections on the schedules of the component's tasks. Finally, we evaluate the performance of the analysis methods by means of a simulation study.

show abstract

“…Then, can be always written as (13) where is a vector containing all monomials of degree less than or equal to in is a symmetric matrix, and is a linear parametrization of the subspace The representation (13) See, for instance, [16]- [18] and references therein for details and algorithms about SOS polynomials.…”

Section: B Sos Polynomialsmentioning

confidence: 99%

“…Traditional research topics focus on the deterministic system to establish static model, while a growing number of research focus attention on the uncertainties of multi-agent system according to the unexpected link failure, communication delay, interaction limit, and noise interference in the system [13]- [15]. A simple but compelling mathematic description of a group of autonomous agents is the Vicsek model, where possible changing of the nearest neighbor sets over time is an inherent property.…”

Section: Introductionmentioning

confidence: 99%

Robust Consensus for a Class of Uncertain Multi-Agent Dynamical Systems

Han¹,

Chesi²,

Hung³

2013

IEEE Trans. Ind. Inf.

View full text Add to dashboard Cite

Abstract-This paper investigates robust consensus for a class of uncertain multi-agent dynamical systems. Specifically, it is supposed that the system is described by a weighted adjacency matrix whose entries are polynomial functions of an uncertain vector constrained in a semi-algebraic set. For this uncertain topology, we provide necessary and sufficient conditions for ensuring robust first-order consensus and robust second-order consensus, in both cases of positive and non-positive weighted adjacency matrices. Moreover, we show how these conditions can be investigated through convex programming by using standard software. Some numerical examples illustrate the proposed results.Index Terms-Convex programming, multi-agent system, robust consensus, uncertain system.

show abstract

Transparent Synchronization Protocols for Compositional Real-Time Systems

Cited by 17 publications

References 37 publications

Testing Experiments on Synchronized Petri Nets

Testing Experiments on Synchronized Petri Nets

Performance evaluation of analysis methods for arbitrating non-preemptive resource access in compositional real-time systems

Robust Consensus for a Class of Uncertain Multi-Agent Dynamical Systems

Contact Info

Product

Resources

About