Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
SIAM Journal on Computing
Model checking
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Graph Visualization and Navigation in Information Visualization: A Survey
IEEE Transactions on Visualization and Computer Graphics
Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Proving Safety Properties by Integrating Static Analysis, Theorem Proving and Abstraction
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
CLPS-B - A Constraint Solver for B
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
On the Use of Visualization in Formal Requirements Specification
RE '02 Proceedings of the 10th Anniversary IEEE Joint International Conference on Requirements Engineering
Computing Abstractions of Infinite State Systems Compositionally and Automatically
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Abstract and Model Check While You Prove
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Visualization of State Transition Graphs
INFOVIS '01 Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01)
Minimizing finite automata is computationally hard
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Large state space visualization
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Visual Analysis of Multivariate State Transition Graphs
IEEE Transactions on Visualization and Computer Graphics
TFM '09 Proceedings of the 2nd International Conference on Teaching Formal Methods
Guiding the correction of parameterized specifications
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Validating Z specifications using the PROB animator and model checker
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Building a test-ready abstraction of a behavioral model using CLP
TAP'10 Proceedings of the 4th international conference on Tests and proofs
Automatic flow analysis for event-B
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Generating Hierarchical State Based Representation From Event-B Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic refinement checking for b
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Multi-process systems analysis using event b: application to group communication systems
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Interactive state-transition diagrams for visualization of multimodal annotation
Intelligent Data Analysis
| Hi-index | 0.00 |
ProB is an animator and model checker for the B method. It also allows to visualise the state space of a B machine in graphical way. This is often very useful and allows users to quickly spot whether the machine behaves as expected. However, for larger state spaces the visualisation quickly becomes difficult to grasp by users (and the computation of the graph layout takes considerable time). In this paper we present two relatively simple algorithms to often considerably reduce the complexity of the graphs, while still keeping relevant information. This makes it possible to visualise much larger state spaces and gives the user immediate feedback about the overall behaviour of a machine. The algorithms have been implemented within the ProB toolset and we highlight their potential on several examples. We also conduct a thorough experimentation of the algorithm on 47 B machines and analyse the results.