Simulation and Verification of Asynchronous Systems by means of a Synchronous Model

Halbwachs, Nicolas; Mandel, Louis

doi:10.1109/acsd.2006.24

Cited by 23 publications

(26 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, in [HB02] and [HM06], the authors show that synchronous Mealy machines can model asynchronous behaviour by introducing stuttering through sporadic activation and nondeterminism through additional arbitrary inputs (also called oracles).…”

Section: Relating Synchrony and Asynchronymentioning

confidence: 99%

See 1 more Smart Citation

On the Compositionality of Round Abstraction

Ghica

Menaa

2010

CONCUR 2010 - Concurrency Theory

View full text Add to dashboard Cite

Game Semantics is an approach to denotational semantics that has been successful in providing accurate, fully abstract models for various programming languages. It has thereafter been applied, amongst other things, to model checking, access control analysis, information flow analysis, and recently, hardware synthesis.While the roots of modern Game Semantics are sequential, several game models of asynchronous concurrency have since been devised. However, synchronous concurrency has not been considered hitherto.This thesis studies synchronous concurrency in game-like models. The central idea is to investigate deriving such synchronous models from their asynchronous counterparts using round abstraction-a technique that allows aggregating a sequence of computational steps to form a larger, more abstract macro-step.We define round abstraction within a trace-semantic setting that generalises game semantic models. We note that, in general, round abstraction is not compositional. We then identify sufficient conditions to guarantee correct composition, thereby proposing a framework for round abstraction that is sound when applied to synchronous and asynchronous behaviours.

show abstract

Section: Relating Synchrony and Asynchronymentioning

confidence: 99%

“…Starting with Milner's seminal work in the 1980s, several authors demonstrated how asynchronous models can be derived from [Mil83,BCG99] or simulated by [HM06] their synchronous counterparts. Hence, it is commonly accepted that synchronous models are more expressive.…”

Section: Motivationmentioning

confidence: 99%

On the Compositionality of Round Abstraction

Ghica

Menaa

2010

CONCUR 2010 - Concurrency Theory

View full text Add to dashboard Cite

show abstract

“…If f is of the form λx.x when e for some complex boolean expression e but for which it can be proved that its value belongs to the envelope [−2, 2](7/3) then a valid abstraction for f is ∀α.α → α on ∼ [−2, 2](7/3). Another example appears when modeling the execution time of processes [14][15][16]. To state that a function f must be executed every ten cycles and that its computation takes between two and four cycles, we can give it the clock signature: ∀α.α on The main contribution of this paper is thus to introduce those clock envelopes and to study their algebraic properties.…”

Section: Introductionmentioning

confidence: 99%

Abstraction of Clocks in Synchronous Data-Flow Systems

Cohen

Mandel

Plateau

et al. 2008

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Synchronous data-flow languages such as Lustre manage infinite sequences or streams as basic values. Each stream is associated to a clock which defines the instants where the current value of the stream is present. This clock is a type information and a dedicated type system -the so-called clock-calculus -statically rejects programs which cannot be executed synchronously. In existing synchronous languages, it amounts at asking whether two streams have the same clocks and thus relies on clock equality only. Recent works have shown the interest of introducing some relaxed notion of synchrony, where two streams can be composed as soon as they can be synchronized through the introduction of a finite buffer (as done in the SDF model of Edward Lee). This technically consists in replacing typing by subtyping. The present paper introduces a simple way to achieve this relaxed model through the use of clock envelopes. These clock envelopes are set of concrete clocks which are not necessarily periodic. This allows to model various features in real-time embedded software such as bounded jitter as found in videosystems, execution time of real-time processes and scheduling resources or the communication through buffers. We present the algebra of clock envelopes and its main theoretical properties.

show abstract

“…Following Milner's result [25] that asynchronism can be encoded in a synchronous process calculus, there have been approaches [16,21,26,17] suggesting ways to describe Gals systems using synchronous languages; for instance, nondeterminism is expressed by adding auxiliary input variables (oracles), the value of which is undefined; a main limitation of these approaches is that asynchronism and nondeterminism are not recognized as first-class concepts, so verification tools often lack optimizations specific to asynchronous concurrency (e.g. partial orders, compositional minimization, etc.).…”

Section: Introductionmentioning

confidence: 99%

Verification of GALS Systems by Combining Synchronous Languages and Process Calculi

Garavel

Thivolle

2009

Model Checking Software

View full text Add to dashboard Cite

Abstract. A Gals (Globally Asynchronous Locally Synchronous) system typically consists of a collection of sequential, deterministic components that execute concurrently and communicate using slow or unreliable channels. This paper proposes a general approach for modelling and verifying Gals systems using a combination of synchronous languages (for the sequential components) and process calculi (for communication channels and asynchronous concurrency). This approach is illustrated with an industrial case-study provided by Airbus: a Tftp/Udp communication protocol between a plane and the ground, which is modelled using the Eclipse/TopCased workbench for model-driven engineering and then analysed formally using the Cadp verification and performance evaluation toolbox.

show abstract

Simulation and Verification of Asynchronous Systems by means of a Synchronous Model

Abstract: Abstract

Cited by 23 publications

References 24 publications

On the Compositionality of Round Abstraction

On the Compositionality of Round Abstraction

Abstraction of Clocks in Synchronous Data-Flow Systems

Verification of GALS Systems by Combining Synchronous Languages and Process Calculi

Contact Info

Product

Resources

About