Foundation for a series of efficient simulation algorithms

• Main Author: Cece, Gérard
• Other Authors: Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté COMUE (UBFC)-Université Bourgogne Franche-Comté COMUE (UBFC)-Centre National de la Recherche Scientifique (CNRS)
• Format: Conference Object
• Language: English
• Published: HAL CCSD 2017
• Subjects: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]; [INFO.INFO-DC]Computer Science [cs]/Distributed; Parallel; and Cluster Computing [cs.DC]; [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]; [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing; [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]; [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation; [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]; Iceland
• 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

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.