標題: Titlebook: Automated Technology for Verification and Analysis; 8th International Sy Ahmed Bouajjani,Wei-Ngan Chin Conference proceedings 2010 Springer [打印本頁] 作者: 哥哥大傻瓜 時間: 2025-3-21 17:38
書目名稱Automated Technology for Verification and Analysis影響因子(影響力)
書目名稱Automated Technology for Verification and Analysis影響因子(影響力)學科排名
書目名稱Automated Technology for Verification and Analysis網(wǎng)絡公開度
書目名稱Automated Technology for Verification and Analysis網(wǎng)絡公開度學科排名
書目名稱Automated Technology for Verification and Analysis被引頻次
書目名稱Automated Technology for Verification and Analysis被引頻次學科排名
書目名稱Automated Technology for Verification and Analysis年度引用
書目名稱Automated Technology for Verification and Analysis年度引用學科排名
書目名稱Automated Technology for Verification and Analysis讀者反饋
書目名稱Automated Technology for Verification and Analysis讀者反饋學科排名
作者: commune 時間: 2025-3-21 22:03
Abstraction Learningact model that is then refined repeatedly whenever a counterexample is encountered. In this work, we present a dual approach which starts with a concrete model of the program but progressively abstracts away details but only when these are known to be irrelevant. We call this concept . (AL). In orde作者: TRAWL 時間: 2025-3-22 04:02 作者: 帶子 時間: 2025-3-22 04:33 作者: 輕快走過 時間: 2025-3-22 09:31
Using Redundant Constraints for Refinementrification of hybrid systems and more generally embedded systems with mixed continuous-discrete dynamics. In general, the reachable sets of such systems (except for some linear systems with special eigenstructures) are hard to compute exactly and are thus often over-approximated. The approximation a作者: inspiration 時間: 2025-3-22 14:48 作者: formula 時間: 2025-3-22 20:04
The Complexity of Codiagnosability for Discrete Event and Timed Systemsa (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete 作者: Ambulatory 時間: 2025-3-22 21:14 作者: 啞劇 時間: 2025-3-23 01:54 作者: choroid 時間: 2025-3-23 08:13 作者: 匍匐前進 時間: 2025-3-23 11:16
A Study of the Convergence of Steady State Probabilities in a Closed Fork-Join Networkanalysis is difficult. The study presented in this paper is motivated by the need to calculate performance measures for computer controlled (agile) manufacturing systems. We consider the manufacture of a class of products made from two components that are created by two parallel production lines. Th作者: 迎合 時間: 2025-3-23 15:10 作者: Efflorescent 時間: 2025-3-23 21:01 作者: ensemble 時間: 2025-3-24 01:23 作者: remission 時間: 2025-3-24 03:35
An Approach for Class Testing from Class Contractsnerate effective state based unit tests algorithmically for testing meaningful interactions between methods. Using an abstract state configuration for the object and an initial abstract state, we incrementally search for the methods those can be invoked in the current state and compute resulting abs作者: 花費 時間: 2025-3-24 09:27 作者: 石墨 時間: 2025-3-24 12:26 作者: capsule 時間: 2025-3-24 15:44
A Study of the Convergence of Steady State Probabilities in a Closed Fork-Join Network rates are modelled by exponential distributions associated with three timed transitions in the model. We use TimeNET to calculate the stationary token distribution of the GSPN for a wide range of the rates as . increases. This reveals that the steady state probabilities converge. We characterise th作者: Suppository 時間: 2025-3-24 22:08 作者: 團結(jié) 時間: 2025-3-25 01:56 作者: Alopecia-Areata 時間: 2025-3-25 03:40
Automated Technology for Verification and Analysis8th International Sy作者: orthodox 時間: 2025-3-25 07:39
International Political Economy Series. We study the automata-theoretic counterpart of prompt eventually. In a . automaton, a run . is accepting if there exists a bound . such that . visits an accepting state every at most . transitions. We study the expressive power of nondeterministic and deterministic prompt-Büchi automata, their pro作者: dominant 時間: 2025-3-25 15:31 作者: 刺激 時間: 2025-3-25 16:09
Global Energy and Electricity Futures rates are modelled by exponential distributions associated with three timed transitions in the model. We use TimeNET to calculate the stationary token distribution of the GSPN for a wide range of the rates as . increases. This reveals that the steady state probabilities converge. We characterise th作者: 不合 時間: 2025-3-25 20:31 作者: essential-fats 時間: 2025-3-26 03:52 作者: indubitable 時間: 2025-3-26 06:19 作者: 寒冷 時間: 2025-3-26 11:27 作者: 過度 時間: 2025-3-26 14:49 作者: 使迷醉 時間: 2025-3-26 19:12
Non-monotonic Refinement of Control Abstraction for Concurrent Programsr the control abstraction (of concurrent programs). Our approach employs a constraint solver to discover re-partitioning at each refinement step. An experimental evaluation of our non-monotonic control abstraction refinement on a collection of multi-threaded verification benchmarks indicates its effectiveness in practice.作者: Jogging 時間: 2025-3-26 22:13
International Political Economy Series upon loops. This abstraction will correspond to the strongest loop invariant we can discover. As in CEGAR, this abstraction is of a speculative nature: if the proof is unsuccessful, the abstraction is removed and we initiate a new attempt using a new depth bound.作者: 領(lǐng)袖氣質(zhì) 時間: 2025-3-27 01:24
Global Energy Demand in Transition(such as normal execution) and dynamic control flows (such as exceptions) within a single formalism. Following Stroustrup’s definition [15,9], our verification technique could ensure exception safety in terms of four guarantees of increasing quality, namely no-leak guarantee, basic guarantee, strong guarantee and no-throw guarantee.作者: ABYSS 時間: 2025-3-27 06:36
Abstraction Learning upon loops. This abstraction will correspond to the strongest loop invariant we can discover. As in CEGAR, this abstraction is of a speculative nature: if the proof is unsuccessful, the abstraction is removed and we initiate a new attempt using a new depth bound.作者: 不再流行 時間: 2025-3-27 11:57 作者: Brocas-Area 時間: 2025-3-27 14:17
Methods for Knowledge Based Controlling of Distributed Systemsthis synthesis method lies in calculating the knowledge based on the system that we want to control, and not on the resulted system. The original system has less knowledge, and as a result, we may introduce far more synchronization than needed. In this paper we show techniques to reduce this overhead.作者: Concrete 時間: 2025-3-27 17:53
The Complexity of Codiagnosability for Discrete Event and Timed Systemsin both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. Finally we address the codiagnosis problem for TA under bounded resources and show it is 2EXPTIME-complete.作者: AWRY 時間: 2025-3-28 00:46
Lattice-Valued Binary Decision Diagramschieve more compact representations. We introduce two canonical forms for . and present algorithms to symbolically compute their conjunction, disjunction and projection. We provide experimental evidence that this new data structure can outperform . for solving the finite-word LTL satisfiability problem.作者: 傻 時間: 2025-3-28 03:27 作者: 單純 時間: 2025-3-28 09:11
Emission of Atmospheric Particles,this synthesis method lies in calculating the knowledge based on the system that we want to control, and not on the resulted system. The original system has less knowledge, and as a result, we may introduce far more synchronization than needed. In this paper we show techniques to reduce this overhead.作者: Anthropoid 時間: 2025-3-28 12:16
https://doi.org/10.1007/978-3-319-12310-3in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. Finally we address the codiagnosis problem for TA under bounded resources and show it is 2EXPTIME-complete.作者: hallow 時間: 2025-3-28 16:17 作者: DAUNT 時間: 2025-3-28 21:10 作者: 有限 時間: 2025-3-29 01:55
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166359.jpg作者: BATE 時間: 2025-3-29 05:00
International Political Economy Series consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present an almost complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probab作者: 干涉 時間: 2025-3-29 08:17
International Political Economy Seriesact model that is then refined repeatedly whenever a counterexample is encountered. In this work, we present a dual approach which starts with a concrete model of the program but progressively abstracts away details but only when these are known to be irrelevant. We call this concept . (AL). In orde作者: Flat-Feet 時間: 2025-3-29 12:33
International Political Economy Seriesn satisfying a given regular specification. During fifty years since its introduction by Church, numerous extensions of the initial formulation have been considered. One particularly challenging case is that of distributed synthesis where a construction of a network of input/output automata is requi作者: ALIAS 時間: 2025-3-29 15:35 作者: Antioxidant 時間: 2025-3-29 23:18
Yuri Biondi,Marion Boisseau-Sierrarification of hybrid systems and more generally embedded systems with mixed continuous-discrete dynamics. In general, the reachable sets of such systems (except for some linear systems with special eigenstructures) are hard to compute exactly and are thus often over-approximated. The approximation a作者: 來這真柔軟 時間: 2025-3-30 02:02 作者: Odyssey 時間: 2025-3-30 05:24
https://doi.org/10.1007/978-3-319-12310-3a (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete 作者: vanquish 時間: 2025-3-30 09:41 作者: 方舟 時間: 2025-3-30 14:53
https://doi.org/10.1007/978-1-4899-1048-6oblem. We have implemented those new compositional algorithms, and we demonstrate that they are able to handle full . specifications that are orders of magnitude larger than the specifications that can be treated by the current state of the art algorithms.作者: GRAZE 時間: 2025-3-30 17:28
Forecast of the Global Electricity Marketicant properties of data structures such as lists and queues. We give a decision procedure for the quantifier-free fragment, based on an encoding into the first-order theory of concatenation; the procedure has PSPACE complexity. The quantifier-free fragment of the theory of sequences can express pro作者: wangle 時間: 2025-3-30 22:59
Global Energy and Electricity Futuresanalysis is difficult. The study presented in this paper is motivated by the need to calculate performance measures for computer controlled (agile) manufacturing systems. We consider the manufacture of a class of products made from two components that are created by two parallel production lines. Th作者: 難管 時間: 2025-3-31 03:17 作者: geriatrician 時間: 2025-3-31 09:01 作者: 冥想后 時間: 2025-3-31 12:42 作者: babble 時間: 2025-3-31 17:18
Global Energy Demand in Transitionnerate effective state based unit tests algorithmically for testing meaningful interactions between methods. Using an abstract state configuration for the object and an initial abstract state, we incrementally search for the methods those can be invoked in the current state and compute resulting abs作者: AND 時間: 2025-3-31 18:30
https://doi.org/10.1007/978-3-030-90008-3We present a method to enhance the power of a given reachability analysis engine for hybrid systems. The method works by a new form of composition of reachability analyses, each on a different relaxation of the input hybrid system. We present preliminary experiments that indicate its practical potential for checking safety and stability.作者: capsaicin 時間: 2025-4-1 00:42 作者: ANN 時間: 2025-4-1 02:02
Probabilistic Automata on Infinite Words: Decidability and Undecidability Results consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present an almost complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words.
