A Timed CTL Model Checker for Real-Time Maude

Modeling and analyzing mobile ad hoc networks (MANETs) pose non-trivial challenges to formal methods. Time, geometry, communication delays and failures, mobility, and uni-and bidirectional wireless communication can interact in unforeseen ways that are hard to model and analyze by current process calculi and automatic formal methods. As a consequence, current analyses tend to abstract away these physical aspects, so thatalthough still quite useful in finding various errors-their simplifying assumptions can easily fail to model details of MANET behavior relevant to meet desired requirements. In this work we present a formal framework for the modeling and analysis of MANETS based on Real-Time Maude to address this challenge. Specifically, we show that our framework has good expressive power to model relevant aspects of MANETs, and good compositionality properties, so that a MANET protocol can be easily composed with various models of mobility and with other MANET protocols. We illustrate the use of our framework on two well-known MANET benchmarks: the AODV routing protocol and the leader election protocol of Vasudevan, Kurose, and Towsley. Our formal analysis has uncovered a spurious behavior in the latter protocol that is due to the subtle interplay between communication delays, node movement, and neighbor discovery. This behavior therefore cannot be found by analyses that abstract from node movement and communication delays.

show abstract

“…Real-Time Maude is also equipped with a timed CTL model checker to analyze metric temporal logical properties [22,23].…”

Section: Object-oriented Specification In Real-time Maudementioning

confidence: 99%

Modeling and analyzing mobile ad hoc networks in Real-Time Maude

Liu

Ölveczky

Meseguer

2016

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…Timed CTL Model Checking. Real-Time Maude has recently been equipped with an explicit-state Timed CTL (TCTL) model checker for timed temporal logic properties such as "every request will be followed by a response within 100 ms" or "the minimum time between two p-states is 10 s" [34,35]. In TCTL, the temporal modalities are annotated with time intervals: ≤5 φ, ♦ >8 φ, and φ 1 U [2,9] φ 2 , and so on.…”

Section: No Solutionmentioning

confidence: 99%

Real-Time Maude and Its Applications

Ölveczky

2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Real-Time Maude extends the rewriting-logic-based Maude system to support the executable formal modeling and analysis of realtime systems. Real-Time Maude is characterized by its general and expressive, yet intuitive, specification formalism, and offers a spectrum of formal analysis methods, including: rewriting for simulation purposes, search for reachability analysis, and both untimed and metric temporal logic model checking. Real-Time Maude is particularly suitable for specifying real-time systems in an object-oriented style, and its flexible formalism makes it easy to model different forms of communication. This modeling flexibility, and the usefulness of both Real-Time Maude simulation and model checking, has been demonstrated in many advanced state-of-the-art applications, including both distributed protocols of different kinds and industrial embedded systems. Furthermore, Real-Time Maude's expressiveness has also been exploited to define the formal semantics of a number of modeling languages for real-time/embedded systems. Real-Time Maude thereby provides formal analysis for these languages for free, and such analysis has been integrated into the tool environment of a number of modeling languages. This paper gives an informal overview of Real-Time Maude and some of its applications.

show abstract