. . . "How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors" . "RIV/00216224:14330/06:00015453" . "\u010Cern\u00E1, Ivana" . . . "135" . "1571-0661" . "4"^^ . "How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors"@en . . "4"^^ . "Brim, Lubo\u0161" . "14330" . "RIV/00216224:14330/06:00015453!RIV10-GA0-14330___" . "478302" . "P(1ET408050503), P(1M0545), P(GA201/03/0509), P(GD102/05/H050), Z(MSM0021622419)" . "\u0160im\u0161a, Ji\u0159\u00ED" . . . "Moravec, Pavel" . "PT - Portugalsk\u00E1 republika" . . "accepting predecessors; LTL model checking"@en . . "The distributed automata-based LTL model-checking relies on algorithms for finding accepting cycles in a B\\"{u}chi automaton. One approach to distributed accepting cycle detection is based on maximal accepting predecessors. The ordering of accepting states (hence the maximality) is one of the main factors affecting the overall complexity of model-checking as imperfect ordering can enforce numerous re-explorations of the automaton. This paper addresses the problem of finding an optimal ordering, proves its hardness, and gives several heuristics for finding an optimal ordering in the distributed environment. We compare the heuristics both theoretically and experimentally, and find out which of these work well." . . . "Electronic Notes in Theoretical Computer Science" . . . . "How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors" . "The distributed automata-based LTL model-checking relies on algorithms for finding accepting cycles in a B\\"{u}chi automaton. One approach to distributed accepting cycle detection is based on maximal accepting predecessors. The ordering of accepting states (hence the maximality) is one of the main factors affecting the overall complexity of model-checking as imperfect ordering can enforce numerous re-explorations of the automaton. This paper addresses the problem of finding an optimal ordering, proves its hardness, and gives several heuristics for finding an optimal ordering in the distributed environment. We compare the heuristics both theoretically and experimentally, and find out which of these work well."@en . . . "15"^^ . "2" . "How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors"@en . . . . "[18083FC1EC79]" . . .