標(biāo)題: Titlebook: Automata, Languages, and Programming; 40th International C Fedor V. Fomin,Rūsi?? Freivalds,David Peleg Conference proceedings 2013 Springer [打印本頁(yè)] 作者: grateful 時(shí)間: 2025-3-21 18:13
書目名稱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é)科排名
作者: 表兩個(gè) 時(shí)間: 2025-3-21 23:51
,Fazit — Einkauf ist Chefsache, non-relational modalities capturing, e.g., uncertainty or collaboration. We develop a generic framework for non-relational dynamic logic by adding dynamic operators to coalgebraic logic. We discuss a range of examples and establish basic results including bisimulation invariance, complexity, and a small model property.作者: hematuria 時(shí)間: 2025-3-22 00:59 作者: 600 時(shí)間: 2025-3-22 08:17
0302-9743 refereed proceedings of the 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, held in Riga, Latvia, in July 2013. The total of 124 revised full papers presented were carefully reviewed and selected from 422 submissions. They are organized in three tracks focussing on 作者: infelicitous 時(shí)間: 2025-3-22 09:13
Conference proceedings 2013ogramming, ICALP 2013, held in Riga, Latvia, in July 2013. The total of 124 revised full papers presented were carefully reviewed and selected from 422 submissions. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming;作者: Inferior 時(shí)間: 2025-3-22 16:47
Gewinnen Strategien für mathematische Spielel solutions for uncertain inputs. We propose an approach towards this goal, and we show that this approach on the one hand creates a wealth of algorithmic problems, while on the other hand it appears to lead to good real world solutions..This talk is about joint work with Joachim Buhmann, Matus Mihalak, and Rasto Sramek.作者: cipher 時(shí)間: 2025-3-22 17:40 作者: 者變 時(shí)間: 2025-3-23 00:07
,Einsparungen durch Volumenerh?hung,theorem strictly generalizes, for the first time, the corresponding classification for existential conjunctive logic (which is known and due to Grohe) to a logic in which both quantifiers are present.作者: SMART 時(shí)間: 2025-3-23 02:00
https://doi.org/10.1007/978-3-8349-9576-6PS.) and they apply to languages in which arithmetical constraints on counter values are systematically allowed. As far as the proof techniques are concerned, we provide a uniform approach that focuses on the main issues.作者: grenade 時(shí)間: 2025-3-23 07:33 作者: NAG 時(shí)間: 2025-3-23 10:55
To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculousl solutions for uncertain inputs. We propose an approach towards this goal, and we show that this approach on the one hand creates a wealth of algorithmic problems, while on the other hand it appears to lead to good real world solutions..This talk is about joint work with Joachim Buhmann, Matus Mihalak, and Rasto Sramek.作者: Perennial長(zhǎng)期的 時(shí)間: 2025-3-23 17:00 作者: 上釉彩 時(shí)間: 2025-3-23 22:03 作者: Indolent 時(shí)間: 2025-3-23 23:52 作者: Offstage 時(shí)間: 2025-3-24 04:59
Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Sessionmmunicating automata that exactly correspond to the projected local types. We exhibit an algorithm to synthesise a global type from a collection of communicating automata. The key property of our findings is the notion of . which non-trivially extends the duality condition for binary session types.作者: 包庇 時(shí)間: 2025-3-24 08:15
https://doi.org/10.1007/978-3-8349-8841-6lled Shannon-Parry measure to the timed automata setting. The process .. has the nice property to be ergodic. As a consequence it has the asymptotic equipartition property and thus the random sampling w.r.t. .. is quasi uniform.作者: arrogant 時(shí)間: 2025-3-24 11:23
,Abwicklungs- und Zahlungsmodalit?ten, restricting our attention to deterministic protocols, we propose the first decidability result for checking equivalence of protocols for an unbounded number of sessions. This result is obtained through a characterization of equivalence of protocols in terms of equality of languages of (generalized, real-time) deterministic pushdown automata.作者: NICHE 時(shí)間: 2025-3-24 17:23
A Maximal Entropy Stochastic Process for a Timed Automaton,lled Shannon-Parry measure to the timed automata setting. The process .. has the nice property to be ergodic. As a consequence it has the asymptotic equipartition property and thus the random sampling w.r.t. .. is quasi uniform.作者: 擴(kuò)音器 時(shí)間: 2025-3-24 21:23
From Security Protocols to Pushdown Automata restricting our attention to deterministic protocols, we propose the first decidability result for checking equivalence of protocols for an unbounded number of sessions. This result is obtained through a characterization of equivalence of protocols in terms of equality of languages of (generalized, real-time) deterministic pushdown automata.作者: 舊式步槍 時(shí)間: 2025-3-24 23:50 作者: Insatiable 時(shí)間: 2025-3-25 05:05 作者: FUSE 時(shí)間: 2025-3-25 09:48 作者: palliate 時(shí)間: 2025-3-25 15:39
0302-9743 algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.978-3-642-39211-5978-3-642-39212-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: ordain 時(shí)間: 2025-3-25 18:44 作者: CHASM 時(shí)間: 2025-3-25 20:47 作者: 概觀 時(shí)間: 2025-3-26 02:36
https://doi.org/10.1007/978-3-662-11880-1xity of additive regular functions. Second, we consider ., where the objective of one of the players is to reach a target set while minimizing the cost. We show the corresponding decision problem to be .-complete when the costs are non-negative integers, but undecidable when the costs are integers.作者: verdict 時(shí)間: 2025-3-26 07:21
https://doi.org/10.1007/978-3-322-86961-6ok at a natural restriction of FO., its guarded version, GF.. Our results depend on an analysis of types in models of FO. formulas, including techniques for controlling the number of distinct subtrees, the depth, and the size of a witness to satisfiability for FO. sentences over finite trees.作者: adequate-intake 時(shí)間: 2025-3-26 12:15
https://doi.org/10.1007/978-3-322-86961-6eally differ from deterministic automata. In particular, while DBP ? GFG ? GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for .-作者: 除草劑 時(shí)間: 2025-3-26 15:20
,Abwicklungs- und Zahlungsmodalit?ten,he morphic image of another, this new notion has other unexpected applications: For instance, as a consequence of our characterization of self-shuffling Sturmian words, we recover a number theoretic result, originally due to Yasutomi, which characterizes pure morphic Sturmian words in the orbit of t作者: Hamper 時(shí)間: 2025-3-26 19:13
Formalizing and Reasoning about Qualitywhich a specification is satisfied, and synthesis returns a system satisfying the specification with the highest quality. Reasoning about quality gives rise to other natural questions, like the distance between specifications. We formalize these basic questions and study them for LTL[.]. By extendin作者: LAY 時(shí)間: 2025-3-26 23:13
The Square Root Phenomenon in Planar Graphs the lower bound side, under a complexity assumption called Exponential Time Hypothesis (ETH), we can show that these algorithms are essentially best possible, and therefore the square root has to appear in the running time.作者: 注射器 時(shí)間: 2025-3-27 01:59
Decision?Problems?for?Additive?Regular?Functionsxity of additive regular functions. Second, we consider ., where the objective of one of the players is to reach a target set while minimizing the cost. We show the corresponding decision problem to be .-complete when the costs are non-negative integers, but undecidable when the costs are integers.作者: 傀儡 時(shí)間: 2025-3-27 07:02 作者: 是比賽 時(shí)間: 2025-3-27 09:59
Nondeterminism in the Presence of a Diverse or Unknown Futureeally differ from deterministic automata. In particular, while DBP ? GFG ? GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for .-作者: Range-Of-Motion 時(shí)間: 2025-3-27 16:07 作者: delta-waves 時(shí)間: 2025-3-27 18:01 作者: 打包 時(shí)間: 2025-3-27 23:13
Gewinnen Strategien für mathematische Spieleidentical machines so as to minimize the makespan of the constructed schedule. Recent research has focused on settings in which an online algorithm is given extra information or power while processing a job sequence. In this paper we review the various models of resource augmentation and survey important results.作者: ironic 時(shí)間: 2025-3-28 05:04
Effektives Lieferantenmanagement,suffix-testable languages and variants thereof. We give characterizations of when two languages can be separated and present an overview of when these problems can be decided in polynomial time if . and . are given by nondeterministic automata.作者: Coronary-Spasm 時(shí)間: 2025-3-28 07:27
Gewinnen Strategien für mathematische Spieleidentical machines so as to minimize the makespan of the constructed schedule. Recent research has focused on settings in which an online algorithm is given extra information or power while processing a job sequence. In this paper we review the various models of resource augmentation and survey impo作者: 取之不竭 時(shí)間: 2025-3-28 13:15
Gewinnen Strategien für mathematische Spielel methods to also address the . of systems. As an adequate specification formalism we introduce the linear temporal logic LTL[.]. The satisfaction value of an LTL[.] formula is a number between 0 and 1, describing the quality of the satisfaction. The logic generalizes traditional LTL by augmenting i作者: periodontitis 時(shí)間: 2025-3-28 17:29
,Kalte Kriege nach hei?en Schlachten,olution of these planar problems. However, in many cases, the exponential-time algorithms on planar graphs are significantly faster than the algorithms for general graphs: for example, . can be solved in time . in an .-vertex planar graph, whereas only 2.-time algorithms are known for general graphs作者: 昏迷狀態(tài) 時(shí)間: 2025-3-28 22:31
https://doi.org/10.1007/978-3-322-83171-2, Algorithms, Graph Theory, Discrete Mathematics and Statistical Physics. This continuing interest is due to the fact that, besides their mathematical beauty, such graphs are very important, since they can model interactions and faults in networks and also serve as typical inputs for an average case作者: ARIA 時(shí)間: 2025-3-28 23:52 作者: debble 時(shí)間: 2025-3-29 03:56 作者: 淡紫色花 時(shí)間: 2025-3-29 08:57 作者: Factual 時(shí)間: 2025-3-29 12:31
https://doi.org/10.1007/978-3-8349-8841-6to design a probability distribution which represents in the best possible way the runs of the TA. This question does not seem to have been studied yet. We give an answer to it using a maximal entropy approach. We introduce our variant of stochastic model, the stochastic process over runs which perm作者: fibroblast 時(shí)間: 2025-3-29 17:17
https://doi.org/10.1007/978-3-322-86961-6bility problem for FO. over arbitrary structures is known to be .-complete, with satisfiable formulas having exponential-sized models. Over words, where FO. is known to have the same expressiveness as unary temporal logic, satisfiability is again .-complete. Over finite labelled ordered trees FO. ha作者: addition 時(shí)間: 2025-3-29 20:07
https://doi.org/10.1007/978-3-322-86961-6. In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three s作者: Etching 時(shí)間: 2025-3-30 00:35
,Fazit — Einkauf ist Chefsache,ms of communication being public announcement. Semantically, dynamic operators correspond to transformations of the underlying model. While metatheoretic results on dynamic epistemic logic so far are largely limited to the setting of Kripke models, there is evident interest in extending its scope to作者: 作嘔 時(shí)間: 2025-3-30 06:17
,Abwicklungs- und Zahlungsmodalit?ten,ined over a finite alphabet ., is self-shuffling if . admits factorizations: . with . In other words, there exists a shuffle of . with itself which reproduces .. The morphic image of any self-shuffling word is again self-shuffling. We prove that many important and well studied words are self-shuffli作者: champaign 時(shí)間: 2025-3-30 10:01 作者: bifurcate 時(shí)間: 2025-3-30 16:19
,Abwicklungs- und Zahlungsmodalit?ten,here are very few results for equivalence-based properties, crucial for studying e.g. privacy-like properties such as anonymity or vote secrecy..We study the problem of checking equivalence of security protocols for an unbounded number of sessions. Since replication leads very quickly to undecidabil作者: 馬籠頭 時(shí)間: 2025-3-30 19:54
Effektives Lieferantenmanagement,suffix-testable languages and variants thereof. We give characterizations of when two languages can be separated and present an overview of when these problems can be decided in polynomial time if . and . are given by nondeterministic automata.作者: RUPT 時(shí)間: 2025-3-30 23:18
https://doi.org/10.1007/978-3-8349-9576-6the complexity characterization of model-checking problems for such operational models is not always well studied except for reachability queries or for Past LTL. In this paper, we characterize the complexity of model-checking problems on flat counter systems for the specification languages includin作者: 熱情贊揚(yáng) 時(shí)間: 2025-3-31 04:20
,Abwicklungs- und Zahlungsmodalit?ten,ions. To construct a global specification from a set of distributed uncontrolled behaviours, this paper explores the problem of fully characterising multiparty session types in terms of communicating automata. We equip global and local session types with labelled transition systems (LTSs) that faith作者: 樹木心 時(shí)間: 2025-3-31 05:52 作者: Insensate 時(shí)間: 2025-3-31 12:39 作者: 調(diào)情 時(shí)間: 2025-3-31 14:27
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166234.jpg作者: CRUDE 時(shí)間: 2025-3-31 21:13 作者: EXULT 時(shí)間: 2025-3-31 23:10 作者: osteoclasts 時(shí)間: 2025-4-1 02:15
