標(biāo)題: Titlebook: Coalgebraic Methods in Computer Science; 12th IFIP WG 1.3 In Marcello M. Bonsangue Conference proceedings 2014 IFIP International Federati [打印本頁] 作者: Halloween 時(shí)間: 2025-3-21 17:41
書目名稱Coalgebraic Methods in Computer Science影響因子(影響力)
書目名稱Coalgebraic Methods in Computer Science影響因子(影響力)學(xué)科排名
書目名稱Coalgebraic Methods in Computer Science網(wǎng)絡(luò)公開度
書目名稱Coalgebraic Methods in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Coalgebraic Methods in Computer Science被引頻次
書目名稱Coalgebraic Methods in Computer Science被引頻次學(xué)科排名
書目名稱Coalgebraic Methods in Computer Science年度引用
書目名稱Coalgebraic Methods in Computer Science年度引用學(xué)科排名
書目名稱Coalgebraic Methods in Computer Science讀者反饋
書目名稱Coalgebraic Methods in Computer Science讀者反饋學(xué)科排名
作者: LUT 時(shí)間: 2025-3-21 22:43
On Coalgebras with Internal Movesurators for coalgebras with internal moves. Here, we give necessary conditions for them to yield the same notion of weak bisimulation. Finally, we propose a definition of trace semantics for coalgebras with silent moves via a uniform fixed point operator. We compare strong and weak bisimilation toge作者: rods366 時(shí)間: 2025-3-22 00:33
Categories of Coalgebras with Monadic Homomorphismsmomorphisms with unifiable substitution components..We formalised the presented development in Agda, which crucially aided the exploration of the complex interaction of the different functors, and enables us to report all theorems as mechanically verified.作者: angiography 時(shí)間: 2025-3-22 07:21 作者: overture 時(shí)間: 2025-3-22 11:22
https://doi.org/10.1057/9780230602106urators for coalgebras with internal moves. Here, we give necessary conditions for them to yield the same notion of weak bisimulation. Finally, we propose a definition of trace semantics for coalgebras with silent moves via a uniform fixed point operator. We compare strong and weak bisimilation toge作者: chlorosis 時(shí)間: 2025-3-22 16:13 作者: chlorosis 時(shí)間: 2025-3-22 17:14
Generic Weakest Precondition Semantics from Monads Enriched with Order enriched by posets. It is inspired by Jacobs’ recent identification of a categorical structure that is common in various predicate transformers, but adds generality in the following aspects: (1) different notions of modality (such as “may” vs. “must”) are captured by Eilenberg-Moore algebras; (2) n作者: 一再遛 時(shí)間: 2025-3-22 22:18
Coalgebraic Multigamess, games can be viewed as elements of a . for a suitable functor, and operations on games can be analyzed in terms of (generalized) .. Coalgebraic games are . in nature, . at each step either the Left (L) or the Right (R) player moves (.), moreover only a . move can be performed at each step. Recent作者: 狗窩 時(shí)間: 2025-3-23 03:22 作者: Antecedent 時(shí)間: 2025-3-23 05:51
On Coalgebras with Internal Moves systems semantics. We claim that these transitions are always part of the unit of a certain monad. Hence, coalgebras with internal moves are exactly coalgebras over a monadic type. The rest of the paper is devoted to supporting our claim by studying two important behavioural equivalences for state-作者: 脫落 時(shí)間: 2025-3-23 12:51
A Coalgebraic View of Characteristic Formulas in Equational Modal Fixed Point Logicsulation preorders. An important problem in this area from the point of view of logic is to find formulas that characterize states in finite transition systems with respect to these various relations. Recent work by Aceto et al. shows how such characterizing formulas in equational modal fixed point l作者: Monolithic 時(shí)間: 2025-3-23 17:30
Coalgebraic Simulations and Congruencesassume that . is a set of monotonic predicate liftings and their proofs are set-theoretical. We give a different definition of simulation, called strong simulation, which has several advantages:.Our notion agrees with that of [.] in the presence of monotonicity, but it has the advantage, that it all作者: Negotiate 時(shí)間: 2025-3-23 20:46
Dijkstra Monads in Monadic Computationby a theorem prover. Here we give a more general description of such Dijkstra monads in a categorical setting. We first elaborate the recently developed view on program semantics in terms of a triangle of computations, state transformers, and predicate transformers. Instantiations of this triangle f作者: 抗體 時(shí)間: 2025-3-24 00:56
Categories of Coalgebras with Monadic Homomorphismsributed graphs, with attributes taken from (term) algebras over arbitrary signatures do not fit directly into this kind of transformation approach, since algebras containing function symbols taking two or more arguments do not allow component-wise construction of pushouts. We show how shifting from 作者: ECG769 時(shí)間: 2025-3-24 05:35
Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions From a categorical perspective this construction is the right adjoint to the inclusion functor from the category of deterministic automata to the category of nondeterministic automata. This is in fact an adjunction between two categories of coalgebras: deterministic automata are coalgebras over . a作者: Mri485 時(shí)間: 2025-3-24 09:53
Canonical Nondeterministic Automatae minimal dfa for . in a locally finite variety ., and apply an equivalence between the finite .-algebras and a category of finite structured sets and relations. By instantiating this to different varieties we recover three well-studied canonical nfas (the átomaton, the jiromaton and the minimal xor作者: 朝圣者 時(shí)間: 2025-3-24 13:17 作者: Osteons 時(shí)間: 2025-3-24 16:52 作者: 沒有準(zhǔn)備 時(shí)間: 2025-3-24 20:29 作者: faction 時(shí)間: 2025-3-25 02:50
Dijkstra Monads in Monadic Computationom the state monad transformation applied to ., to the Dijkstra monad associated with .. This monad map is precisely the weakest precondition map in the triangle, given in categorical terms by substitution.作者: CAMEO 時(shí)間: 2025-3-25 06:05
Conference proceedings 20144, colocated with ETAPS 2014, held in Grenoble, France, in April 2014. The 10 revised full papers were carefully reviewed and selected from 20 submissions. Also included are three invited talks. The papers cover a wide range of topics in the theory, logics and applications of coalgebras.作者: entreat 時(shí)間: 2025-3-25 09:02
0302-9743 braic Methods in Computer Science, CMCS 2014, colocated with ETAPS 2014, held in Grenoble, France, in April 2014. The 10 revised full papers were carefully reviewed and selected from 20 submissions. Also included are three invited talks. The papers cover a wide range of topics in the theory, logics 作者: Mortal 時(shí)間: 2025-3-25 12:03 作者: magnate 時(shí)間: 2025-3-25 18:19 作者: 低位的人或事 時(shí)間: 2025-3-25 20:30 作者: 聰明 時(shí)間: 2025-3-26 02:49 作者: ORBIT 時(shí)間: 2025-3-26 08:06 作者: FLIC 時(shí)間: 2025-3-26 08:58
,The ‘Troubles Comedy’ and Unionism, automaton) and obtain a new canonical nfa called the distromaton. We prove that each of these nfas is minimal relative to a suitable measure, and give conditions for state-minimality. Our approach is coalgebraic, exhibiting additional structure and universal properties.作者: 教義 時(shí)間: 2025-3-26 12:38 作者: Injunction 時(shí)間: 2025-3-26 17:57 作者: 吹牛需要藝術(shù) 時(shí)間: 2025-3-26 23:57 作者: fiction 時(shí)間: 2025-3-27 03:56
,The End of ‘Troubles Cinema’?,tions. Then we illustrate this technique in length: we recover several constructions on automata as liftings of basic adjunctions including determinization of nondeterministic and join automata, codeterminization, and the dualization of linear weighted automata. Finally, we show how to use the lifted adjunction to check behavioral equivalence.作者: contradict 時(shí)間: 2025-3-27 08:53 作者: 對手 時(shí)間: 2025-3-27 12:32
Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructionstions. Then we illustrate this technique in length: we recover several constructions on automata as liftings of basic adjunctions including determinization of nondeterministic and join automata, codeterminization, and the dualization of linear weighted automata. Finally, we show how to use the lifted adjunction to check behavioral equivalence.作者: Melanocytes 時(shí)間: 2025-3-27 14:25
How to Kill Epsilons with a Daggersystems by taking into account the algebraic structure of the labels of their transitions. This allows to consider a wide range of other examples, including Mazurkiewicz traces for concurrent systems.作者: 揮舞 時(shí)間: 2025-3-27 18:09
Coalgebraic Simulations and Congruencesows diagrammatic reasoning, so several results from the mentioned paper can be obtained by simple diagram chases. We clarify the role of .-monotonicity by showing the equivalence?of. We relate the notion to bisimulations and .-congruences - which are defined as pullbacks of homomorphisms. We show that作者: 團(tuán)結(jié) 時(shí)間: 2025-3-27 23:32
Canonical Nondeterministic Automata automaton) and obtain a new canonical nfa called the distromaton. We prove that each of these nfas is minimal relative to a suitable measure, and give conditions for state-minimality. Our approach is coalgebraic, exhibiting additional structure and universal properties.作者: 觀察 時(shí)間: 2025-3-28 03:25
Towards Systematic Construction of Temporal Logics for Dynamical Systems via Coalgebran be seen as coalgebras in various ways. Secondly, a straightforward standard construction of modal logics out of coalgebras, namely Moss’s coalgebraic logic, is applied. Lastly, the resulting systems are characterized with respect to the temporal properties they express.作者: Colonoscopy 時(shí)間: 2025-3-28 10:18
Algebraic–Coalgebraic Recursion Theory of History-Dependent Dynamical System Modelsd transformed into instantaneous state. The framework can be connected to philosophical and epistemological discourse on one side, and to algorithmic considerations for computational modeling on the other.作者: diabetes 時(shí)間: 2025-3-28 11:04 作者: cortisol 時(shí)間: 2025-3-28 18:39
Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract)Higher-order languages have been widely studied in functional programming, following the .-calculus. In a higher-order calculus, variables may be instantiated with terms of the language. When multiple occurrences of the variable exist, this mechanism results in the possibility of copying the terms of the language.作者: BLANK 時(shí)間: 2025-3-28 22:09 作者: condone 時(shí)間: 2025-3-29 02:35 作者: 幼兒 時(shí)間: 2025-3-29 06:45
Conference proceedings 20144, colocated with ETAPS 2014, held in Grenoble, France, in April 2014. The 10 revised full papers were carefully reviewed and selected from 20 submissions. Also included are three invited talks. The papers cover a wide range of topics in the theory, logics and applications of coalgebras.作者: 產(chǎn)生 時(shí)間: 2025-3-29 09:23 作者: 馬籠頭 時(shí)間: 2025-3-29 11:53
The Alien Whiteness of Scarlett Johansson,s, games can be viewed as elements of a . for a suitable functor, and operations on games can be analyzed in terms of (generalized) .. Coalgebraic games are . in nature, . at each step either the Left (L) or the Right (R) player moves (.), moreover only a . move can be performed at each step. Recent作者: 分離 時(shí)間: 2025-3-29 18:27 作者: 新義 時(shí)間: 2025-3-29 20:41
https://doi.org/10.1057/9780230602106 systems semantics. We claim that these transitions are always part of the unit of a certain monad. Hence, coalgebras with internal moves are exactly coalgebras over a monadic type. The rest of the paper is devoted to supporting our claim by studying two important behavioural equivalences for state-作者: 不利 時(shí)間: 2025-3-30 02:28 作者: noxious 時(shí)間: 2025-3-30 04:09
https://doi.org/10.1057/9780230602106assume that . is a set of monotonic predicate liftings and their proofs are set-theoretical. We give a different definition of simulation, called strong simulation, which has several advantages:.Our notion agrees with that of [.] in the presence of monotonicity, but it has the advantage, that it all作者: STALE 時(shí)間: 2025-3-30 10:39 作者: Longitude 時(shí)間: 2025-3-30 15:29
Screening Twentieth Century Europeributed graphs, with attributes taken from (term) algebras over arbitrary signatures do not fit directly into this kind of transformation approach, since algebras containing function symbols taking two or more arguments do not allow component-wise construction of pushouts. We show how shifting from 作者: Judicious 時(shí)間: 2025-3-30 19:47
