Equivalence Checking 40 Years After: A Review of Bisimulation Tools

Garavel, Hubert; Lang, Frédéric

doi:10.1007/978-3-031-15629-8_13

Cited by 6 publications

(9 citation statements)

References 321 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More details about these case studies are available in [5,7,32]. To compare our implementation of the proposed heuristics for probabilistic bisimulation with the other tools, we select two state-of-the-art tools, mCRL2 [8] and STORM [15], that provide the most recent approaches [22]. Some information on the selected models, the experimental results for our implementation, and the results for the mCRL2 and STORM tools are demonstrated in Table 1.…”

Section: Resultsmentioning

confidence: 99%

“…Finally, we experimentally analyze the impact of bisimulation reduction on the overall running time of probabilistic model checking. Although a similar study has been done in the previous works for some other classes of transition systems [22,28,29], we run these experiments on the class of MDP models and report some positive and negative results concerning these cases.…”

Section: Contributionsmentioning

confidence: 92%

See 1 more Smart Citation

Improving modified policy iteration for probabilistic model checking

Mohagheghi¹,

Karimpour

2022

csci

View full text Add to dashboard Cite

Value iteration, policy iteration and their modified versions are well-known algorithms for probabilistic model checking of Markov Decision Processes. One the challenge of these methods is that they are time-consuming in most cases. Several techniques have been proposed to improve the performance of iterative methods for probabilistic model checking. However, the running time of these techniques depends on the graphical structure of the model and in some cases their performance is worse than the performance of the standard methods. In this paper, we propose two new heuristics to accelerate the modified policy iteration method. We first define a criterion for the usefulness of the computations of each iteration of this method. The first contribution of our work is to develop and use a criterion to reduce the number of iterations in modified policy iteration. As the second contribution, we propose a new approach to identify useless updates in each iteration. This method reduces the running time of computations by avoiding useless updates of states. The proposed heuristics have been implemented in the PRISM model checker and applied on several standard case studies. We compare the running time of our heuristics with the running time of previous standard and improved methods. Experimental results show that our techniques yields a significant speed-up.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Contributionsmentioning

confidence: 92%

Improving modified policy iteration for probabilistic model checking

Mohagheghi¹,

Karimpour

2022

csci

View full text Add to dashboard Cite

show abstract

“…It implies that one process or system can be replaced with its equivalent process or system. Such a notion of equivalence can be used to analyze the characteristics of the systems in terms of process algebra: It is possible to validate whether a system is realized with respect to its design and vice versa by verifying equivalence between the design and the system [30][31][32][33].…”

Section: Related Researchmentioning

confidence: 99%

A Process Algebraic Approach to Predict and Control Uncertainty in Smart IoT Systems for Smart Cities Based on Permissible Probabilistic Equivalence

Song,

Karagiannis,

Lee

2024

Sensors

View full text Add to dashboard Cite

Process algebra is one of the most suitable formal methods to model smart IoT systems for smart cities. Each IoT in the systems can be modeled as a process in algebra. In addition, the nondeterministic behavior of the systems can be predicted by defining probabilities on the choice operations in some algebra, such as PALOMA and PACSR. However, there are no practical mechanisms in algebra either to measure or control uncertainty caused by the nondeterministic behavior in terms of satisfiability of the system requirements. In our previous research, to overcome the limitation, a new process algebra called dTP-Calculus was presented to verify probabilistically the safety and security requirements of smart IoT systems: the nondeterministic behavior of the systems was defined and controlled by the static and dynamic probabilities. However, the approach required a strong assumption to handle the unsatisfied probabilistic requirements: enforcing an optimally arbitrary level of high-performance probability from the continuous range of the probability domain. In the paper, the assumption from the previous research is eliminated by defining the levels of probability from the discrete domain based on the notion of Permissible Process and System Equivalences so that satisfiability is incrementally enforced by both Permissible Process Enhancement in the process level and Permissible System Enhancement in the system level. In this way, the unsatisfied probabilistic requirements can be incrementally enforced with better-performing probabilities in the discrete steps until the final decision for satisfiability can be made. The SAVE tool suite has been developed on the ADOxx meta-modeling platform to demonstrate the effectiveness of the approach with a smart EMS (emergency medical service) system example, which is one of the most practical examples for smart cities. SAVE showed that the approach is very applicable to specify, analyze, verify, and especially, predict and control uncertainty or risks caused by the nondeterministic behavior of smart IoT systems. The approach based on dTP-Calculus and SAVE may be considered one of the most suitable formal methods and tools to model smart IoT systems for smart cities.

show abstract

“…The implementation performs on par with the most efficient similarity algorithm [29]. Given that among the hundreds of equivalence algorithms and tools most primarily address bisimilarity [19], a tool for coarser equivalences is a worthwhile addition. Although our previous algorithm [7] is able to solve the spectroscopy problem, its reliance on super-exponential partitions of the state space makes it ill-fit for transition tems with significant In comparison, new algorithm also needs less layer of complexity because it determines equivalences without constructing distinguishing formulas.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Process Equivalence Problems as Energy Games

Bisping

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We characterize all common notions of behavioral equivalence by one 6-dimensional energy game, where energies bound capabilities of an attacker trying to tell processes apart. The defender-winning initial credits exhaustively determine which preorders and equivalences from the (strong) linear-time–branching-time spectrum relate processes.The time complexity is exponential, which is optimal due to trace equivalence being covered. This complexity improves drastically on our previous approach for deciding groups of equivalences where exponential sets of distinguishing HML formulas are constructed on top of a super-exponential reachability game. In experiments using the VLTS benchmarks, the algorithm performs on par with the best similarity algorithm.

show abstract

Equivalence Checking 40 Years After: A Review of Bisimulation Tools

Cited by 6 publications

References 321 publications

Improving modified policy iteration for probabilistic model checking

Improving modified policy iteration for probabilistic model checking

A Process Algebraic Approach to Predict and Control Uncertainty in Smart IoT Systems for Smart Cities Based on Permissible Probabilistic Equivalence

Process Equivalence Problems as Energy Games

Contact Info

Product

Resources

About