LOTOS-like process algebras with urgent or timed interactions

Bolognesi, Tommaso; Lucidi, Ferdinando

doi:10.1016/b978-0-444-89402-1.50027-8

Cited by 39 publications

(19 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…AORTA is a timed process algebra-based design language, so comparison might be made with other timed process algebras; however so many timed process algebras have been defined that even a cursory list of references would be too long for the scope of this paper, so the reader is referred elsewhere [9], and direct references given only for (a version of) Timed CCS [26], Timed CSP [22], and (a version of) Timed LOTOS [2]. At this level the main distinctive feature of AORTA is the ability to generate implementations about which timing guarantees can be made.…”

Section: Discussionmentioning

confidence: 99%

“…MOSCA provides a formalism combining CCS, VDM and time, but without providing implementation techniques [25] whilst RAISE [24] and LOTOS [20,27] provide data modelling in concurrent systems, with some implementation techniques, but no time. Work has also been done with timed extensions to LOTOS [2], which already has the data language ACT-ONE included, but in this case no implementation techniques are provided. A different kind of approach involves introducing time into data specification languages such as Z [10, 13,14], with the closest work to ours being that by Fidge et al [12], which allows the timed refinement of concurrent systems, including reasoning about implementations by embedding scheduling theory into the Z model.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Integrating AORTA with model-based data specification languages

Bradley

Henderson

Kendall

et al. 1998

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. AORTA has been proposed as an implementable real-time algebra for concurrent systems where event times, rather than values of data, are critical. In this paper we discuss an extension to AORTA to include a formal data model, allowing integration with a variety of modelbased data specification languages. An example is given using VDM with AORTA to define a time-critical system with important data attributes, and supporting software tools for AORTA and a simple imperative language are described. IntroductionAlthough many timed formalisms exist, AORTA [6] (Application-Oriented RealTime Algebra) is one of the few to consider how designs/specifications of concurrent systems can be implemented in a way that time behaviour can be guaranteed. Supporting tools exist which allow AORTA designs to be simulated, formally verified, and code to be generated [8]. One of the ideas behind the development of AORTA has been that formal methods are good for more than just proof: an unambiguously defined semantics allows early exercising of designs by simulation, and provides a basis for reliable code generation. Whilst proof remains an important aspect of any formal technique, we argue that it is not only the presentation of sound and complete proof theories or automatic verification algorithms which should influence the design of languages, but also the provision of facilities such as code generation and simulation. AORTA only models formally the order and timing of events, and does not deal with data. Implementation details such as values to be passed during communication and the data transformations to be carried out during a given piece of computation are given as annotations to the AORTA design, in the form of fragments of C [5]. In this paper we examine the problem of introducing formal models of data into AORTA designs, and how this affects the notation, the semantics, the tool support and the development method. The approach given here is different from some other proposals [13, 20,23,25], in that rather than integrating with a particular formal specification language, integration within a relatively general framework (described in section 3) is suggested, which allows

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Integrating AORTA with model-based data specification languages

Bradley

Henderson

Kendall

et al. 1998

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…Among those with deterministic delays, we mention timed CSP [35], temporal CCS [29], timed CCS [39], real-time ACP [2], urgent LOTOS [10], CIPA [1], TPL [20], ATP [32], TIC [34], and PAFAS [14]. As observed in [31,38,12], these calculi differ on the basis of a number of time-related options, some of which are recalled below:…”

Section: Introductionmentioning

confidence: 99%

Timed process calculi with deterministic or stochastic delays: Commuting between durational and durationless actions

Bernardo

Corradini

Tesei

2016

Theoretical Computer Science

View full text Add to dashboard Cite

Several deterministically/stochastically timed process calculi have been proposed in the literature that, apart from their synchronization mechanism, mainly differ for the way in which actions and delays are represented. In particular, a distinction is made between integrated-time calculi, in which actions are durational, and orthogonal-time calculi, in which actions are instantaneous and delays are expressed separately. In a previous work on deterministic time, the two approaches have been shown to be reconcilable through an encoding from the integrated-time calculus CIPA to the orthogonal-time calculus TCCS, which preserves strong timed bisimilarity under certain conditions. In this paper, the picture is completed by first defining a reverse encoding from TCCS to CIPA, which requires slight modifications to both calculi and is shown to preserve only weak timed bisimilarity under conditions tighter than those for the direct encoding. Stochastic time is then addressed, by exhibiting an encoding from the integrated-time calculus MTIPP to the orthogonal-time calculus IML, together with a reverse encoding requiring slight modifications only to the former calculus, with both encodings being shown to preserve strong Markovian bisimilarity under suitable conditions. All the four encodings rely on the assumption that action execution is urgent. Variants are finally discussed in which action execution is delayable, in the sense that an enabled action can let time advance before starting its execution, or only the execution of internal actions is urgent, which is known as maximal progress

show abstract

“…In S , there are five parameter variables p 1 , p 2 , ..., p 5 which denote the computation times for executing events c, d, b, f, g, respectively. In our model, in order to reduce the size of the tuple machine, we assume that each event has urgency property [2]. That is, if each event becomes executable, then we assume that the event is immediately executed.…”

Section: Parametric Model Checkingmentioning

confidence: 99%

A Flexible and High-Reliable HW/SW Co-Design Method for Real-Time Embedded Systems

Kitani

Takamoto

Yasumoto

et al.

25th IEEE International Real-Time Systems Symposium

View full text Add to dashboard Cite

In this paper, we propose a flexible and high-reliable HW/SW co-design method for real-time systems consisting of multiple functional modules using general purpose components such as DSP, CPU and memory. In our method, we specify a system as a parallel composition of concurrent periodic EFSMs with timing constraints. As communication primitives among EFSMs, multi-way synchronization mechanism can be specified. Here, we propose a technique for efficient development of real-time embedded systems considering both reliability and cost-performance. For the purpose, using a parametric model checking technique, we derive a parameter condition which must hold for the system to proceed without deadlocks and satisfy given timing constraints. Based on the derived parameter condition and cost-performance characteristic of available components, an appropriate combination of components is automatically selected so that the total cost is minimized. We have developed a design support tool based on the proposed technique. By applying our method to development of a basic functionality of a cellular phone, we could decide which functional modules should be implemented as dedicated HW units or on-chip-CPUs' software, and select suitable DSPs and memories with low costs.

show abstract

LOTOS-like process algebras with urgent or timed interactions

Cited by 39 publications

References 7 publications

Integrating AORTA with model-based data specification languages

Integrating AORTA with model-based data specification languages

Timed process calculi with deterministic or stochastic delays: Commuting between durational and durationless actions

A Flexible and High-Reliable HW/SW Co-Design Method for Real-Time Embedded Systems

Contact Info

Product

Resources

About