Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Statecharts: A visual formalism for complex systems
Science of Computer Programming
Proceedings of the Fourth Annual Symposium on Logic in computer science
Verification of synchronous sequential machines based on symbolic execution
Proceedings of the international workshop on Automatic verification methods for finite state systems
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Requirements Specification for Process-Control Systems
IEEE Transactions on Software Engineering
Model checking large software specifications
SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
Tearing based automatic abstraction for CTL model checking
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Symbolic Model Checking
Partial Model Checking with ROBDDs
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A Compositional Proof of a Real-Time Mutual Exclusion Protocol
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Verifying Temporal Properties of Sequential Machines Without Building their State Diagrams
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
An Iterative Approach to Language Containment
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Efficient Model Checking by Automated Ordering of Transition Relation Partitions
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Automatic Abstraction Techniques for Propositional µ-calculus Model Checking
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Synchronized Parallel Composition of Event Systems in B
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
An automatic method for the dynamic construction of abstractions of states of a formal model
Cybernetics and Systems Analysis
An artifact-centric approach to generating web-based business process driven user interfaces
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
A practice-driven systematic review of dependency analysis solutions
Empirical Software Engineering
An artifact-centric view-based approach to modeling inter-organizational business processes
WISE'11 Proceedings of the 12th international conference on Web information system engineering
Formalization of fFSM model and its verification
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Avoidance of state explosion using dependency analysis in model checking control flow model
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Color-Blind specifications for transformations of reactive synchronous programs
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Automated verification of executable UML models
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
A framework for behavior-consistent specialization of artifact-centric business processes
BPM'12 Proceedings of the 10th international conference on Business Process Management
| Hi-index | 0.00 |
A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems. This paper introduces a technique that uses compositionality and dependency analysis to significantly improve the efficiency of symbolic model checking of state/event models. It makes possible automated verification of large industrial designs with the use of only modest resources (less than 5 minutes on a standard PC for a model with 1421 concurrent machines). The results of the paper are being implemented in the next version of the commercial tool visualSTATETM.