Model-Checking Distributed Real-Time Systems with States, Events, and Multiple Fairness Assumptions

Wang, Farn

doi:10.1007/978-3-540-27815-3_41

Cited by 16 publications

(13 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It supports full TCTL model-checking and simulation-checking, both with multiple fairness assumptions. For more details, please check (Wang 2004a). …”

Section: Methodsmentioning

confidence: 97%

Efficient verification of distributed real-time systems with broadcasting behaviors

2011

Self Cite

View full text Add to dashboard Cite

Binary synchronization has been used extensively in the construction of mathematical models for the verification of embedded systems. Although it allows for the modeling of complex cooperation among many processes in a natural environment, not many tools have been developed to support the modeling capability in this regard. In this article, we first give examples to argue that special algorithms are needed for the efficient verification of systems with complex synchronizations. We then define our models of distributed real-time systems with synchronized cooperation among many processes. We present algorithms for the construction of BDDlike diagrams for the characterization of complex synchronizations among many processes. We present weakest precondition algorithms that take advantage of the justmentioned BDD-like diagrams for the efficient verification of complex real-time systems. Finally, we report experiments and argue that the techniques could be useful in practice.RED 8.0 is available at project REDLIB of SourceForge.

show abstract

“…It supports full TCTL model-checking and simulation-checking, both with multiple fairness assumptions. For more details, please check (Wang 2004a). …”

Section: Methodsmentioning

confidence: 97%

Efficient verification of distributed real-time systems with broadcasting behaviors

2011

Self Cite

View full text Add to dashboard Cite

show abstract

“…It also supports the checking of deadlock. Moreover, it supports the checking of an extension of TCTL for the specification with event predicates and multiple fairness assumptions [15]. There are two types of fairness assumptions, strong fairness and weak fairness.…”

Section: Model-checking With Event Constraints and Fairness Assumptionsmentioning

confidence: 99%

“…REDLIB accepts Communicating Timed Automata (CTA) [3,14] for the description of transitions in dense-time state-spaces. At this moment, REDLIB supports forward/backward image calculation [16], counter-example generation, symmetry reduction for software with pointer data-structures [22], GUI, deadlock detection, full TCTL model-checking [1,15,21] with event predicates and multiple fairness assumptions [15], symbolic simulation [20], and test case generation. REDLIB uses BDD-based technology to gain efficiency [16,18,19].…”

Section: Introductionmentioning

confidence: 99%

REDLIB for the Formal Verification of Embedded Systems

Wang

2006

Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (Isola 2006)

Self Cite

View full text Add to dashboard Cite

To promote the technology of dense-time system modelchecking in both academia and industry, we developed a library, called REDLIB, which supports full TCTL modelchecking of dense-time automata with multiple fairness assumptions. REDLIB uses the BDD-like diagrams for the efficient representation and manipulation of dense-time statespaces. Users can use the procedures in REDLIB to quickly construct dense-time models and carry out basic Boolean and state-space operations, postcondtion/precondition calculation, state-space representation normalizations, greatest fixpoint calculation, parametric safety analysis of linear hybrid systems, speed-up techniques for greatest fixpoint evaluation, and coverage analysis of dense-time statespaces. REDLIB also has a preprocessor that allows for high-level constructs like arrays, message channels, dynamic memory allocation, procedure calls, and timers. In this article, we discuss the features of REDLIB and give small examples to show how to use REDLIB.

show abstract

“…In [11], CDD only served as a recording device in that reachable state-space representations were analyzed using DBM [13] and then converted for recording to CDD. In [25], [27], [26], a full set of verification algorithms (including forward/backward reachability analysis, normalization, and full TCTL model-checking procedures) for CRD were reported.…”

Section: Related Workmentioning

confidence: 99%

Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures

Wang

2005

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Abstract-We introduce a new BDD-like data structure called Hybrid-Restriction Diagrams (HRDs) for the representation and manipulation of linear hybrid automata (LHA) state-spaces and present algorithms for weakest precondition calculations. This permits us to reason about the valuations of parameters that make safety properties satisfied. Advantages of our approach include the ability to represent discrete state information and concave polyhedra in a unified scheme, as well as to save both memory consumptions and manipulation times when processing the same substructures in state-space representations. Our experimental results document its efficiency in practice.

show abstract

Model-Checking Distributed Real-Time Systems with States, Events, and Multiple Fairness Assumptions

Cited by 16 publications

References 18 publications

Efficient verification of distributed real-time systems with broadcasting behaviors

Efficient verification of distributed real-time systems with broadcasting behaviors

REDLIB for the Formal Verification of Embedded Systems

Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures

Contact Info

Product

Resources

About