作者: ARIA 時間: 2025-3-21 21:45
https://doi.org/10.1057/9780230355354 show that synchronized product of finite automata, hierarchical graphs, and timed automata are pairwise incomparable in this sense. We moreover study the computational complexity of deciding simulation preorder and bisimulation equivalence on these classes.作者: considerable 時間: 2025-3-22 01:55 作者: minion 時間: 2025-3-22 08:18 作者: Coronation 時間: 2025-3-22 09:26
Typologie wirtschaftlicher Verhaltensweisenity and the concept of a universal machine, in the development of the world’s first electronic computers. These investigations resulted in my obtaining and publishing, in 1972, some limited information about Turing’s contributions to the work on code-breaking machines at Bletchley Park, the fore-run作者: 歡笑 時間: 2025-3-22 13:56
https://doi.org/10.1007/978-3-658-03081-0been very productive: concurrency theory has given us a host of models, calculi, and proof techniques, while engineered multiprocessors are now ubiquitous, from 2-8 core smartphones and laptops through to servers with 1024 or more hardware threads. But the fields have scarcely communicated, and the 作者: 歡笑 時間: 2025-3-22 18:48 作者: 單色 時間: 2025-3-22 22:09 作者: Mri485 時間: 2025-3-23 04:15 作者: Conserve 時間: 2025-3-23 09:05
Gorana Ognjenovi?,Jasna Jozeli?or weighted automata asks, given two weighted automata . and ., whether for all words ., the value that . assigns to . is less than or equal to the value . assigns to .. The problem is of great practical interest, yet is known to be undecidable. Efforts to approximate weighted containment by weighte作者: 割讓 時間: 2025-3-23 10:53 作者: chalice 時間: 2025-3-23 16:14
https://doi.org/10.1057/9780230355354role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express .-regular conditions. While in general, the winning strategies in s作者: Cupping 時間: 2025-3-23 18:26
Marnix Beyen,Maarten Van Ginderachterghted automata for four different measures: the sum, the mean, the discounted sum of weights along edges and the ratio between rewards and costs. On the positive side, we show that functionality is decidable for the four measures. Furthermore, the existential and universal threshold problems, the la作者: Prostaglandins 時間: 2025-3-23 23:22
https://doi.org/10.1057/9780230355354 show that synchronized product of finite automata, hierarchical graphs, and timed automata are pairwise incomparable in this sense. We moreover study the computational complexity of deciding simulation preorder and bisimulation equivalence on these classes.作者: 拖債 時間: 2025-3-24 03:21
A Perspective of the Mid-1960s,ferent semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we?study its expressiveness (showing in particular that . coincides with Monadic Second-Order Logic for both semantics) and characterize the complexity of its model-checking pro作者: organic-matrix 時間: 2025-3-24 09:21 作者: 確定 時間: 2025-3-24 11:17
Introduction: Apartheid and American Jews,, is needed to verify real-life interacting systems. For safety assurance of distributed IT infrastructures, specifications need to capture states in the presence of asynchronous interactions. We demonstrate that not all specifications are suitable for asynchronous observations because they implicit作者: 修飾語 時間: 2025-3-24 16:38 作者: 賞錢 時間: 2025-3-24 19:09
https://doi.org/10.1057/9780230288645tween a library and its client, with interactions limited to passing values of a given data type. This is inappropriate for common programming languages, where libraries and their clients can communicate via the heap, transferring the ownership of data structures, and can even run in a shared addres作者: botany 時間: 2025-3-25 02:23
https://doi.org/10.1007/978-3-663-04352-2We enhance the notion of a computation of the classical theory of computing with the notion of interaction from concurrency theory. In this way, we enhance a Turing machine as a model of computation to a Reactive Turing Machine that is an abstract model of a computer as it is used nowadays, always interacting with the user and the world.作者: 愉快嗎 時間: 2025-3-25 04:28 作者: meretricious 時間: 2025-3-25 10:08
https://doi.org/10.1007/978-3-642-32940-1concurrent software; distributed computing; modal logic; model checking; probabilistic automata作者: Vulnerary 時間: 2025-3-25 14:27
978-3-642-32939-5Springer-Verlag Berlin Heidelberg 2012作者: 使熄滅 時間: 2025-3-25 16:35 作者: ARM 時間: 2025-3-25 21:43 作者: 制度 時間: 2025-3-26 02:04 作者: 編輯才信任 時間: 2025-3-26 04:54 作者: 虛構(gòu)的東西 時間: 2025-3-26 09:59 作者: Geyser 時間: 2025-3-26 13:07
Conference proceedings 2012missions. The papers are organized in topics such as reachability analysis; qualitative and timed systems; behavioural equivalences; temporal logics; session types; abstraction; mobility and space in process algebras; stochastic systems; probabilistic systems; Petri nets and non-sequential semantics; verification; decidability.作者: FAST 時間: 2025-3-26 19:25
https://doi.org/10.1007/978-3-658-14528-6plete. This matches the complexity of the same problem for communication-free vector addition systems (known also as commutative context-free graphs), a special case of stateless multi-pushdown automata.作者: septicemia 時間: 2025-3-26 22:50 作者: calorie 時間: 2025-3-27 03:27
Reachability Problem for Weak Multi-Pushdown Automataplete. This matches the complexity of the same problem for communication-free vector addition systems (known also as commutative context-free graphs), a special case of stateless multi-pushdown automata.作者: COLON 時間: 2025-3-27 08:16 作者: 責任 時間: 2025-3-27 13:30
0302-9743 ity analysis; qualitative and timed systems; behavioural equivalences; temporal logics; session types; abstraction; mobility and space in process algebras; stochastic systems; probabilistic systems; Petri nets and non-sequential semantics; verification; decidability.978-3-642-32939-5978-3-642-32940-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CLOUT 時間: 2025-3-27 15:50
https://doi.org/10.1007/978-3-658-14528-6) reachability games are undecidable for finite targets, (ii) they are 2-EXPTIME-complete for upward-closed targets and (iii) safety games are co-NP-complete for finite, upward-closed and semi-linear targets. Moreover, for the decidable cases, we build a finite representation of the corresponding controllers.作者: Latency 時間: 2025-3-27 21:12 作者: FLORA 時間: 2025-3-28 00:20
Concurrent Games on VASS with Inhibition) reachability games are undecidable for finite targets, (ii) they are 2-EXPTIME-complete for upward-closed targets and (iii) safety games are co-NP-complete for finite, upward-closed and semi-linear targets. Moreover, for the decidable cases, we build a finite representation of the corresponding controllers.作者: TSH582 時間: 2025-3-28 03:29
Linearizability with Ownership Transferlated to the original one by our generalisation of linearizability. We also prove that linearizability with ownership transfer can be derived from the classical one if the library does not access some of data structures transferred to it by the client.作者: Indict 時間: 2025-3-28 10:03
0302-9743 he 23rd International Conference on Concurrency Theory, CONCUR 2012, held in Newcastle upon Tyne, UK, September 4-7, 2012. The 35 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 97 submissions. The papers are organized in topics such as reachabil作者: 急性 時間: 2025-3-28 13:55 作者: Palpate 時間: 2025-3-28 17:22
https://doi.org/10.1007/978-3-658-03081-0tous, from 2-8 core smartphones and laptops through to servers with 1024 or more hardware threads. But the fields have scarcely communicated, and the shared-memory interaction primitives offered by those mainstream multiprocessors are very different from the theoretical models that have been heavily studied.作者: fidelity 時間: 2025-3-28 20:06 作者: Inflated 時間: 2025-3-29 00:26
Concurrency and the Algebraic Theory of Effectsthat give rise to effects. Examples include exceptions (when the theory is that of a set of constants with no axioms), nondeterminism (when the theory could be that of a semilattice, for nondeterminism, with a zero, for deadlock), and action (when the theory could be a set of unary operations with no axioms).作者: 郊外 時間: 2025-3-29 04:00 作者: Altitude 時間: 2025-3-29 10:06 作者: 矛盾 時間: 2025-3-29 14:27 作者: Popcorn 時間: 2025-3-29 15:53
Fernando Molina,Miguel Cabo Villaverdemation during synchronizations only. We discuss a formalization of the problem and give a criterion using the notion of contextual timed transition system, which represents the behavior of .. when in parallel with ... Finally, we effectively build .′.?∥?.′. when it exists.作者: Infinitesimal 時間: 2025-3-29 23:03
A Turing Enigmally-authorised account of the work, led by T.H. (Tommy) Flowers at the Post Office Dollis Hill Research Station, on the construction of a series of special purpose electronic computers for Bletchley Park, computers that made a vital contribution to the Allied war effort.作者: encomiast 時間: 2025-3-30 00:28
Avoiding Shared Clocks in Networks of Timed Automatamation during synchronizations only. We discuss a formalization of the problem and give a criterion using the notion of contextual timed transition system, which represents the behavior of .. when in parallel with ... Finally, we effectively build .′.?∥?.′. when it exists.作者: Enzyme 時間: 2025-3-30 07:06
Concurrency and the Algebraic Theory of Effectsones, that is, the free algebra monads of given equational theories. The operations of such equational theories can be thought of as ., as it is they that give rise to effects. Examples include exceptions (when the theory is that of a set of constants with no axioms), nondeterminism (when the theory作者: Scintillations 時間: 2025-3-30 09:27 作者: 羽毛長成 時間: 2025-3-30 14:41 作者: Ischemia 時間: 2025-3-30 17:56 作者: Supplement 時間: 2025-3-30 21:40 作者: nonplus 時間: 2025-3-31 03:04
Reachability and Termination Analysis of Concurrent Quantum Programsncurrent programs. Some characterizations of the reachable space, uniformly repeatedly reachable space and termination of a concurrent quantum program are derived by the analysis of their mathematical structures. Based on these characterizations, algorithms for computing the reachable space and unif作者: 空中 時間: 2025-3-31 07:13
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstractionor weighted automata asks, given two weighted automata . and ., whether for all words ., the value that . assigns to . is less than or equal to the value . assigns to .. The problem is of great practical interest, yet is known to be undecidable. Efforts to approximate weighted containment by weighte作者: 保留 時間: 2025-3-31 10:28 作者: profligate 時間: 2025-3-31 17:08
Strategy Synthesis for Multi-Dimensional Quantitative Objectivesrole in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express .-regular conditions. While in general, the winning strategies in s作者: osteoclasts 時間: 2025-3-31 21:33
Quantitative Languages Defined by Functional Automataghted automata for four different measures: the sum, the mean, the discounted sum of weights along edges and the ratio between rewards and costs. On the positive side, we show that functionality is decidable for the four measures. Furthermore, the existential and universal threshold problems, the la作者: 爭吵加 時間: 2025-3-31 22:47
A Comparison of Succinctly Represented Finite-State Systems show that synchronized product of finite automata, hierarchical graphs, and timed automata are pairwise incomparable in this sense. We moreover study the computational complexity of deciding simulation preorder and bisimulation equivalence on these classes.作者: Intentional 時間: 2025-4-1 05:33
Quantified ,: Expressiveness and Model Checkingferent semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we?study its expressiveness (showing in particular that . coincides with Monadic Second-Order Logic for both semantics) and characterize the complexity of its model-checking pro作者: Goblet-Cells 時間: 2025-4-1 08:27
