抛媚眼
发表于 2025-3-27 00:45:32
http://reply.papertrans.cn/99/9827/982610/982610_31.png
Anthropoid
发表于 2025-3-27 04:40:21
Keith A. Earle,Alex I. Smirnovquence of monitorable observations whether the system is about to exit the ODD. We particularly investigate the learning of optimal monitors based on counterexample-guided refinement and conformance testing. We evaluate the applicability of our approach on a case study from the domain of autonomous
VAN
发表于 2025-3-27 07:54:34
http://reply.papertrans.cn/99/9827/982610/982610_33.png
良心
发表于 2025-3-27 13:07:41
Marion C. Thurnauer,Oleg G. Poluektov,Gerd KotheEach submission was assigned to three Program Comm- tee members, who could request help from subreviewers, for rigorous and fair evaluation. The ?nal deliberation by the Program Committee was conducted through Springer’s Online Conference Service for a duration of about 10 days after nearly all revi
摸索
发表于 2025-3-27 16:20:39
Alain Borel,Lothar Helm,André E. Merbachties in MDPs. In contrast with other related techniques, our approach is not restricted to time-bounded (finite-horizon) or discounted properties, nor does it assume any particular properties of the MDP. We also show how our methods extend to LTL objectives. We present experimental results showing t
让步
发表于 2025-3-27 19:43:34
http://reply.papertrans.cn/99/9827/982610/982610_36.png
储备
发表于 2025-3-27 23:11:15
Edgar J. J. Groenen,Jan Schmidtask. Simple automated systems can be trusted if their trustworthiness can match the desired degree of criticality. Nonetheless, the acceptance of autonomous systems to perform complex critical tasks will additionally depend on their ability to exhibit symbiotic behavior and allow harmonious collabor
矛盾心理
发表于 2025-3-28 02:42:21
Daniella Goldfarb,Vladimir Krymove show that deciding whether a sketch can be completed falls into the complexity class . and present two SAT-based sketching algorithms. Finally, we implement a prototype with our algorithms and compare it against two prominent LTL miners to demonstrate the benefits of using LTL sketches.
Magnitude
发表于 2025-3-28 07:17:31
David E. Budil,Keith A. Earlerability of regular languages by a DFA of a given size. Unlike DFA minimization, which can be solved in polynomial time, separation is NP-complete, and thus the certification approach is essential. In addition, we prove NP-completeness of a strict version of separation.
Latency
发表于 2025-3-28 13:40:37
http://reply.papertrans.cn/99/9827/982610/982610_40.png