Specification of real-time systems using a timed automata model with shared variables and verification of partial-deadlock freeness

Okano, Kozo; Hattori, Shimmi; Yamamoto, Alexandre Yasuo; Higashino, Teruo; Taniguchi, Kenichi

doi:10.1109/icppw.1999.800118

Cited by 7 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…determining whether a concurrent program is deadlock‐free. For example, Masticola and Ryder 13 describe how to statically determine whether a given Ada program is deadlock‐free and14–16 describe how to statically verify that a program in notations such as process calculus with communication channels or timed automata with shared variables is partial‐deadlock free. Partial deadlock means that a specified part of the program deadlocks.…”

Section: Introductionmentioning

confidence: 99%

A definition of and linguistic support for partial quiescence

Man

Chan

Gallagher

et al. 2007

Concurrency and Computation

View full text Add to dashboard Cite

The global quiescence (GQ) of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provide GQ detection as a built-in feature so that programmers do not need to write special synchronization code to detect quiescence. This paper introduces partial quiescence (PQ), which generalizes quiescence detection to a specified part of a distributed computation. PQ is useful, for example, when two independent concurrent computations that both rely on GQ need to be combined into a single program. The paper describes how we have designed and implemented a PQ mechanism within an experimental version of the JR concurrent programming language, and have gained experience with several representative applications. Our early results are promising qualitatively and quantitatively.deadlocked. This quiescence problem is challenging because each process has only local information, but to solve the problem requires information about all processes (i.e. global state information). More formally, global quiescence (GQ) is defined as the state in which each process has terminated or deadlocked and there are no messages in the communication channels [2]. Quiescence detection, then, is the mechanism used to detect such a state in a distributed system. Many solutions to this problem have been proposed (e.g. [3][4][5][6][7][8]).Some programming languages and systems provide GQ detection as a built-in feature. That is, programmers do not need to write special synchronization code to detect quiescence. Instead, they can focus on writing application code. When quiescence is reached, the program can perform various actions such as simply terminating the program, outputting final results, gathering statistics from the overall computation, or initiating a new phase of the program, which might involve a new, corresponding phase of quiescence detection.Although useful, GQ is limited to dealing with the state of all processes in a program. A more general, but more difficult to detect, property would define when a specified part of the program has become quiescent. For example, suppose we have two programs that use GQ and we want to combine them into a single program in which we want to perform different actions when each part of it becomes quiescent. This motivation led us to explore partial quiescence (PQ).This paper proposes possible ways of defining PQ. It then discusses the particular definition selected and implemented in an experimental version of the JR concurrent programming language.(JR extends Java [9] with a richer concurrency model [10][11][12].) The definition of PQ and its implementation in JR apply to truly distributed programs. The paper also shows how PQ leads to a different programming style for some problems. We compare the performance of using PQ detection and GQ detection. PQ might be a useful feature for other languages and libraries that define process or thread groups, as many do, and especially useful for those languages and libraries that alre...

show abstract

Section: Introductionmentioning

confidence: 99%

A definition of and linguistic support for partial quiescence

Man

Chan

Gallagher

et al. 2007

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…An alternative approach involves statically determining various properties of concurrent programs, e.g., determining whether a concurrent program is deadlock-free. For example, [13] describes how to statically determine whether a given Ada program is deadlock-free and [9,16,17] describe how to statically verify that a program in notations such as process calculus with communication channels or timed automata with shared variables is partial-deadlock free. Partial deadlock means that a specified part of the program deadlocks.…”

Section: Introductionmentioning

confidence: 99%

Toward a Definition of and Linguistic Support for Partial Quiescence

Man

Chan

Gallagher

et al. 2006

Euro-Par 2006 Parallel Processing

View full text Add to dashboard Cite

The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provide global quiescence detection as a built-in feature so that programmers do not need to write special synchronization code to detect quiescence. This paper introduces partial quiescence (PQ), which generalizes quiescence detection to a specified part of a distributed computation. Partial quiescence is useful, for example, when two independent concurrent computations that both rely on global quiescence need to be combined into a single program. The paper describes how we have designed and implemented a PQ mechanism within an experimental version of the JR concurrent programming language. Our early results are promising qualitatively and quantitatively.

show abstract