標(biāo)題: 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 [打印本頁] 作者: 聲音會爆炸 時間: 2025-3-21 17:42
書目名稱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é)科排名
作者: 橢圓 時間: 2025-3-21 22:55
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.作者: 鳥籠 時間: 2025-3-22 02:08 作者: Overthrow 時間: 2025-3-22 07:00
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 時間: 2025-3-22 12:15 作者: 畫布 時間: 2025-3-22 16:28
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 時間: 2025-3-22 18:27 作者: 享樂主義者 時間: 2025-3-22 21:48
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作者: 繼承人 時間: 2025-3-23 05:05
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 時間: 2025-3-23 09:12
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作者: 舞蹈編排 時間: 2025-3-23 16:20 作者: 付出 時間: 2025-3-23 19:29 作者: 宇宙你 時間: 2025-3-23 23:00
Fully abstract models for a process language with refinement,y to capture degrees of nonsequentiality of processes. We present four full abstractness results. The operational equivalences are based on maximal action-sequences and step-sequences — defined for a very simple process language and its extensions with a refinement combinator (change of atomicity). 作者: 檢查 時間: 2025-3-24 04:23 作者: aggravate 時間: 2025-3-24 06:47 作者: 調(diào)整 時間: 2025-3-24 11:21
text for graduate students and a reference work for research.Complex plasmas differ from traditional plasmas in many ways: these are low-temperature high pressure systems containing nanometer to micrometer size particles which may be highly charged and strongly interacting. The particles may be chem作者: 狗窩 時間: 2025-3-24 15:35 作者: DAFT 時間: 2025-3-24 19:12 作者: 注入 時間: 2025-3-24 23:18 作者: Mindfulness 時間: 2025-3-25 05:57 作者: Charitable 時間: 2025-3-25 11:02 作者: WAX 時間: 2025-3-25 15:16
Antoni Mazurkiewicz by (pseudo)reflections. These are groups whose polynomial ring of invariants is a polynomial algebra...It has recently been discovered that complex reflection groups play a key role in the theory of finite reductive groups, giving rise as they do to braid groups and generalized Hecke algebras which作者: 不如屎殼郎 時間: 2025-3-25 19:48 作者: Console 時間: 2025-3-25 20:22 作者: 敲竹杠 時間: 2025-3-26 00:15
Gérard Boudol,Ilaria Castellanire than 40 figures and numerous examples and exercises.Defin.This book discusses the complex theory of differential equations or more precisely, the theory of differential equations on complex-analytic manifolds.. . Although the theory of differential equations on real manifolds is well known – it i作者: palette 時間: 2025-3-26 06:03 作者: 口音在加重 時間: 2025-3-26 10:12 作者: 敬禮 時間: 2025-3-26 14:43 作者: Emmenagogue 時間: 2025-3-26 18:06 作者: 螢火蟲 時間: 2025-3-27 00:19 作者: exhilaration 時間: 2025-3-27 04:27
ome sequences, which tend to be large, it is important to apply efficient methods of string matching. Traditional string matching methods are guaranteed to take time ., where . is the length of the text. By preprocessing a set of patterns into a keyword tree, this time requirement can be extended to作者: Grasping 時間: 2025-3-27 06:16 作者: Junction 時間: 2025-3-27 09:35
Wolfgang Reisigunknown amino acid sequence is compared to a set of profiles characterizing known protein families. Such comparisons between profiles and anonymous sequences are often more sensitive than pairwise comparisons. Profiles can be rewritten as profile hidden Markov models. Hidden Markov models are based 作者: Mast-Cell 時間: 2025-3-27 14:40 作者: 雄偉 時間: 2025-3-27 18:37
Branching time temporal logic,ir decision procedures to the tasks of mechanical synthesis and verification. A comparison of the relative expressive power of these systems of branching time temporal logic is also presented, and their ability to specify important correctness properties of programs, including those that involve fai作者: 和藹 時間: 2025-3-28 00:47 作者: alcoholism 時間: 2025-3-28 05:11 作者: PRO 時間: 2025-3-28 07:23 作者: 來這真柔軟 時間: 2025-3-28 12:16
E. M. Clarke,I. A. Draghicescuppeals to advanced undergraduate and graduate students, and also to researchers wanting to familiarize themselves with the subject..978-3-319-51743-8978-3-319-51744-5Series ISSN 1660-8046 Series E-ISSN 1660-8054 作者: fixed-joint 時間: 2025-3-28 14:52 作者: GROVE 時間: 2025-3-28 22:19 作者: 可轉(zhuǎn)變 時間: 2025-3-28 23:27
A. Rabinovich,B. A. Trakhtenbrot the authors..This textbook is intended for students enrolled in courses in computational biology or bioinformatics as well as for molecular biologists, mathematicians, and computer scientists..978-3-7643-7387-0作者: deviate 時間: 2025-3-29 06:28 作者: Aggressive 時間: 2025-3-29 10:07
Johan van Benthemry, experiment and computer simulation in this field. Based on tutorial lectures at a very successful recent Summer Institute, the presentation is ideally suited for graduate students, plasma physicists and experienced undergraduates. .978-3-642-26427-6978-3-642-10592-0Series ISSN 1615-5653 Series E-ISSN 2197-6791 作者: nettle 時間: 2025-3-29 13:57
J. A. Bergstra,J. W. KlopSpringer theory on eigenspaces. In doing so, we also introduce basic definitions and properties of the associated braid groups, as well as a quick introduction to Bessis‘ lifting of Springer theory to braid groups..978-3-642-11174-7978-3-642-11175-4Series ISSN 0075-8434 Series E-ISSN 1617-9692 作者: 種族被根除 時間: 2025-3-29 16:07
E. Allen Emerson,Jai SrinivasanSpringer theory on eigenspaces. In doing so, we also introduce basic definitions and properties of the associated braid groups, as well as a quick introduction to Bessis‘ lifting of Springer theory to braid groups..978-3-642-11174-7978-3-642-11175-4Series ISSN 0075-8434 Series E-ISSN 1617-9692 作者: 格言 時間: 2025-3-29 20:54
M HennessySpringer theory on eigenspaces. In doing so, we also introduce basic definitions and properties of the associated braid groups, as well as a quick introduction to Bessis‘ lifting of Springer theory to braid groups..978-3-642-11174-7978-3-642-11175-4Series ISSN 0075-8434 Series E-ISSN 1617-9692 作者: 離開真充足 時間: 2025-3-30 02:02 作者: Tincture 時間: 2025-3-30 05:30 作者: 含沙射影 時間: 2025-3-30 08:40
Glynn WinskelSpringer theory on eigenspaces. In doing so, we also introduce basic definitions and properties of the associated braid groups, as well as a quick introduction to Bessis‘ lifting of Springer theory to braid groups..978-3-642-11174-7978-3-642-11175-4Series ISSN 0075-8434 Series E-ISSN 1617-9692 作者: 合適 時間: 2025-3-30 15:21
A. Bouajjani,S. Graf,J. SifakisSpringer theory on eigenspaces. In doing so, we also introduce basic definitions and properties of the associated braid groups, as well as a quick introduction to Bessis‘ lifting of Springer theory to braid groups..978-3-642-11174-7978-3-642-11175-4Series ISSN 0075-8434 Series E-ISSN 1617-9692 作者: Inclement 時間: 2025-3-30 18:37 作者: 青少年 時間: 2025-3-30 21:50 作者: 粉筆 時間: 2025-3-31 04:11
Wolfgang Reisige classical problems that need to be solved for HMMs to be useful in biological sequence analysis: the scoring, the detection, and the training problem. Efficient solution of these problems leads to many applications of HMMs in biology, including homology detection, for which profiles were originall作者: 商業(yè)上 時間: 2025-3-31 07:33
J. J. M. M. Ruttene classical problems that need to be solved for HMMs to be useful in biological sequence analysis: the scoring, the detection, and the training problem. Efficient solution of these problems leads to many applications of HMMs in biology, including homology detection, for which profiles were originall作者: escalate 時間: 2025-3-31 09:18 作者: malapropism 時間: 2025-3-31 14:42
Linear Time, Branching Time and Partial Order in Logics and Models for ConcurrencySchool/Workshop, Noo作者: Disk199 時間: 2025-3-31 18:16 作者: Kindle 時間: 2025-3-31 22:25
A logic for distributed transition systems,rough a set of actions occurring concurrently. Our logical language has the minimal features of linear time temporal logic and that of propositional dynamic logic. Our main result implies that satisfiability in our logical system is decidable.作者: Nuance 時間: 2025-4-1 04:55
Fully abstract models for a process language with refinement,tion-sequences and step-sequences — defined for a very simple process language and its extensions with a refinement combinator (change of atomicity). The denotational models are all expressed as abstractions of a standard association of sets of labelled partial orders with processes.作者: Insulin 時間: 2025-4-1 08:40 作者: 用樹皮 時間: 2025-4-1 11:38 作者: THE 時間: 2025-4-1 15:42
Time, logic and computation,ar continuity of logical concerns emerges between philosophy, linguistics and computer science. But, the latter adds several new themes and perspectives which might well give it a significant impact on the earlier standard enterprise.作者: 送秋波 時間: 2025-4-1 21:14 作者: 先兆 時間: 2025-4-2 00:14 作者: 服從 時間: 2025-4-2 04:35
Basic notions of trace theory,owing topics will be discussed: algebraic properties of traces, trace models of some concurrency phenomena, fixed-point calculus for finding the behaviour of nets, modularity, and some applications of the presented theory.
