ACSR: An algebra of communicating shared resources with dense time and priorities

Brémond-Grégoire, Patrice; Lee, Insup; Gerber, R.

doi:10.1007/3-540-57208-2_29

Cited by 23 publications

(16 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, the adequacy of Scheduling-TPN to the modeling of classical services provided by real-time executives (shared resource access protocol, task activation, synchronization and messaging) and the modeling of classical components of distributed embedded systems such as CAN buses have been exposed in (Lime and Roux 2003). Similarly to formalisms such as ACSR (Brémond-Grégoire et al 1993), we can then model and analyze arbitrarily complex task behaviors.…”

Section: Our Contributionmentioning

confidence: 99%

Formal verification of real-time systems with preemptive scheduling

Lime¹,

Roux²

2008

Real-Time Syst

View full text Add to dashboard Cite

Abstract. In this paper, we propose a method for the verification of timed properties for real-time systems featuring a preemptive scheduling policy: the system, modeled as a scheduling time Petri net, is first translated into a linear hybrid automaton to which it is time-bisimilar. Timed properties can then be verified using HyTech. The efficiency of this approach leans on two major points: first, the translation features a minimization of the number of variables (clocks) of the resulting automaton, which is a critical parameter for the efficiency of the ensuing verification. Second, the translation is performed by an over-approximating algorithm, which is based on Difference Bound Matrix and therefore efficient, that nonetheless produces a time-bisimilar automaton despite the over-approximation. The proposed modeling and verification method are generic enough to account for many scheduling policies. In this paper, we specifically show how to deal with Fixed Priority and Earliest Deadline First policies, with the possibility of using Round-Robin for tasks with the same priority. We have implemented the method and give some experimental results illustrating its efficiency.

show abstract

Section: Our Contributionmentioning

confidence: 99%

Formal verification of real-time systems with preemptive scheduling

Lime¹,

Roux²

2008

Real-Time Syst

View full text Add to dashboard Cite

show abstract

“…• VERSA (Verification, Execution, and Rewrite System of ACSR) [70] from the USA is based on the dense-time process algebra ACSR [63] with resource-specific delays and priority arbitration. The tool set XVERSA supports simulation, term rewriting, equivalence checking, and model checking.…”

Section: Toolsmentioning

confidence: 99%

Introduction to Process Algebra

Fokkink

2000

Texts in Theoretical Computer Science. An EATCS Series

220

163

View full text Add to dashboard Cite

“…To tackle non-determinism and execution conflicts, priorities have been introduced as a scheduling order. Composition, refinement and model-checking of timed systems with priorities have been intensively studied [9], [18], [22], [3], [17], [16], [13]. The ultimate goal of these work is to deal with details resulted from the use of clock variables and evolutive data structures, required by real-time applications.…”

Section: Introductionmentioning

confidence: 99%

“…However, a compositional framework with high-level concepts like variables, communication and priorities is still lacking. Several works [11], [16], [22], [13] have focused on this subject by analyzing thoroughly the problem and criticizing existing solutions. In fact, this paper is a follow up of [12] where we have revisited the composition of timed systems, without priorities, and proposed a new communication mechanism for UPPAAL timed automata.…”

Section: Introductionmentioning

confidence: 99%

Compositional Refinement for Real-Time Systems with Priorities

Boudjadar

Bodeveix

Filali

2012

2012 19th International Symposium on Temporal Representation and Reasoning

View full text Add to dashboard Cite

High-level requirements of real-time systems like as time constraints, communications and execution schedulability make the verification of real-time models arduous, where a system is the interaction of a possibly unbounded set of components. Priorities have been introduced to resolve execution conflicts, and by that, prevent the combinatorial explosion of state space. In this paper, we are interested in the composition and refinement of timed systems by considering static and dynamic priorities. Firstly, we propose a revised definition of the product of extended timed transition systems with static and dynamic priorities associated to individual transitions. Afterwards, we study the (compositional) refinement of compound extended timed systems. Without sacrificing compositionality, we instantiate this framework for the case of UPPAAL networks of timed automata with static priority Committedness, dynamic priority between channels and priority between processes. Moreover, we show how to associate an Extended Timed Transition System (ETTS) to timed automata (TA), where an unique generalized dynamic priority system of ETTS is derived from both dynamic priority orders: priority between channels and priority between processes.

show abstract

ACSR: An algebra of communicating shared resources with dense time and priorities

Cited by 23 publications

References 16 publications

Formal verification of real-time systems with preemptive scheduling

Formal verification of real-time systems with preemptive scheduling

Introduction to Process Algebra

Compositional Refinement for Real-Time Systems with Priorities

Contact Info

Product

Resources

About