MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters

Self-adaptive software systems are able to autonomously adapt their behavior at run-time to react to internal dynamics and to uncertain and changing environment conditions. Formal specification and verification of self-adaptive systems are tasks generally very difficult to carry out, especially when involving time constraints. In this case, in fact, the system correctness depends also on the time associated with events.This article introduces the Zone-based Time Basic Petri nets specification formalism. The formalism adopts timed adaptation models to specify self-adaptive behavior with temporal constraints, and relies on a zone-based modeling approach to support separation of concerns. Zones identified during the modeling phase can be then used as modules either in isolation, to verify intra-zone properties, or all together, to verify inter-zone properties over the entire system. In addition, the framework allows the verification of (timed) robustness properties to guarantee self-healing capabilities when higher levels of reliability and availability are required to the system, especially when dealing with time-critical systems. This article presents also the ZAFETY tool, a Java software implementation of the proposed framework, and the validation and experimental results obtained in modeling and verifying two time-critical self-adaptive systems: the Gas Burner system and the Unmanned Aerial Vehicle system.

show abstract

“…Let e be the edge relation of the underlying ordinary state space. Every symbolic edge satisfies the condition EE ( -5 ) [36,37], i.e. :…”

Section: Time Reachability Graphmentioning

confidence: 99%

Zone-based formal specification and timing analysis of real-time self-adaptive systems

Camilli

Gargantini

Scandurra

2018

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…Let T s :〈 S , s 0 , R 〉 be an ordinary state‐transition system. We call 〈 A , a 0 , Γ 〉 an abstract representation of T s if A is finite and each state a ∈ A symbolically represents a (possibly infinite) aggregate of ordinary states sharing some features: more precisely, if s 0 ∈ a 0 (normally a 0 ={ s 0 }),

⋃_{a \in A}^{} a \supseteq S

, and the abstract transition relation Γ satisfies condition ∃∃(or EE ) , that is, ∀〈 a , a ′〉∈ Γ , ∃ s ∈ a ,∃ s ′∈ a ′,〈 s , s ′〉∈ R ; ∀〈 s , s ′〉∈ R , ∀ a ∈ A : s ∈ a , ∃ a ′∈ A : s ′∈ a ′,〈 a , a ′〉∈ Γ . …”

Section: Model‐checking Of Abstract Transition Systemsmentioning

confidence: 99%

Distributed CTL model checking using MapReduce: theory and practice

Bellettini

Camilli

Capra

et al. 2015

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

Summary The recent extensive availability of ‘cloud’ computing platforms is very appealing for the formal verification community. In fact, these platforms represent a great opportunity to run massively parallel jobs and analyze ‘big data’ problems, although classical formal verification tools and techniques must undergo a deep technological transformation to take advantage of the available powerful architectures. A distributed approach to verification of computation tree logic formulas on very large state spaces is described. The approach exploits and integrates our parametric state–space builder, designed to ease the adoption of ‘big data’ platforms. The whole framework adopts a MAPREDUCEapproach as the core computational model and can be tailored to different modeling formalisms. This paper includes proofs of correctness, a short theoretical discussion about complexity, and reports a practical experience with some benchmarking Petri net models. The outcomes of several tests are presented, thus showing the convenience of the proposed approach. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

“…Recent studies have also shown the convenience of exploiting big data approaches and cloud computing facilities to accomplish this task. A framework (called MARDIGRAS) [8] was recently developed to ease implementing distributed state space builders for different formalisms. Given a cluster of n machines, a MARDIGRAS-based application generates n files F 1 , F 2 , ..., F n storing a partition of the whole state space.…”

Section: B Distributed State Space Generationmentioning

confidence: 99%

“…Our recent works focused on the connection between formal methods in software engineering and big data approaches [8], [9], [10]. Formal verification of complex systems certainly falls in this context, although it has been so far poorly explored by big data scientists [11].…”

Section: Introductionmentioning

confidence: 99%

“…In fact, we already exploited it successfully to perform analyses on Petri Nets [9], [10]. The MapReduce programming model, which has become the de facto standard for large scale data-intensive applications, has provided researchers with a powerful tool for tackling big-data problems in different areas [12], [8], [13]. Despite new powerful cloud technologies are rapidly emerging, some MapReduce features seem to be tailored to backward/forward explicit state-space exploration.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

CTL Model Checking in the Cloud Using MapReduce

Camilli

Bellettini

Capra

et al. 2014

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Self Cite

View full text Add to dashboard Cite

The recent extensive availability of "big data" platforms calls for a widespread adoption by the formal verification community. Cloud computing platforms represent a great opportunity to run massively parallel jobs, yet classical formal verification tools/techniques must undergo a deep technological transformation in order to exploit the new available architectures. This has raised an increasing interest in deploying verification techniques on parallel/distributed frameworks. In this paper we introduce a framework to ease the adoption of a distributed approach to verification of Computation Tree Logic (CTL) formulas on very large state spaces. The approach exploits/integrates a recently developed, parametric state-space builder. The whole framework adopts MAPREDUCE as core computational model, and can be tailored to different modelling formalisms. The outcomes of several tests performed on (Petri-nets based) benchmark specifications are presented, thus showing the convenience of the proposed approach.

show abstract

MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters

Cited by 17 publications

References 19 publications

Zone-based formal specification and timing analysis of real-time self-adaptive systems

Zone-based formal specification and timing analysis of real-time self-adaptive systems

Distributed CTL model checking using MapReduce: theory and practice

CTL Model Checking in the Cloud Using MapReduce

Contact Info

Product

Resources

About