Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Minimal state graph generation
Science of Computer Programming
Model Checking and Modular Verification
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Propositional Temporal Logics and Equivalences
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Minimization of Timed Transition Systems
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Analysis of Timed Systems Based on Time-Abstracting Bisimulation
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Verification of timed automata based on similarity
Fundamenta Informaticae
Checking reachability properties for timed automata via SAT
Fundamenta Informaticae - Concurrency specification and programming
Minimization Algorithms for Time Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Improvements in SAT-based Reachability Analysis for Timed Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Bounded Model Checking for the Existential Fragment of TCTL_{-G} and Diagonal Timed Automata
Fundamenta Informaticae
Bounded Model Checking for the Existential Fragment of TCTL$_{-G}$ and Diagonal Timed Automata
Fundamenta Informaticae
Minimization Algorithms for Time Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Improvements in SAT-based Reachability Analysis for Timed Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Checking Reachability Properties for Timed Automata via SAT
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Verification of Timed Automata Based on Similarity
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
| Hi-index | 0.00 |
The paper shows how to use partitioning techniques to generate abstract state spaces (models) preserving similarity and injectivity. Since these relations are weaker than bisimilarity and surjectivity, our algorithms generate smaller models. This method can be applied for improving several existing partitioning algorithms used for generating finite models of concurrent programs, Time Petri Nets and Timed Automata.