作者: 使隔離 時間: 2025-3-21 21:30
Synthesis Problems for One-Counter Automata, for the parameters such that all computations from the initial configuration satisfy the formula. We show that LTL synthesis is decidable by translating it to a formula of a decidable fragment of Presburger arithmetic with divisibility.作者: Encephalitis 時間: 2025-3-22 02:25
On Boundedness Problems for Pushdown Vector Addition Systems,tions are reachable, respectively. Counter boundedness seems to be the more intricate problem. We show decidability in exponential time for one-dimensional systems. The proof is via a small witness property derived from an analysis of derivation trees of grammar-controlled vector addition systems.作者: 舉止粗野的人 時間: 2025-3-22 05:21 作者: Psa617 時間: 2025-3-22 10:59 作者: constitutional 時間: 2025-3-22 16:58 作者: 不確定 時間: 2025-3-22 20:18 作者: Tidious 時間: 2025-3-22 21:44 作者: 泄露 時間: 2025-3-23 02:58
0302-9743 tiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps and new computational paradigms..978-3-319-24536-2978-3-319-24537-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 奇思怪想 時間: 2025-3-23 05:51 作者: Myocarditis 時間: 2025-3-23 13:37
Integer-Complete Synthesis for Bounded Parametric Timed Automata,t computing dense sets of valuations for the timing requirements, guaranteeing a good behavior. However, in most cases, the emptiness problem for reachability (. whether there exists at least one parameter valuation for which some state is reachable) is undecidable and, as a consequence, synthesis p作者: thrombus 時間: 2025-3-23 15:26
Polynomial Interrupt Timed Automata,n presence of parameters. They are well suited to model and analyze real-time operating systems. Here we extend ITA with polynomial guards and updates, leading to the class of polynomial ITA (.ITA). We prove that reachability is decidable in 2EXPTIME on .ITA, using an adaptation of the . method for 作者: 蕨類 時間: 2025-3-23 19:24
Irregular Behaviours for Probabilistic Automata,greater than a given threshold. We show the existence of a universally non-regular probabilistic automaton, . an automaton such that the language it defines is non-regular for every threshold. As a corollary, we obtain an alternative and very simple proof of the undecidability of determining whether作者: Conflagration 時間: 2025-3-24 00:23
Reachability in Succinct One-Counter Games,ounter is incremented or decremented by a value given in binary. We show that the winner-determination problem is .-complete regardless of whether transitions are guarded by constraints on the counter or if the counter is restricted to non-negative values.作者: 共和國 時間: 2025-3-24 03:14 作者: indices 時間: 2025-3-24 09:21 作者: 殺子女者 時間: 2025-3-24 12:11
,The Ideal View on Rackoff’s Coverability Technique,any extensions. We show how to derive the same bounds directly on the computations of the VAS instantiation of the generic backward coverability algorithm. This relies on a dual view of the algorithm using ideal decompositions of downwards-closed sets, which exhibits a key structural invariant in th作者: justify 時間: 2025-3-24 16:11
Synthesis Problems for One-Counter Automata,s and counter updates are encoded in binary. This problem asks whether for a given parametric one-counter automaton and LTL formula there exist values for the parameters such that all computations from the initial configuration satisfy the formula. We show that LTL synthesis is decidable by translat作者: Critical 時間: 2025-3-24 19:18
On Boundedness Problems for Pushdown Vector Addition Systems,dedness of the reachability set for this model can be refined into two decision problems that ask if infinitely many counter values or stack configurations are reachable, respectively. Counter boundedness seems to be the more intricate problem. We show decidability in exponential time for one-dimens作者: 遺留之物 時間: 2025-3-25 02:41 作者: Spinous-Process 時間: 2025-3-25 06:05
Reducing Bounded Realizability Analysis to Reachability Checking, specifications. However, such verification typically involves complex, intricate analyses. The complexity of the realizability problem is 2EXPTIME-complete. To avoid this difficulty, Schewe et al. introduced the notion of bounded realizability. While realizability is the property that a model of a 作者: BOOR 時間: 2025-3-25 08:33
Rearranging Two Dimensional Arrays by Prefix Reversals,m an initial array by prefix reversals. In the case of the pancake sorting problem, sorting is always possible, whereas, it is not clear whether a rearrangement of two dimensional arrays is always possible. We shall prove any array is reachable from the initial array by prefix reversals unless the n作者: delusion 時間: 2025-3-25 13:03
The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets,ata, an abstract model that generalizes automata with storage. For each of a variety of storage mechanisms, one can choose a (typically infinite) monoid . such that valence automata over . are equivalent to (one-way) automata with this type of storage..In fact, many interesting storage mechanisms ca作者: Allege 時間: 2025-3-25 19:52 作者: asthma 時間: 2025-3-25 21:39 作者: Expediency 時間: 2025-3-26 02:11 作者: Stricture 時間: 2025-3-26 07:11 作者: Projection 時間: 2025-3-26 09:25 作者: TAG 時間: 2025-3-26 16:29 作者: 真實的你 時間: 2025-3-26 18:45
Christel Baiere conducted in five databases, evaluating/analyzing 8460 articles following the defined criteria. As a result, ten categories of challenges and fourteen categories of good practices for application in collaborative projects were described, in addition to describing seven collaboration models.作者: 鋼盔 時間: 2025-3-27 00:58 作者: Celiac-Plexus 時間: 2025-3-27 02:26 作者: HAIL 時間: 2025-3-27 07:31
Nathana?l Fijalkow,Micha? Skrzypczak the attributes in the definition of its object type. Together, all these values form the ‘state vector’ of an object. The range of values an attribute can take can be constrained to a particular type such as a numerical value, a date, a time, text and so on. This is called the data type of the attr作者: headway 時間: 2025-3-27 10:29 作者: micturition 時間: 2025-3-27 16:44 作者: 針葉類的樹 時間: 2025-3-27 19:23 作者: circumvent 時間: 2025-3-28 01:57
Ranko Lazi?,Sylvain Schmitz the attributes in the definition of its object type. Together, all these values form the ‘state vector’ of an object. The range of values an attribute can take can be constrained to a particular type such as a numerical value, a date, a time, text and so on. This is called the data type of the attr作者: amnesia 時間: 2025-3-28 05:00 作者: 強有力 時間: 2025-3-28 08:38 作者: 一個姐姐 時間: 2025-3-28 13:11
Alexander Malkisthod for conversation representation that is inspired in syntactic pattern recognition methods, specifically syntax-directed translation schemes. This method has a clear semantics that can be easily given a declarative implementation, thus becoming flexible enough to accommodate on-line extensions a作者: 戰(zhàn)役 時間: 2025-3-28 17:56 作者: Instrumental 時間: 2025-3-28 18:58 作者: 小鹿 時間: 2025-3-28 23:20
Akihiro Yamamuraion of that experiment. The findings obtained in the replication corroborate the results of the first experiment in the sense that at some extent, the number of transitions, the number of states and the number of activities influence statechart diagrams understandability.作者: 難聽的聲音 時間: 2025-3-29 06:32 作者: Juvenile 時間: 2025-3-29 08:24
is leads to equate requirements engineering with heterogeneous engineering. The admitted heterogeneity of technological activity avoids a commitment to social (or technological) reductionism. Requirements engineers need to be seen as “heterogeneous engineers” who must associate entities that range f作者: HEPA-filter 時間: 2025-3-29 13:45
978-3-319-24536-2Springer International Publishing Switzerland 2015作者: cochlea 時間: 2025-3-29 16:09 作者: Occipital-Lobe 時間: 2025-3-29 23:20
Irregular Behaviours for Probabilistic Automata,greater than a given threshold. We show the existence of a universally non-regular probabilistic automaton, . an automaton such that the language it defines is non-regular for every threshold. As a corollary, we obtain an alternative and very simple proof of the undecidability of determining whether such a language is regular.作者: inflate 時間: 2025-3-30 01:58
Reachability in Succinct One-Counter Games,ounter is incremented or decremented by a value given in binary. We show that the winner-determination problem is .-complete regardless of whether transitions are guarded by constraints on the counter or if the counter is restricted to non-negative values.作者: 性行為放縱者 時間: 2025-3-30 04:23 作者: Flawless 時間: 2025-3-30 09:52
Over-Approximating Terms Reachable by Context-Sensitive Rewriting,For any left-linear context-sensitive term rewrite system and any regular language of ground terms ., we build a finite tree automaton that recognizes a superset of the descendants of ., i.e.?of the terms reachable from . by context-sensitive rewriting.作者: TOXIN 時間: 2025-3-30 14:51
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/r/image/821821.jpg作者: Abduct 時間: 2025-3-30 16:43 作者: nostrum 時間: 2025-3-31 00:18
ly assess ontologies is ontology metrics, and the research community has already proposed measurement frameworks for assessing ontology quality. Arguably, the most holistic framework available is OQuaRE. Not only does it suggest metrics, but it also links these metrics to quality characteristics and作者: Debrief 時間: 2025-3-31 03:40 作者: 辭職 時間: 2025-3-31 08:25 作者: Pelvic-Floor 時間: 2025-3-31 09:41
Béatrice Bérard,Serge Haddad,Claudine Picaronny,Mohab Safey El Din,Mathieu SassolasE offers an intuitive and practical approach to enterprise modelling and using these models as core for building enterprise information systems. From a business analyst perspective, benefits of the approach are its simplicity and the possibility to evaluate the consequences of modeling choices throu作者: majestic 時間: 2025-3-31 16:16
Nathana?l Fijalkow,Micha? Skrzypczake for the outside world (including the user), we have to adorn them with values by which we can recognise them. For example, a customer becomes identifiable through his/her name, address and telephone number. An account becomes identifiable through its account number, and a deposit event becomes ide作者: Fretful 時間: 2025-3-31 18:59 作者: gastritis 時間: 2025-3-31 23:57
