作者: NUL 時間: 2025-3-22 00:09 作者: 少量 時間: 2025-3-22 01:23 作者: Polydipsia 時間: 2025-3-22 08:14
The regular viewpoint on PA-processes,ain result is that the set of (iterated) predecessors of a regular set of PA-processes is a regular tree language, and similarly for (iterated) successors. Furthermore, the corresponding tree-automata can be built effectively in polynomial-time. This has many immediate applications to verification p作者: Debrief 時間: 2025-3-22 12:09 作者: 窩轉(zhuǎn)脊椎動物 時間: 2025-3-22 13:22 作者: 窩轉(zhuǎn)脊椎動物 時間: 2025-3-22 20:17 作者: Supplement 時間: 2025-3-23 00:05
,From higher-order π-calculus to π-calculus in the presence of static operators,n particular we have found the dynamic restriction operator of CHOCS, here called blocking, useful. We investigate the consequences of adding static operators such as blocking to the first-and higher-order π-calculus. In the presence of the blocking operator (and static operators in general) the hig作者: BULLY 時間: 2025-3-23 05:21
Minimality and separation results on asynchronous mobile processes,combinators is based on a finite number of atoms and fixed interaction rules, but is as expressive as the original calculus, so that it can represent diverse interaction structures, including polyadic synchronous name passing [23] and input guarded summations [26]. The present paper shows that each 作者: deceive 時間: 2025-3-23 07:51
Abstract games for infinite state processes,d on-the-fly exploration. We describe a generic algorithm which, when instantiated with certain functions specific to the concrete game, computes a winning strategy. We apply this technique to bisimulation and model-checking of value-passing processes, and to timed automata.作者: 慢慢啃 時間: 2025-3-23 12:58
Alternating refinement relations,nents. Unlike in labeled transition systems, where each transition corresponds to a possible step of the system (which may involve some or all components), in alternating transition systems, each transition corresponds to a possible move in a game between the components. In this paper, we study refi作者: Clinch 時間: 2025-3-23 16:11
Possible worlds process algebras,his view of non-determinism as underspecification, nodeterministic processes are specifications, and the possible worlds represent the model space and thus the set of possible implementations. Then, refinement is inclusion of sets of possible worlds and can be used for stepwise specifications. This 作者: 碎石 時間: 2025-3-23 20:59
Automata and coinduction (an exercise in coalgebra),) coalgebra. This leads to a transparent and uniform presentation of automata theory and yields some new insights, amongst which coinduction proof methods for language equality and language inclusion. At the same time, the present treatment of automata theory may serve as an introduction to coalgebr作者: 有害處 時間: 2025-3-23 23:31
Axioms for real-time logics, and the Metric Interval Temporal Logic with past (MITL). The completeness proof consists of an effective proof building procedure for ECL. From this result we obtain a complete axiomatization of MITL by providing axioms translating MITL formulae into ECL formulae, the two logics being equally expre作者: FIR 時間: 2025-3-24 03:34 作者: Lipoprotein 時間: 2025-3-24 08:27 作者: Efflorescent 時間: 2025-3-24 10:46
From rewrite to bisimulation congruences,ongruences is fundamental; these can often be given tractable definitions or characterisations using a labelled transition semantics. This paper considers calculi with arbitrary reduction semantics of three simple classes, firstly ground term rewriting, then left-linear term rewriting, and then a cl作者: bourgeois 時間: 2025-3-24 16:30 作者: invulnerable 時間: 2025-3-24 22:15
Conference proceedings 1998r 1998..The 35 revised full papers presented were carefully selected from a total of 104 submissions. Also presented are five invited contributions. Among the topics covered are moduls of computation and semantic domains, process algebras, Petri Nets, event structures, real-time systems, hybrid syst作者: 直言不諱 時間: 2025-3-25 00:47
Conference proceedings 1998mong the topics covered are moduls of computation and semantic domains, process algebras, Petri Nets, event structures, real-time systems, hybrid systems, model checking, verification techniques, refinement, rewriting, typing systems and algorithms, etc..作者: 血統(tǒng) 時間: 2025-3-25 07:22 作者: 碌碌之人 時間: 2025-3-25 07:35
https://doi.org/10.1007/978-3-642-34821-1nce problem is decidable, and present two algorithms for solving this problem..Ultimately, the appropriate statement of correctness is that the out-of-order execution produces the same final state (and all relevant intermediate actions, such as writes to memory) as a purely sequential machine running the same program.作者: DUCE 時間: 2025-3-25 12:16 作者: compel 時間: 2025-3-25 17:26
https://doi.org/10.1007/978-3-0348-5247-0rst result in the literature which gives a positive answer to the decidability of simulation preorder between pairs of processes in a class whose elements are neither finite-state nor allow finite partitioning of their state spaces.作者: Ambulatory 時間: 2025-3-25 23:21
Herbrand automata for hardware verification,nce problem is decidable, and present two algorithms for solving this problem..Ultimately, the appropriate statement of correctness is that the out-of-order execution produces the same final state (and all relevant intermediate actions, such as writes to memory) as a purely sequential machine running the same program.作者: rectocele 時間: 2025-3-26 01:22
,Control flow analysis for the π-calculus,iven name may be bound and of the set of names that may be sent along a given channel. Applications of our analysis include establishing simple security properties of processes. One example is that . has ., i.e. . offers communication through public channels only, and confines its secret names within itself.作者: FOLD 時間: 2025-3-26 06:17 作者: 格子架 時間: 2025-3-26 11:14
Naturvorstellungen in der Renaissance,can refer to the uncertainty the program has about the environment‘s behavior. In this work we solve the problem of synthesis with incomplete information with respect to specifications in the logic of knowledge and time. We show that the problem has the same worst-case complexity as synthesis with complete information.作者: 虛弱 時間: 2025-3-26 13:26 作者: Infelicity 時間: 2025-3-26 20:43 作者: epicardium 時間: 2025-3-26 23:12 作者: 背信 時間: 2025-3-27 01:11 作者: cortisol 時間: 2025-3-27 05:27
Synthesis from knowledge-based specifications,can refer to the uncertainty the program has about the environment‘s behavior. In this work we solve the problem of synthesis with incomplete information with respect to specifications in the logic of knowledge and time. We show that the problem has the same worst-case complexity as synthesis with complete information.作者: 反叛者 時間: 2025-3-27 10:59 作者: 間諜活動 時間: 2025-3-27 17:17 作者: 惰性女人 時間: 2025-3-27 21:40 作者: 出生 時間: 2025-3-28 00:18
From rewrite to bisimulation congruences,nces. As a test of the theory it is shown that bisimulation for a fragment of CCS is recovered. The transitions generated for a fragment of the Ambient Calculus of Cardelli and Gordon, and for SKI combinators, are also discussed briefly.作者: refine 時間: 2025-3-28 06:02 作者: 影響 時間: 2025-3-28 09:57 作者: adj憂郁的 時間: 2025-3-28 11:52
Nicolas Guéguen,Sébastien Meinerirequivalence and adding so called tau-laws. These are similar to the well known tau-laws for CCS and the π-calculus, but there is an interesting difference which highlights an aspect of the higher expressive power of the fusion calculus.作者: 啪心兒跳動 時間: 2025-3-28 16:02 作者: slow-wave-sleep 時間: 2025-3-28 18:51
Holzbaumeister — Borkenk?fer und M?rtelbienents that are interconnected via the routers. Following a detailed analysis of the three models to extract invariant properties, we show that the three models are related by a suitable notion of equivalence based on ..作者: 勾引 時間: 2025-3-29 02:52
The regular viewpoint on PA-processes,sors. Furthermore, the corresponding tree-automata can be built effectively in polynomial-time. This has many immediate applications to verification problems for PA-processes, among which a simple and general model-checking algorithm.作者: ITCH 時間: 2025-3-29 05:06
The tau-laws of fusion,requivalence and adding so called tau-laws. These are similar to the well known tau-laws for CCS and the π-calculus, but there is an interesting difference which highlights an aspect of the higher expressive power of the fusion calculus.作者: 自然環(huán)境 時間: 2025-3-29 10:48
Axioms for real-time logics,result we obtain a complete axiomatization of MITL by providing axioms translating MITL formulae into ECL formulae, the two logics being equally expressive. Our proof is structured to yield a similar axiomatization and procedure for interesting fragments of these logics, such as the linear temporal logic of the real numbers (LTR).作者: Tracheotomy 時間: 2025-3-29 13:26
Modelling IP mobility,nts that are interconnected via the routers. Following a detailed analysis of the three models to extract invariant properties, we show that the three models are related by a suitable notion of equivalence based on ..作者: 串通 時間: 2025-3-29 17:22
Possible worlds process algebras,notion of refinement naturally induces new preorders (and equivalences) for processes that we characterize denotationally, operationally and axiomatically for a basic process algebra with nil, prefix and choice.作者: 燈泡 時間: 2025-3-29 22:37 作者: 我不明白 時間: 2025-3-30 01:41
Sometimes and not never re-revisited: on branching versus linear time,checking. We characterize LTL formulas that can be expressed in the alternation-free .-calculus; these arc precisely the formulas that are equivalent to deterministic Büchi automata. We then claim that these results are possibly of theoretical, rather than of practical interest, since in practice, L作者: florid 時間: 2025-3-30 04:36 作者: Melanoma 時間: 2025-3-30 12:02 作者: maroon 時間: 2025-3-30 12:29
https://doi.org/10.1007/978-3-663-10879-5checking. We characterize LTL formulas that can be expressed in the alternation-free .-calculus; these arc precisely the formulas that are equivalent to deterministic Büchi automata. We then claim that these results are possibly of theoretical, rather than of practical interest, since in practice, L作者: 藐視 時間: 2025-3-30 17:24 作者: 滲入 時間: 2025-3-30 23:15 作者: 潔凈 時間: 2025-3-31 02:21 作者: conservative 時間: 2025-3-31 07:56
Automata and coinduction (an exercise in coalgebra),) coalgebra. This leads to a transparent and uniform presentation of automata theory and yields some new insights, amongst which coinduction proof methods for language equality and language inclusion. At the same time, the present treatment of automata theory may serve as an introduction to coalgebra.作者: anarchist 時間: 2025-3-31 10:24
https://doi.org/10.1007/978-3-663-10879-5ar, the computational advantage of CTL model checking over LTL model checking makes CTL a popular choice, leading to efficient model-checking tools for this logic. Can we use these tools in order to verify linear properties? In this survey paper we describe two approaches that relate branching and l作者: anaerobic 時間: 2025-3-31 17:00 作者: AVANT 時間: 2025-3-31 20:46
Naturvorstellungen in der Renaissance,he environment in which the program operates may behave nondeterministically, e.g., by generating different sequences of inputs in different runs of the system. To satisfy the specification, the program needs to act so that the specification holds in every computation generated by its interaction wi作者: 新星 時間: 2025-3-31 23:48
Naturvorstellungen in der Renaissance,ain result is that the set of (iterated) predecessors of a regular set of PA-processes is a regular tree language, and similarly for (iterated) successors. Furthermore, the corresponding tree-automata can be built effectively in polynomial-time. This has many immediate applications to verification p作者: Tdd526 時間: 2025-4-1 05:21
https://doi.org/10.1007/978-3-642-34821-1a finite representation of infinite-state machines. Herbrand engines are used to provide a high-level model of out-of-order execution in the design of micro-processors. The problem of verifying that a highly parallel design for out-of-order execution correctly implements the Instruction Set Architec作者: alliance 時間: 2025-4-1 08:41
