Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Model Checking Based on Simultaneous Reachability Analysis
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
An improvement in formal verification
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
An Optimizing Compiler for Efficient Model Checking
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
State Space Reduction by Proving Confluence
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Compressing Transitions for Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Combining Partial Order Reductions with On-the-fly Model-Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Partial-Order Validation for Multi-Process Protocols Modeled as Communicating Finite State Machines
ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
A Blocking-based Approach to Protocol Validation
The Computer Journal
Error-preserving reductions on communication protocols
Software Testing, Verification & Reliability
Partial Order Reductions Using Compositional Confluence Detection
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Cartesian partial-order reduction
Proceedings of the 14th international SPIN conference on Model checking software
Research: Protocol validation by simultaneous reachability analysis
Computer Communications
Improving Partial Order Reductions for Universal Branching Time Properties
Fundamenta Informaticae
| Hi-index | 0.00 |
Recently, two transformations were proposed for modifying a member of a closed system of communicating state machines (CSMs) without considering the other CSMs and nevertheless securing that after the modification, the system can reach the same dead states and overfill the same channels, where channels are assumed to be error-free unidirectional first-in-first-out queues. When verifying the general correctness properties of a communication protocol whose specification is such a system, one can employ the two error-preserving local transformations (EPLTs) for simplifying individual CSMs and thereby the subsequent reachability analysis. The paper proves four new simple EPLTs and a generic EPLT which strongly generalizes all the six EPLTs and from which further easily applicable EPLTs can be derived simply by specialization. For each of the EPLTs, it also discusses how (non-)executability of CSM transitions in the new system version reflects (non-)executability of those in the old one. Copyright © 2011 John Wiley & Sons, Ltd.