A reduced maximality labeled transition system generation for recursive Petri nets

Bouneb, Messaouda; Saïdouni, Djamel Eddine

doi:10.1007/s00165-015-0341-3

Cited by 3 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the next method, the model is constructed as an LTS model that is the event-based framework and the transitions are labeled with a name [70,71]. The user can initialize a set of states and actions to design the behavioral model.…”

Section: Gsmt Behavioral Modelsmentioning

confidence: 99%

See 1 more Smart Citation

A symbolic model checking approach in formal verification of distributed systems

Souri

Rahmani

Navimipour

et al. 2019

Hum. Cent. Comput. Inf. Sci.

View full text Add to dashboard Cite

Today, distributed systems have developed complex components more and more [1, 2]. By increasing performance of complex systems such as service composition [3], task scheduling [4] and fault tolerance [5], simulation analysis cannot evaluate entire of the system levels [6, 7]. Also, the simulation results are rested to some design under test platforms [8] that omit the part of the existing state space of the system [9]. Formal verification is a mathematically correctness provable approach for the complex distributed systems which is well-suitable for NP-hard problems [10, 11]. Recent scientific studies analyzed their case studies using mathematical verification approaches such as model

show abstract

Section: Gsmt Behavioral Modelsmentioning

confidence: 99%

“…The reduced model generally is based on a linear reduction in some related approaches [70,[76][77][78]. The complex systems have a set of impermissible states that are composed of the parallel relational processes.…”

Section: Recursive Reduced Modelmentioning

confidence: 99%