A new probable decision making approach for verification of probabilistic real-time systems

Souri, Alireza; Norouzi, Monire

doi:10.1109/icsess.2015.7339003

Cited by 16 publications

(11 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…66,[91][92][93] Some well-known model checkers are applied to verification approach such as NuSMV, § SPIN, ¶ PAT, # and UPPAAL**. 74,94 The existing model checking methods specify a state space exploration of the system behavior using reachable graph of binary decision diagrams. 18,95 96 presented a model checking method on the agent-based service composition approach.…”

Section: Model Checking Methods In the Service Composition Approachmentioning

confidence: 99%

“…The model checking approach has 2 main methods including KS and LTS . Some well‐known model checkers are applied to verification approach such as NuSMV, SPIN, PAT, and UPPAAL . The existing model checking methods specify a state space exploration of the system behavior using reachable graph of binary decision diagrams …”

Section: Categorizing Of Selected Service Composition Approachesmentioning

confidence: 99%

See 1 more Smart Citation

Formal verification approaches in the web service composition: A comprehensive analysis of the current challenges for future research

Souri

Rahmani

Navimipour

2018

Int J Communication

Self Cite

View full text Add to dashboard Cite

Summary Today, service composition is emerging paradigm on the communication networks such as cloud environments, internet of things, wireless sensor network, and software‐defined network. The goal of service composition method is to provide the interactions between user requirements and smart objects of intelligent communication systems. There have been many efforts to use formal verification and behavioral modeling methods to evaluate the service composition mechanisms. Up to now, there is not a comprehensive analysis research on this topic. Therefore, this paper focuses on several formal verification approaches that are performed to confirm the service composition correctness in communication networks. The objective of this paper is to comprehensively categorize and examine current research techniques on formal verification of the service composition. This research analysis provides an overview of recent service composition approaches according to structural and functional properties. Comparison results show that most of the verification approaches in explanation of the service composition correctness are semantic‐aware approach with 43%. The most used verification method for the service composition is model checking with 69%. The process algebra is used 29%, and some theorem proving methods are applied in 9% of the investigated mechanism. Moreover, most widely used modeling tools are NuSMV (22%), SPIN (17%), CPN (12%), UPPAAL (12%), Event‐B (10%), and PAT (5%).

show abstract

Section: Model Checking Methods In the Service Composition Approachmentioning

confidence: 99%

Section: Categorizing Of Selected Service Composition Approachesmentioning

confidence: 99%

Formal verification approaches in the web service composition: A comprehensive analysis of the current challenges for future research

Souri

Rahmani

Navimipour

2018

Int J Communication

Self Cite

View full text Add to dashboard Cite

show abstract

“…The important functional properties are illustrated as follows: Correctness properties: A property that checks the existing specification rules that should be satisfied in the state space of the system behavior. Reachability: A problem that refers to an assumed set of objective states that can be reached preliminary from a fixed set of initial states. Deadlock: A state that each individual from a gathering of activities is sitting tight for some other part to release a lock position. Safety: A condition that a path will never occur in the total of the system behavior. Liveness: Liveness occurs when an event happens in a series of finite paths in parallel. …”

Section: Motivation and Related Workmentioning

confidence: 99%

A systematic literature review on formal verification of software‐defined networks

Souri

Norouzi

Asghari

et al. 2019

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

By raising evolutionary network connections, a software‐defined network (SDN) offers a well‐managed and flexible novel network topology. The SDN efforts are provided to abstract the original network configuration for business applications and web services. Additionally, the SDN modifies the network management policies such as topology policies, deployment policies, the applicability, and infrastructure maintenance. One of the important features of the SDN is standardizing the network interfaces with the precise functional semantics in application and control flow layers. In another hand, specification and evaluation of the existing network interfaces is a main and significant challenge to prove the correctness of the configurable scenarios in the SDN approach. Recently, formal verification presents a high potential platform to evaluate the main‐layer scenarios of the SDN as the novel perspective in this area. Up to now, there is no survey and state‐of‐the‐art review on the formal verification methods in the SDN. This paper provides a systematic literature review (SLR) for the formal verification methods in the SDN in form of the SDN plans to recognize the state of the art of the open challenges. The presented SLR is classified into three main fields: application plan, data plan, and control plan approaches. The verification mechanisms are compared with each other according to the important factors such as structural properties, quality‐of‐service metrics, applied algorithms, and measurement tools.

show abstract

“…We can define a path on the LT behavioral model of the MFO‐WSC algorithm as follows Definition A labeled path LTP is a finite sequence of states and events starting from state s 1 and finishing at state s 2 ( s 1 and s 2 ∈ S ) denoted as: LTP = s 1

\vec{false}

s 2

\vec{false}

s 3 … s n −1

\vec{false}

s n such that ∀ ( k , v ): ( s k , e v , s k + 1 ) ∈ T .…”

Section: Performance Evaluationmentioning

confidence: 99%

A moth‐flame optimization algorithm for web service composition in cloud computing: Simulation and verification

et al. 2018

Self Cite

View full text Add to dashboard Cite

In recent years, users are becoming increasingly accustomed to using the Internet to gain software resources in the form of web services provided by information technology organizations. Cloud computing is a service delivery paradigm that shares services and resources to access the web services to the end users over the Internet. In the cloud environment, based on the user's needs, various types of services with similar functionalities but different quality-of-service (QoS) criteria can be delivered, which often must be combined to meet the users' requests. The optimal selection and composition of these services are realized as an interesting issue. In this paper, we propose a moth-flame optimization (MFO) algorithm, which is a novel nature-inspired metaheuristic paradigm for the web service composition (WSC) problem called "MFO-WSC," to improve the QoS criteria in the distributed cloud environment. Also, formal modeling is presented for the QoS-aware MFO-WSC algorithm with the model checking approach that receives the particular benefits to collaborate the correctness of the proposed algorithm. The correctness of the proposed behavior model is examined using some logical problems such as deadlock-free, fairness, and reachability conditions in the new symbolic model verifier model checker. The experimental results indicate the effectiveness of the proposed algorithm in comparison with similar related works.

show abstract

A new probable decision making approach for verification of probabilistic real-time systems

Cited by 16 publications

References 7 publications

Formal verification approaches in the web service composition: A comprehensive analysis of the current challenges for future research

Formal verification approaches in the web service composition: A comprehensive analysis of the current challenges for future research

A systematic literature review on formal verification of software‐defined networks

A moth‐flame optimization algorithm for web service composition in cloud computing: Simulation and verification

Contact Info

Product

Resources

About