作者: 使成核 時(shí)間: 2025-3-21 22:04
Regular Strategies in Pushdown Reachability Games,proach that builds upon the popular saturation technique. Saturation for analysing pushdown systems has been successfully implemented by Moped and WALi. Thus, our approach has the potential for practical applications to controller-synthesis problems.作者: 送秋波 時(shí)間: 2025-3-22 00:23
Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations,ness of the procedure by a categorical presentation of rewrite rules as well as the involved order, and using results for well-structured transition systems. We apply the resulting procedure to the analysis of the Distributed Dining Philosophers protocol on an arbitrary network structure.作者: 虛弱 時(shí)間: 2025-3-22 07:05 作者: insipid 時(shí)間: 2025-3-22 09:04 作者: 消散 時(shí)間: 2025-3-22 15:29
Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions,lities, we adapt the game-based abstraction refinement method. In the parametric setting, our method is able to determine all the possible maximum (or minimum) reachability probabilities that arise for different values of timing parameters, and yields optimal valuations represented as a set of symbolic constraints between parameters.作者: paradigm 時(shí)間: 2025-3-22 20:44 作者: 性上癮 時(shí)間: 2025-3-22 22:02
0302-9743 2014. The 17 papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains a paper summarizing the invited talk. The papers offer new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and co作者: 咽下 時(shí)間: 2025-3-23 05:13
Integer Vector Addition Systems with States,Most interestingly, it turns out that while the addition of reset operations to ordinary VASS leads to undecidability and Ackermann-hardness of reachability and coverability, respectively, they can be added to ?-VASS while retaining .-completeness of both coverability and reachability.作者: 笨拙的我 時(shí)間: 2025-3-23 09:14
Mean-Payoff Games with Partial-Observation,le-forming game. This yields several decidable classes of mean-payoff games of asymmetric information that require only finite-memory strategies, including a generalization of perfect information games where positional strategies are sufficient. We give an exponential time algorithm for determining the winner of the latter.作者: DUST 時(shí)間: 2025-3-23 12:57
Complexity Bounds for Ordinal-Based Termination,t of program termination proofs, with an eye to deriving complexity bounds on program running times..Our main tool for this are ., which provide complexity bounds on the use of well quasi orders. We illustrate how to prove such theorems in the simple yet until now untreated case of ordinals. We show作者: Aprope 時(shí)間: 2025-3-23 15:51 作者: DEVIL 時(shí)間: 2025-3-23 21:02
Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives,d a bounded 3-dimensional Restricted Hierarchical PCD (3-RHPCD). Both problems are shown to be in PSPACE, even for .-dimensional RHPCD. This is a restricted model with similarities to other models in the literature such as stopwatch automata, rectangular automata and PCDs. We also show that for an u作者: Infiltrate 時(shí)間: 2025-3-24 00:58 作者: refine 時(shí)間: 2025-3-24 04:24
Regular Strategies in Pushdown Reachability Games,e. Such automata read the stack and control state of a given pushdown configuration and output the set of winning moves playable from that position..This result can originally be attributed to Kupferman, Piterman and Vardi using an approach based on two-way tree automata. We present a more direct ap作者: 悅耳 時(shí)間: 2025-3-24 09:10 作者: insolence 時(shí)間: 2025-3-24 12:22
Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic,lity problem for Presburger arithmetic. The lower bound already holds with the temporal operator EF only, no arithmetical constraints in the logical language and with guards on transitions made of simple linear constraints. This complements our understanding of model-checking flat counter systems wi作者: 任意 時(shí)間: 2025-3-24 15:10
Synthesising Succinct Strategies in Safety and Reachability Games,etting of games, and rely on the notion of ., which is used to formalise natural relations that exist between the states of those games in many applications. In particular, our techniques apply to the realisability problem of LTL [8], to the synthesis of real-time schedulers for multiprocessor platf作者: 我沒(méi)有命令 時(shí)間: 2025-3-24 22:17 作者: 健壯 時(shí)間: 2025-3-25 03:04 作者: 指派 時(shí)間: 2025-3-25 06:43
On the Expressiveness of Metric Temporal Logic over Bounded Timed Words,ise semantics over bounded time domains (i.e., timed words of bounded duration) [15]. In this paper, we present an extension of . which has the same expressive power as (.[<, +1]) in both the pointwise and continuous semantics over bounded time domains.作者: OWL 時(shí)間: 2025-3-25 11:09
Trace Inclusion for One-Counter Nets Revisited,ural subclass of both One-Counter Automata, which allow zero-tests and Petri Nets/VASS, which allow multiple such weak counters. The trace inclusion problem has recently been shown to be undecidable for OCN. In this paper, we contrast the complexity of two natural restrictions which imply decidabili作者: 踉蹌 時(shí)間: 2025-3-25 15:08
Mean-Payoff Games with Partial-Observation,paper we investigate the algorithmic properties of several subclasses of mean-payoff games where the players have asymmetric information about the state of the game. These games are in general undecidable and not determined according to the classical definition. We show that such games are determine作者: Ondines-curse 時(shí)間: 2025-3-25 19:17
Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions,some set of states is either maximised or minimised. Our first algorithm, based on forward exploration of the symbolic states, can only guarantee parameter values that correspond to upper (resp. lower) bounds on maximum (resp. minimum) reachability probability. To ensure precise reachability probabi作者: labyrinth 時(shí)間: 2025-3-25 22:23
Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems,riants as well as discovery of meaningful predicates in CEGAR loops based on predicate abstraction. Extending such algorithms from the qualitative to the quantitative setting of probabilistic models seems desirable. In 2012, Teige et al. [1] succeeded to define an adequate notion of generalized, sto作者: 典型 時(shí)間: 2025-3-26 03:29 作者: 共同時(shí)代 時(shí)間: 2025-3-26 08:12 作者: 盡管 時(shí)間: 2025-3-26 12:20 作者: Motilin 時(shí)間: 2025-3-26 14:49
Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic,anguage and with guards on transitions made of simple linear constraints. This complements our understanding of model-checking flat counter systems with linear-time temporal logics, such as LTL for which the problem is already known to be (only) NP-complete with guards restricted to the linear fragment.作者: 暫時(shí)過(guò)來(lái) 時(shí)間: 2025-3-26 17:57
0302-9743 invited talk. The papers offer new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.978-3-319-11438-5978-3-319-11439-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 擁護(hù)者 時(shí)間: 2025-3-26 22:01 作者: 不透明 時(shí)間: 2025-3-27 02:35 作者: Anonymous 時(shí)間: 2025-3-27 08:45
Sylvain Schmitzwork is presented here, along with an associated system, both based on the combination of two kinds of capabilities: . a series of modular and flexible data-transformation mechanisms, for producing an enhanced process-oriented log view, and . several induction techniques, for extracting a prediction作者: 改變 時(shí)間: 2025-3-27 09:58
Hugo Bazille,Olivier Bournez,Walid Gomaa,Amaury Poulyults are: (i) few approaches lead to “Conflict Identification and Resolution”, an activity responsible for discovering and treating the mutual influence between different concerns existing in a software; (ii) there is a lack of evaluation studies about already existing AORE approaches; (iii) the mos作者: enmesh 時(shí)間: 2025-3-27 17:26
Paul C. Bell,Shang Chen,Lisa Jacksonealing to people outside the evolutionary computation community, and therefore a valuable tool in the eld of enterprise information systems. Initial empirical evaluation of the peer to peer architecture demonstrates better harnessing of the available resources, as well as added robustness and improv作者: Budget 時(shí)間: 2025-3-27 19:16 作者: novelty 時(shí)間: 2025-3-27 23:02 作者: Aspiration 時(shí)間: 2025-3-28 05:10
Giorgio Delzanno,Jan Stückrathzontal (value-based) partitioning approach for message batch creation and show how to compute the optimal waiting time. This approach significantly reduces the total execution time of a message sequence and hence, it maximizes the throughput, while accepting moderate latency time.作者: thalamus 時(shí)間: 2025-3-28 09:20 作者: acclimate 時(shí)間: 2025-3-28 12:19 作者: 懶惰人民 時(shí)間: 2025-3-28 17:18
Christoph Haase,Simon Halfonrent categories of experiments are used to assess the effectiveness of the proposed solution, demonstrating its applicability on a variety of programs and type of errors. The results are quite encouraging suggesting that the approach is able to dynamically detect faults and propose the appropriate c作者: Hiatus 時(shí)間: 2025-3-28 21:12 作者: 漂浮 時(shí)間: 2025-3-29 00:33 作者: vibrant 時(shí)間: 2025-3-29 06:40 作者: FUSC 時(shí)間: 2025-3-29 07:24 作者: 維持 時(shí)間: 2025-3-29 14:49
Aleksandra Jovanovi?,Marta Kwiatkowskafferent features including 16 SOA DPs and their compounds that are related to the service messaging category. Its objective to enable developers to generate fully functional, valid, DP-based and highly customized SPs for different communication technologies. Through a practical case study and a deve作者: 闖入 時(shí)間: 2025-3-29 17:33
J. Leroux,Ph. Schnoebelense it allows to identify conceptual structures in data sets, through conceptual lattice and implications. A specific set of implications, know as proper implications, represent the set of conditions to reach a specific goal. So, in this work, we proposed a FCA-based approach to identify and analyze 作者: 致命 時(shí)間: 2025-3-29 21:39 作者: Camouflage 時(shí)間: 2025-3-30 00:18 作者: 騎師 時(shí)間: 2025-3-30 05:03
Julian Rathke,Pawe? Sobociński,Owen Stephensregular expressions and an ad hoc two-dimensional grammar. The execution of .. reasoning modules, encoding the grammar expressions, yields the actual extraction of information from the input document. H.L.X allows the semantic information extraction from both HTML pages and flat text documents by us作者: amyloid 時(shí)間: 2025-3-30 08:51 作者: 挑剔小責(zé) 時(shí)間: 2025-3-30 13:52 作者: allude 時(shí)間: 2025-3-30 20:26
Reachability in MDPs: Refining Convergence of Value Iteration,n of MDPs, we address these problems. First we introduce an ., for which the stopping criterion is straightforward. Then we exhibit convergence rate. Finally we significantly improve the bound on the number of iterations required to get the exact values.作者: 委派 時(shí)間: 2025-3-30 20:43 作者: 誘使 時(shí)間: 2025-3-31 01:35 作者: Esophagitis 時(shí)間: 2025-3-31 08:30 作者: GILD 時(shí)間: 2025-3-31 09:26 作者: 發(fā)電機(jī) 時(shí)間: 2025-3-31 13:22 作者: OWL 時(shí)間: 2025-3-31 18:41 作者: CLEAR 時(shí)間: 2025-3-31 23:52 作者: Clumsy 時(shí)間: 2025-4-1 05:53 作者: frozen-shoulder 時(shí)間: 2025-4-1 08:26
