Titlebook: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency; School/Workshop, Noo J. W. Bakker,W. -P. Roever,G. Roze

聲音會爆炸

書目名稱Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency影響因子(影響力)




書目名稱Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency影響因子(影響力)學(xué)科排名




書目名稱Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency網(wǎng)絡(luò)公開度




書目名稱Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency被引頻次




書目名稱Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency被引頻次學(xué)科排名




書目名稱Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency年度引用




書目名稱Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency年度引用學(xué)科排名




書目名稱Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency讀者反饋




書目名稱Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency讀者反饋學(xué)科排名

橢圓

Process theory based on bisimulation semantics,inite systems of equations over the syntax of process algebra; (ii) inference systems which are complete for proving the equivalence of regular (finite state) processes; (iii) variations of the bisimulation model.

鳥籠

Overthrow

Observing processes,ere is some observation or test which distinguishes them. By choosing different notions of observations a range of behavioural theories is obtained. They include bisimulation equivalence, testing equivalence and a number of equivalences which distinguish concurrency from nondeterminism.

sleep-spindles

畫布

Basic notions of trace theory,ent concurrent processes in the same way as strings represent sequential ones. The theory of traces can be used as a tool for reasoning about nets and it is hoped that applying this theory one can get a calculus of the concurrent processes analogous to that available for sequential systems. The foll

Panacea

享樂主義者

A logic for the description of behaviours and properties of concurrent systems,andard operators of process algebras such as prefixing, non-deterministic choice, parallel composition and restriction. The process algebra operators are extended on unions of bisimulation classes.. is an extension of an algebra of sequential processes with strong bisimulation. A deductive system is

繼承人

Expressibility results for linear-time and branching-time logics,n of those CTL* formulas that can be expressed in linear-time logic. We also give a simple method for showing that certain CTL* formulas cannot be expressed in the branching-time logic CTL. Both results are illustrated with examples.

Ossification

Partial orderings descriptions and observations of nondeterministic concurrent processes,uction of a les providing the operational semantics of systems consists of three main steps. First, systems are decomposed into sets of sequential processes and a set of rewriting rules is introduced which describe both the actions sequential processes may perform and their causal relation. Then, th