Foundation for a series of efficient simulation algorithms
International audience Compute the coarsest simulation preorder included in an initial preorder is used to reduce the resources needed to analyze a given transition system. This technique is applied on many models like Kripke structures, labeled graphs, labeled transition systems or even word and tr...
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | Conference Object |
| Language: | English |
| Published: |
HAL CCSD
2017
|
| Subjects: | |
| Online Access: | https://hal.archives-ouvertes.fr/hal-02129747 https://hal.archives-ouvertes.fr/hal-02129747/document https://hal.archives-ouvertes.fr/hal-02129747/file/2ec008c3-57bc-4488-bda8-9d8ac7f3af34-author.pdf |
| Summary: | International audience Compute the coarsest simulation preorder included in an initial preorder is used to reduce the resources needed to analyze a given transition system. This technique is applied on many models like Kripke structures, labeled graphs, labeled transition systems or even word and tree automata. Let (Q,→) be a given transition system and ℛinit be an initial preorder over Q. Until now, algorithms to compute ℛsim, the coarsest simulation included in ℛinit, are either memory efficient or time efficient but not both. In this paper we propose the foundation for a series of efficient simulation algorithms with the introduction of the notion of maximal transitions and the notion of stability of a preorder with respect to a coarser one. As an illustration we solve an open problem by providing the first algorithm with the best published time complexity, O(|Psim|.|→|), and a bit space complexity in O(|Psim|2.log(|Psim|)+|Q|.log(|Q|)), with Psim the partition induced by ℛsim. |
|---|