標題: Titlebook: Automata, Languages and Programming; 36th International C Susanne Albers,Alberto Marchetti-Spaccamela,Wolfga Conference proceedings 2009 Sp [打印本頁] 作者: CK828 時間: 2025-3-21 19:33
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學(xué)科排名
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學(xué)科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學(xué)科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學(xué)科排名
作者: 高爾夫 時間: 2025-3-21 21:39 作者: patriarch 時間: 2025-3-22 01:06
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Typesystem that, given a process ., tries to extract a spatial-behavioural type ., in the form of a . term that is logically equivalent to the given process. Using techniques based on well-structured transition systems, we then prove that, for an interesting fragment of the considered logic, satisfiabili作者: Daily-Value 時間: 2025-3-22 08:24
When Are Timed Automata Determinizable?rove that under a certain boundedness condition, the infinite timed tree can be reduced into a classical . timed automaton. The boundedness condition is satisfied by several subclasses of timed automata, some of them were known to be determinizable (event-clock timed automata, automata with integer 作者: overbearing 時間: 2025-3-22 11:34
Faithful Loops for Aperiodic E-Ordered Monoidstheorem [10]. This theorem states that there exists a bijection between varieties of regular languages and varieties of finite monoids. For example, the variety of star-free regular languages (the closure of finite languages under Boolean operations and concatenation) is related to the monoid variet作者: ureter 時間: 2025-3-22 12:52
Semilinear Program Feasibilityalgebraic structure . where . are the real numbers and ..,..,... is an enumeration of all linear relations with rational coefficients, we prove that a semilinear relation . (i.e., a relation that is first-order definable with linear inequalities) either has a quantifier-free Horn definition in . or 作者: POWER 時間: 2025-3-22 18:26
Floats and Ropes: A Case Study for Formal Numerical Program Verificationunding the rounding error was tricky as the usual idea, that is to bound the absolute value of the error at each step, fails. Our idea is to find out a precise analytical expression that cancels with itself at the next step, and to formally prove the correctness of this approach.作者: Robust 時間: 2025-3-23 01:09
Reachability in Stochastic Timed Games a natural way continuous-time Markov decision processes. We focus on the reachability problem for these games, and ask whether one of the players has a strategy to ensure that the probability of reaching a fixed set of states is equal to (or below, resp. above) a certain number?., whatever the seco作者: 滔滔不絕地講 時間: 2025-3-23 01:37 作者: 作嘔 時間: 2025-3-23 09:01 作者: 欲望 時間: 2025-3-23 10:55 作者: 放肆的你 時間: 2025-3-23 15:18
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automataaton when both the Büchi and the Rabin condition label transitions rather than states. This lower bound exactly matches the known upper bound to this problem. The function hist(.) is in .((1.64.).) and in .((1.65.).)..Our result entails a lower bound of hist(.???1) when the input Büchi automaton has作者: Monotonous 時間: 2025-3-23 19:04 作者: 都相信我的話 時間: 2025-3-24 00:09
On Regular Temporal Logics with Past,d the closely related ., SVA for short, are increasingly used in many phases of the hardware design cycle, from specification to verification. In this paper, we extend the common core of these specification languages with past operators. We name this extension RTL. Although all .-regular properties 作者: manifestation 時間: 2025-3-24 06:05 作者: receptors 時間: 2025-3-24 10:35
Qualitative Concurrent Stochastic Games with Imperfect Informationnd, the two players choose, . and ., an action. Then a successor state is chosen accordingly to some fixed probability distribution depending on the previous state and on the pair of actions chosen by the players. Imperfect information is modeled as follows: both players have an equivalence relation作者: GRIN 時間: 2025-3-24 14:43
Diagrammatic Confluence and Completionion method which proof-reduction relation transforms arbitrary proofs into rewrite proofs even in presence of non-terminating reductions. Unlike previous methods, no ordering of the set of terms is required, but can be used if available. Unlike ordered completion, rewrite proofs are closed under ins作者: 財產(chǎn) 時間: 2025-3-24 17:04 作者: Commentary 時間: 2025-3-24 23:03 作者: 牽索 時間: 2025-3-25 01:43
Qualitative Concurrent Stochastic Games with Imperfect Information.: decide whether the first player has a strategy that ensures her to almost-surely win against . possible strategy of her oponent. We also characterise those strategies needed by the first player to almost-surely win.作者: 母豬 時間: 2025-3-25 04:03 作者: cajole 時間: 2025-3-25 09:27 作者: 新娘 時間: 2025-3-25 15:02
0302-9743 gram Committees based on originality, quality, and relevance to theoretical computer science. The quality of the manuscripts was very high indeed, and many dese- ing papers could not be selected. ICALP 2009 consisted of ?ve invited lectures and the contributed papers.978-3-642-02929-5978-3-642-02930-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 審問,審訊 時間: 2025-3-25 17:14
,übersicht über aussetzende Getriebe,f the size of the resulting nondeterministic Büchi automata as the existing translations for PSL and SVA. Consequently, the satisfiability and the model-checking problem for RTL fall into the same complexity classes as the corresponding problems for PSL and SVA. From the translation it also follows 作者: Ascendancy 時間: 2025-3-25 23:08
Walther Meyer zur Capellen,Erhard Schreiber.: decide whether the first player has a strategy that ensures her to almost-surely win against . possible strategy of her oponent. We also characterise those strategies needed by the first player to almost-surely win.作者: FICE 時間: 2025-3-26 01:26
A Survey of Stochastic Games with Limsup and Liminf Objectivesinite path that can be achieved by resolving the decisions of the first player. We present the complexity of computing values of stochastic games and their subclasses, and the complexity of optimal strategies in such games.作者: 增長 時間: 2025-3-26 06:17
Tractable Optimization Problems through Hypergraph-Based Structural Restrictionsmial time. In this paper, larger classes of tractable instances are singled out, by discussing solution approaches based on exploiting hypergraph acyclicity and, more generally, structural decomposition methods, such as (hyper)tree decompositions.作者: vector 時間: 2025-3-26 11:14 作者: 使混合 時間: 2025-3-26 16:13 作者: 音樂學(xué)者 時間: 2025-3-26 20:38 作者: Implicit 時間: 2025-3-26 20:57
Hubschrauberrotoren und ihre Antriebe,ng CSPs are either in P or are NP-complete depending on the choice of allowed relations. We apply this result to two concrete examples (generalised linear programming and metric temporal reasoning) and obtain full complexity dichotomies in both cases.作者: dura-mater 時間: 2025-3-27 03:56
https://doi.org/10.1007/978-3-642-92601-3umber of beta steps to normal form is polynomially related to the actual cost (that is, as performed on a Turing machine) of normalization, under weak call-by-value reduction. Orthogonal constructor term rewrite systems and lambda-calculus are thus both polynomially related to Turing machines, taking as notion of cost their natural parameters.作者: recession 時間: 2025-3-27 05:50
https://doi.org/10.1007/978-3-658-12759-6 that the resource usage verification for functional programs can be reduced to the model checking of recursion schemes. As an application, we show that the resource usage verification problem is (.???1)-EXPTIME complete.作者: lactic 時間: 2025-3-27 10:10
When Are Timed Automata Determinizable?ons, we get for those classes the decidability of the universality and of the inclusion problems, and compute their complexities (the inclusion problem is for instance EXPSPACE-complete for strongly non-Zeno timed automata).作者: Corporeal 時間: 2025-3-27 16:20 作者: MOAT 時間: 2025-3-27 20:08
On Constructor Rewrite Systems and the Lambda-Calculusumber of beta steps to normal form is polynomially related to the actual cost (that is, as performed on a Turing machine) of normalization, under weak call-by-value reduction. Orthogonal constructor term rewrite systems and lambda-calculus are thus both polynomially related to Turing machines, taking as notion of cost their natural parameters.作者: 浮雕 時間: 2025-3-27 22:16
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus that the resource usage verification for functional programs can be reduced to the model checking of recursion schemes. As an application, we show that the resource usage verification problem is (.???1)-EXPTIME complete.作者: 我要沮喪 時間: 2025-3-28 04:16 作者: idiopathic 時間: 2025-3-28 07:36
Stirnr?der, Gestaltung und Berechnungmial time. In this paper, larger classes of tractable instances are singled out, by discussing solution approaches based on exploiting hypergraph acyclicity and, more generally, structural decomposition methods, such as (hyper)tree decompositions.作者: 藕床生厭倦 時間: 2025-3-28 12:59
Hubschrauberrotoren und ihre Antriebe,nd player does. We show that the problem is undecidable in general, but that it becomes decidable if we restrict to single-clock 1.-player games and ask whether the player can ensure that the probability of reaching the set is =1 (or >0, =0).作者: 薄荷醇 時間: 2025-3-28 15:09
Schwingungen in Schiffsgetriebe-Anlagen,y and generally. (ii) A new and flexible approach to approximation based on averaging can be given. This vastly generalizes and streamlines the idea of using conditional expectations to compute approximation. (iii) It is possible to show that there is a minimal bisimulation equivalent to a process obtained as the limit of the finite approximants.作者: 強有力 時間: 2025-3-28 22:42 作者: 悅耳 時間: 2025-3-29 00:23
Verwendung, Vergleiche und Grundgleichungens. Using techniques based on well-structured transition systems, we then prove that, for an interesting fragment of the considered logic, satisfiability (.???.) is decidable for types. As a consequence of logical equivalence between types and processes, we obtain decidability of this fragment of the logic for all well-typed pi-processes.作者: 嫻熟 時間: 2025-3-29 03:48
https://doi.org/10.1007/978-3-662-36957-9he variety of star-free regular languages (the closure of finite languages under Boolean operations and concatenation) is related to the monoid variety of aperiodic monoids (those with no nontrivial subgroups)[21].作者: 束縛 時間: 2025-3-29 10:27
Schwingungen in Schiffsgetriebe-Anlagen,, when . is a lattice of regular languages closed under quotients, or a ., as we call it in the sequel. The term “equational description” refers to a recent paper [5], where it was shown that any lattice of regular languages can be defined by a set of profinite equations. More formally, our main result can be stated as follows:作者: 反感 時間: 2025-3-29 12:22 作者: nettle 時間: 2025-3-29 17:36
,?lhydraulische und pneumatische Getriebe,problem. The function hist(.) is in .((1.64.).) and in .((1.65.).)..Our result entails a lower bound of hist(.???1) when the input Büchi automaton has its Büchi acceptance condition labeling states (as it is usual). Those lower bounds remain when the output deterministic Rabin automaton has its Rabin acceptance condition labeling states.作者: overture 時間: 2025-3-29 20:20
Walther Meyer zur Capellen,Erhard Schreiberes exactly when . is an ..., a new robust class of WSTS. We show that our procedure terminates in more cases than the generalized Karp-Miller procedure on extensions of Petri nets. We characterize the WSTS where our procedure terminates as those that are .. Finally, we apply this to well-structured counter systems.作者: Proclaim 時間: 2025-3-30 02:38 作者: creatine-kinase 時間: 2025-3-30 08:06
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Typess. Using techniques based on well-structured transition systems, we then prove that, for an interesting fragment of the considered logic, satisfiability (.???.) is decidable for types. As a consequence of logical equivalence between types and processes, we obtain decidability of this fragment of the logic for all well-typed pi-processes.作者: Locale 時間: 2025-3-30 09:39 作者: 創(chuàng)新 時間: 2025-3-30 15:46
Equations Defining the Polynomial Closure of a Lattice of Regular Languages, when . is a lattice of regular languages closed under quotients, or a ., as we call it in the sequel. The term “equational description” refers to a recent paper [5], where it was shown that any lattice of regular languages can be defined by a set of profinite equations. More formally, our main result can be stated as follows:作者: Inflated 時間: 2025-3-30 19:11
The Theory of Stabilisation Monoids and Regular Cost Functionsdeterminism is a weakening of the standard notion of determinism, that replaces it in this context), and a suitable notion of recognisability by stabilisation monoids. We also provide closure and decidability results.作者: 放肆的你 時間: 2025-3-30 23:38
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automataproblem. The function hist(.) is in .((1.64.).) and in .((1.65.).)..Our result entails a lower bound of hist(.???1) when the input Büchi automaton has its Büchi acceptance condition labeling states (as it is usual). Those lower bounds remain when the output deterministic Rabin automaton has its Rabin acceptance condition labeling states.作者: 怕失去錢 時間: 2025-3-31 03:11 作者: 灌輸 時間: 2025-3-31 08:00
Diagrammatic Confluence and Completionous methods, no ordering of the set of terms is required, but can be used if available. Unlike ordered completion, rewrite proofs are closed under instantiation. Examples are presented, including Kleene’s and Huet’s classical examples showing that non-terminating local-confluent relations may not be confluent.作者: mortuary 時間: 2025-3-31 09:36
Conference proceedings 2009. ICALP is a series of annual conferences of the European Association for Theoretical Computer Science (EATCS) which ?rst took place in 1972. This year, the ICALP program consisted of the established track A (focusing on algorithms, complexity and games) and track B (focusing on logic, automata, sem作者: 實現(xiàn) 時間: 2025-3-31 16:55
Verwendung, Vergleiche und GrundgleichungenWe prove that the boundedness problem for monadic second-order logic over the class of all finite words is decidable.作者: 侵害 時間: 2025-3-31 20:45 作者: Lime石灰 時間: 2025-3-31 22:36 作者: 原來 時間: 2025-4-1 04:23 作者: dominant 時間: 2025-4-1 09:26
Verwendung, Vergleiche und Grundgleichungenystem that, given a process ., tries to extract a spatial-behavioural type ., in the form of a . term that is logically equivalent to the given process. Using techniques based on well-structured transition systems, we then prove that, for an interesting fragment of the considered logic, satisfiabili作者: Facet-Joints 時間: 2025-4-1 13:16
Stirnr?der, Gestaltung und Berechnungrove that under a certain boundedness condition, the infinite timed tree can be reduced into a classical . timed automaton. The boundedness condition is satisfied by several subclasses of timed automata, some of them were known to be determinizable (event-clock timed automata, automata with integer 作者: Exclude 時間: 2025-4-1 17:02
