Titlebook: CONCUR ‘92; Third International W.R. Cleaveland Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 Analyse-Algorithmen.Ana

bradycardia

書目名稱CONCUR ‘92影響因子(影響力)




書目名稱CONCUR ‘92影響因子(影響力)學科排名




書目名稱CONCUR ‘92網絡公開度




書目名稱CONCUR ‘92網絡公開度學科排名




書目名稱CONCUR ‘92被引頻次




書目名稱CONCUR ‘92被引頻次學科排名




書目名稱CONCUR ‘92年度引用




書目名稱CONCUR ‘92年度引用學科排名




書目名稱CONCUR ‘92讀者反饋




書目名稱CONCUR ‘92讀者反饋學科排名

自然環(huán)境

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

光亮

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

尾隨

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

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

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

BLANK

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

擁擠前

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

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