標題: Titlebook: CONCUR ‘92; Third International W.R. Cleaveland Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 Analyse-Algorithmen.Ana [打印本頁] 作者: bradycardia 時間: 2025-3-21 18:25
書目名稱CONCUR ‘92影響因子(影響力)
書目名稱CONCUR ‘92影響因子(影響力)學科排名
書目名稱CONCUR ‘92網(wǎng)絡公開度
書目名稱CONCUR ‘92網(wǎng)絡公開度學科排名
書目名稱CONCUR ‘92被引頻次
書目名稱CONCUR ‘92被引頻次學科排名
書目名稱CONCUR ‘92年度引用
書目名稱CONCUR ‘92年度引用學科排名
書目名稱CONCUR ‘92讀者反饋
書目名稱CONCUR ‘92讀者反饋學科排名
作者: 自然環(huán)境 時間: 2025-3-22 00:19
Testing equivalence for Petri Nets with action refinement: Preliminary report,Vogler and van Glabbeek/Goltz. A failure-style denotational semantics is described for process nets. The semantics is fully abstract for Hennessy Testing-equivalence on nets acting as refinement . as well as operands. The semantics embodies the notions of deadlock, failures and divergences found in 作者: 光亮 時間: 2025-3-22 00:53
On the uniqueness of fixpoints modulo observation congruence,tions are given for the uniqueness of such solutions for a given signature of process combinators, such as . and . (CCS) or the absence of . (ACP), . (CSP), or . (LOTOS) combinators. Our study is based on ., i.e. behaviour expressions with ‘holes’, whose operational semantics can be characterised by作者: 尾隨 時間: 2025-3-22 07:14
Verification of parallel systems via decomposition, the verification of parallel systems. In particular, we consider those of the form ..∥..∥ ...∥.. = .. ∥.. ∥...∥.. (*) where ..and .. are (finite-) state systems, and ∥denotes parallel composition. We provide a decomposition procedure for all .. and .. and give criteria that must be checked on the d作者: Expediency 時間: 2025-3-22 11:41
Concurrent testing of processes,take advantage of this assumption. The result is a semantic theory in which concurrency is differentiated from nondeterminism..We show that the semantic preorder based on these tests is preserved by so-called “stable” action refinement and may be characterised as the largest such preorder contained 作者: FLACK 時間: 2025-3-22 16:33
A theory of processes with localities,for the location of actions. A general notion of bisimulation related to this observation of distributed systems is introduced. Our main result is that these bisimulation relations, particularized to a process algebra extending CCS, are completely axiomatizable. We discuss in details two instances o作者: FLACK 時間: 2025-3-22 17:51 作者: BLANK 時間: 2025-3-23 01:13
Bisimulation equivalence is decidable for all context-free processes,e the complexity of solving this problem. Moreover it does not provide us with an intuitive technique for deciding bisimilarity as does the tableau method in [14, 13] which also has the advantage of providing us with a way of extracting a complete axiomatization for normed BPA processes. A similar r作者: 擁擠前 時間: 2025-3-23 04:47
Distributed bisimularity is decidable for a class of infinite state-space systems,ing of recursively defined processes over a signature of . and . will contain infinite state-space systems; the solution to . is such an example. Whether . [10] is decidable on . is an open problem. However, in this paper we show that . [2] is decidable on the language .. The proof of decidability r作者: corporate 時間: 2025-3-23 09:26
How vital is liveness? Verifying timing properties of reactive and hybrid systems, a most useful abstraction on the qualitative (non-quantitative) level of modeling. As we construct more refined models that take real-time into account, the importance of liveness and fairness decrease, and many important properties move to the safety class..In the talk to be presented, we propose 作者: 大包裹 時間: 2025-3-23 10:52 作者: insincerity 時間: 2025-3-23 16:24
,Sometimes ‘some’ is as good as ‘a(chǎn)ll’,aving semantics. A specification formalism called . is introduced in which a formula is interpreted over equivalence classes of sequences by asserting that . (at least one but not necessarily all) sequences from each equivalence class satisfy a given property. It differs from the more common ., whic作者: Meditate 時間: 2025-3-23 19:28 作者: definition 時間: 2025-3-23 23:36
Propositional temporal logics and equivalences,ral logics are considered. The logics are interpreted on occurrence transition systems, generated by labelled prime event structures without autoconcurrency. The induced equivalences are also compared to directly defined equivalences, e.g., history preserving bisimulation, pomset bisimulation, pomse作者: Cloudburst 時間: 2025-3-24 04:44 作者: 心痛 時間: 2025-3-24 10:29 作者: 漫步 時間: 2025-3-24 13:07
Randy K. Lippert,Kevin Walby,Darren Palmers of the finite process representation. These property transformers can then simply be applied to solve the model-checking problem. The complexity of our algorithm is linear in the size of the system‘s representation and exponential in the size of the property being investigated.作者: Flawless 時間: 2025-3-24 17:32
https://doi.org/10.1007/978-3-319-74660-9akest compositional equivalence preserving nexttimeless linear temporal logic with an extra operator distinguishing deadlocks from divergences. Furthermore, a slight modification of CFFD, called the NDFD-equivalence, is exactly the weakest compositional equivalence preserving standard nexttimeless linear temporal logic.作者: 劇毒 時間: 2025-3-24 19:15 作者: SEED 時間: 2025-3-25 03:10 作者: Myocarditis 時間: 2025-3-25 05:10 作者: SAGE 時間: 2025-3-25 07:55 作者: Interlocking 時間: 2025-3-25 11:46 作者: 協(xié)迫 時間: 2025-3-25 19:36 作者: ETCH 時間: 2025-3-25 22:13 作者: CLIFF 時間: 2025-3-26 00:31 作者: 污點 時間: 2025-3-26 06:40 作者: 極小量 時間: 2025-3-26 12:02 作者: 煞費苦心 時間: 2025-3-26 15:43 作者: 內(nèi)部 時間: 2025-3-26 19:39
Conference proceedings 1992 analysis.A key feature of CONCUR is its breadth: in one volume itpresents a snapshot of the state of the art in concurrencytheory. Assuch, it is indispensible to researchers - andwould-be researchers - in theformal analysis of concurrentsystems.作者: 弄污 時間: 2025-3-26 22:37
Conference proceedings 1992all presented at theCONCUR ‘92 conference, which has emerged as thepremiereconference on formal aspects of concurrency. The authorsinclude such prominent researchers as R. Milner, A. Pnueli,N.Lynch, and V.R. Pratt. The results represent advances inthe mathematical understanding of the behavior of co作者: Feature 時間: 2025-3-27 02:29
National Socialism and German Discourseexpectedly, the addition of the backward next step operator to the weakest logic considered yields a logic stronger than all others. It is shown that weak history preserving bisimulation can be obtained as the equivalence induced by a slightly constrained version of that logic.作者: Frequency-Range 時間: 2025-3-27 08:03
Propositional temporal logics and equivalences,expectedly, the addition of the backward next step operator to the weakest logic considered yields a logic stronger than all others. It is shown that weak history preserving bisimulation can be obtained as the equivalence induced by a slightly constrained version of that logic.作者: Graves’-disease 時間: 2025-3-27 13:28 作者: AVERT 時間: 2025-3-27 16:51
The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic,akest compositional equivalence preserving nexttimeless linear temporal logic with an extra operator distinguishing deadlocks from divergences. Furthermore, a slight modification of CFFD, called the NDFD-equivalence, is exactly the weakest compositional equivalence preserving standard nexttimeless linear temporal logic.作者: 征兵 時間: 2025-3-27 17:55 作者: 為敵 時間: 2025-3-28 00:00
M. A. Muqtedar Khan,Sara J. Chehabmore generally. We apply it to a fix-point equation based on a context where a hiding combinator removes what seem to be essential guarding actions. This implies that the condition of (relativised) abstraction-freedom is generally too strict.作者: Subdue 時間: 2025-3-28 02:29 作者: HEPA-filter 時間: 2025-3-28 09:10
Evolution of the Mandated Territories,ntrols a continuous environment. The proposed framework extends the temporal logic approach which has proven useful for the formal analysis of discrete systems such as reactive programs. The new framework consists of a semantic model for hybrid time, the notion of ., which extends the formalism of d作者: 藐視 時間: 2025-3-28 11:47
The Modified Right to Self-Determination1,al properties is preferable to those approaches which preserve all temporal properties..It is shown that the approach advocated here is, except for formally developing programs, also applicable for . programs, i.e., for correcting programs which do not satisfy their required specification. This prov作者: 兇兆 時間: 2025-3-28 18:38 作者: 反省 時間: 2025-3-28 22:08 作者: Hyperalgesia 時間: 2025-3-29 01:17 作者: reject 時間: 2025-3-29 06:57 作者: 逗留 時間: 2025-3-29 10:07 作者: Culpable 時間: 2025-3-29 12:59
Preserving specific properties in program development,al properties is preferable to those approaches which preserve all temporal properties..It is shown that the approach advocated here is, except for formally developing programs, also applicable for . programs, i.e., for correcting programs which do not satisfy their required specification. This prov作者: 幾何學家 時間: 2025-3-29 18:38
,Sometimes ‘some’ is as good as ‘a(chǎn)ll’,f this specification) can be given. Moreover, under such a construction, no information about the program is lost by choosing exact existential specification rather than exact universal specification; it is possible to generalise, by means of a proof system, an exact existential specification into a作者: antecedence 時間: 2025-3-29 23:37
The duality of time and information, attached to choice and concurrency..We conclude with an assessment of the prospects for extending the duality to other organizations of time and information besides partial orders in order to accommodate real time, nonmonotonic logic, and automata that can forget, and speculate on the philosophical作者: Coordinate 時間: 2025-3-30 01:30 作者: abstemious 時間: 2025-3-30 06:15
Homology of higher dimensional automata,ies of the concurrent computation. We introduce bicomplexes as an algebraic tool for describing these automata and develop a simple homology theory for higher dimensional automata. We then show how the homology of automata has applications in the study of branching-time equivalences of processes such as bisimulation.作者: Lyme-disease 時間: 2025-3-30 09:31 作者: oncologist 時間: 2025-3-30 13:52
978-3-540-55822-4Springer-Verlag Berlin Heidelberg 1992作者: Encumber 時間: 2025-3-30 18:03
National Security and Investment Controls strong . weak . “up-to” techniques are proposed: They are respectively based on the use of expansion . almost-weak bisimulation. ..作者: 預定 時間: 2025-3-30 23:51 作者: Ambiguous 時間: 2025-3-31 01:42 作者: nonsensical 時間: 2025-3-31 06:58 作者: 修飾語 時間: 2025-3-31 12:21 作者: 我怕被刺穿 時間: 2025-3-31 15:06 作者: overweight 時間: 2025-3-31 17:58 作者: Confirm 時間: 2025-3-31 21:48
