標題: Titlebook: Coalgebraic Methods in Computer Science; 11th International W Dirk Pattinson,Lutz Schr?der Conference proceedings 2012 IFIP International F [打印本頁] 作者: estrange 時間: 2025-3-21 17:03
書目名稱Coalgebraic Methods in Computer Science影響因子(影響力)
書目名稱Coalgebraic Methods in Computer Science影響因子(影響力)學科排名
書目名稱Coalgebraic Methods in Computer Science網(wǎng)絡公開度
書目名稱Coalgebraic Methods in Computer Science網(wǎng)絡公開度學科排名
書目名稱Coalgebraic Methods in Computer Science被引頻次
書目名稱Coalgebraic Methods in Computer Science被引頻次學科排名
書目名稱Coalgebraic Methods in Computer Science年度引用
書目名稱Coalgebraic Methods in Computer Science年度引用學科排名
書目名稱Coalgebraic Methods in Computer Science讀者反饋
書目名稱Coalgebraic Methods in Computer Science讀者反饋學科排名
作者: 內(nèi)行 時間: 2025-3-21 23:33
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/228707.jpg作者: 全國性 時間: 2025-3-22 02:05
https://doi.org/10.1007/978-3-642-32784-1automata; coalgebra functors; lambda calculus; modal logics; operational semantics作者: 天真 時間: 2025-3-22 04:50 作者: 光明正大 時間: 2025-3-22 12:31 作者: Atmosphere 時間: 2025-3-22 13:14 作者: Atmosphere 時間: 2025-3-22 20:11 作者: comely 時間: 2025-3-22 22:11 作者: 自由職業(yè)者 時間: 2025-3-23 01:24
Screening Designs for Model Selection,inal coalgebras in Kleisli categories, stemming from an initial algebra in the underlying category. This approach requires some non-trivial assumptions, like dcpo enrichment, which do not always hold, even in cases where one can reasonably speak of traces (like for weighted automata). More recently,作者: legitimate 時間: 2025-3-23 07:23 作者: Vo2-Max 時間: 2025-3-23 13:33 作者: 破裂 時間: 2025-3-23 15:00
,Deconstructing Asylum Seekers’ Narratives,ibuted to the expansion law of such theories, but in truth, the problem is rooted in the concept of labelled transition system. We introduce a new type of system, in which, instead of labelled transitions, we have, essentially, sequences of labelled transitions. We call systems of this type labelled作者: addict 時間: 2025-3-23 21:01
,Filming Global Ireland: Roddy Doyle’s ,nizing ongoing MM-attacks is an important security task; modeling MM-interactions is an interesting task for semantics of computation. Traced monoidal categories are a natural framework for MM-modelling, as the trace structure provides a tool to hide what happens .. An effective analysis of what has作者: CRANK 時間: 2025-3-24 01:58 作者: 迎合 時間: 2025-3-24 05:15
Palgrave European Film and Media Studiess for a modal logic. These are constructed from syntax, and yield a generalised notion of canonical model. Further, expressivity of a modal logic is shown to be characterised by factorisation of its models via internal models and the existence of cospans of internal models.作者: 漫步 時間: 2025-3-24 09:19 作者: 傻瓜 時間: 2025-3-24 13:25
Zielgruppenanalyse und -ansprache,Finitary endofunctors of locally presentable categories are proved to have equational presentations. Special attention is paid to the Hausdorff functor of non-empty compact subsets of a complete metric space.作者: Certainty 時間: 2025-3-24 18:42
Relational Presheaves as Labelled Transition Systems,We show that viewing labelled transition systems as relational presheaves captures several recently studied examples. This approach takes into account possible algebraic structure on labels. Weak closure of a labelled transition system is characterised as a left (2-)adjoint to a change-of-base functor.作者: overreach 時間: 2025-3-24 19:30 作者: 燈泡 時間: 2025-3-24 23:21 作者: 令人不快 時間: 2025-3-25 04:12 作者: 收藏品 時間: 2025-3-25 07:51 作者: Creditee 時間: 2025-3-25 15:14 作者: vibrant 時間: 2025-3-25 17:22 作者: 火車車輪 時間: 2025-3-25 20:32
Defining Context-Free Power Series Coalgebraically,braic approach provides a unified view on many, at first sight different, existing notions of algebraicity, and we apply our behavioural differential equations to produce a new proof for a classical result by Chomsky and Schützenberger, and a simple proof that the zip-operator of two algebraic streams is algebraic.作者: 我邪惡 時間: 2025-3-26 01:24
Internal Models for Coalgebraic Modal Logics,s for a modal logic. These are constructed from syntax, and yield a generalised notion of canonical model. Further, expressivity of a modal logic is shown to be characterised by factorisation of its models via internal models and the existence of cospans of internal models.作者: 驚奇 時間: 2025-3-26 07:34 作者: 洞穴 時間: 2025-3-26 11:43 作者: constitute 時間: 2025-3-26 13:05
Defining Context-Free Power Series Coalgebraically,braic approach provides a unified view on many, at first sight different, existing notions of algebraicity, and we apply our behavioural differential equations to produce a new proof for a classical result by Chomsky and Schützenberger, and a simple proof that the zip-operator of two algebraic strea作者: 棲息地 時間: 2025-3-26 17:01
Structural Operational Semantics for Continuous State Probabilistic Processes,antics of these systems can be defined as algebras and coalgebras of suitable endofunctors over ., the category of measurable spaces. In order to give a more concrete representation for these coalgebras, we present an SOS-like rule format which induces an abstract GSOS over .; this format is proved 作者: opinionated 時間: 2025-3-26 22:40
Stream Automata Are Coalgebras, these structures has not been given yet. We study a simple two-sorted setting where deterministic Muller automata can be cast as coalgebras, so that coalgebraic bisimilarity coincides with language equivalence. From this characterisation, we derive concise and natural decision procedures for comple作者: PAC 時間: 2025-3-27 05:11 作者: 偽造 時間: 2025-3-27 05:17 作者: CREEK 時間: 2025-3-27 12:20 作者: 深陷 時間: 2025-3-27 14:46
From Transitions to Executions,ibuted to the expansion law of such theories, but in truth, the problem is rooted in the concept of labelled transition system. We introduce a new type of system, in which, instead of labelled transitions, we have, essentially, sequences of labelled transitions. We call systems of this type labelled作者: harrow 時間: 2025-3-27 20:49 作者: FEIGN 時間: 2025-3-27 23:50 作者: temperate 時間: 2025-3-28 02:30
Internal Models for Coalgebraic Modal Logics,s for a modal logic. These are constructed from syntax, and yield a generalised notion of canonical model. Further, expressivity of a modal logic is shown to be characterised by factorisation of its models via internal models and the existence of cospans of internal models.作者: 清楚 時間: 2025-3-28 07:33
Structural Operational Semantics for Continuous State Probabilistic Processes,ses with measure terms..As an example application, we model a CCS-like calculus of processes placed in an Euclidean space. The approach we follow in this case can be readily adapted to other quantitative aspects, e.g.?Quality of Service, physical and chemical parameters in biological systems, etc.作者: aesthetic 時間: 2025-3-28 11:39 作者: 落葉劑 時間: 2025-3-28 18:01 作者: 下垂 時間: 2025-3-28 19:50 作者: 假設 時間: 2025-3-28 23:09
Screening Designs for Model Selection,Moore algebras. In order to exploit its finality, we identify an extension operation, that changes the state space of a coalgebra into a free algebra, which abstractly captures determinization of automata. Notably, we show that the two different views on trace semantics are equivalent, in the exampl作者: fender 時間: 2025-3-29 05:27
,Filming Global Ireland: Roddy Doyle’s , elements have to be compared by a not necessarily decidable relation and (2) coinductive types are mixed with inductive ones. Still, a formal development has been carried out in Coq, by using its built-in language for proof automation..Another extension of the original bisimulation relation based o作者: 1分開 時間: 2025-3-29 11:07 作者: 摘要 時間: 2025-3-29 11:50 作者: Paradox 時間: 2025-3-29 17:57 作者: 推崇 時間: 2025-3-29 23:06
Screening Asylum in a Culture of Disbelieftion lifting . that is a lax extension extending the coalgebra functor . and preserving diagonal relations, .-bisimilarity captures behavioral equivalence. We also show that if . is finitary, it admits such an extension iff there is a separating set of finitary monotone predicate liftings for ..作者: FADE 時間: 2025-3-30 00:16 作者: MAIM 時間: 2025-3-30 07:14
From Transitions to Executions,e conditions under which that concept agrees with the intuitive understanding of equivalence of branching structure that one has for these systems, and examine their relationship with labelled transition systems, precisely characterizing the difference in expressive power and branching complexity between the two kinds of systems.作者: 勛章 時間: 2025-3-30 09:31 作者: maudtin 時間: 2025-3-30 12:36
Tracing the Man in the Middle in Monoidal Categories,tive, i.e. coalgebraic structure over terms and messages used in computation and communication. The correspondence is established using a convenient monadic description of normally traced monoidal categories.
