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影响因子(影响力)学科排名




书目名称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网络公开度学科排名




书目名称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被引频次学科排名




书目名称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年度引用学科排名




书目名称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读者反馈学科排名

椭圆

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