標(biāo)題: Titlebook: Relational and Algebraic Methods in Computer Science; 14th International C Peter H?fner,Peter Jipsen,Martin Eric Müller Conference proceedi [打印本頁] 作者: DIGN 時(shí)間: 2025-3-21 17:33
書目名稱Relational and Algebraic Methods in Computer Science影響因子(影響力)
書目名稱Relational and Algebraic Methods in Computer Science影響因子(影響力)學(xué)科排名
書目名稱Relational and Algebraic Methods in Computer Science網(wǎng)絡(luò)公開度
書目名稱Relational and Algebraic Methods in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Relational and Algebraic Methods in Computer Science被引頻次
書目名稱Relational and Algebraic Methods in Computer Science被引頻次學(xué)科排名
書目名稱Relational and Algebraic Methods in Computer Science年度引用
書目名稱Relational and Algebraic Methods in Computer Science年度引用學(xué)科排名
書目名稱Relational and Algebraic Methods in Computer Science讀者反饋
書目名稱Relational and Algebraic Methods in Computer Science讀者反饋學(xué)科排名
作者: Demulcent 時(shí)間: 2025-3-21 23:40
A Modified Completeness Theorem of KAT and Decidability of Term Reducibility KAT is proved, and via the completeness theorem, the decision problem of ??.?∈?P. (.?=?.) is reduced to a certain membership problem of regular languages, to which a pseudo-identity-based decision method is applicable. Based on this reduction, an instance of the problem is studied and shown to be decidable.作者: 伴隨而來 時(shí)間: 2025-3-22 02:27
Kleene Algebra with Converse, that allows us to prove that the considered equational theory lies in the complexity class ...Specific regular languages appear at various places in the proofs. Those proofs were made tractable by considering appropriate automata recognising those languages, and exploiting symmetries in those automata.作者: interlude 時(shí)間: 2025-3-22 05:19 作者: licence 時(shí)間: 2025-3-22 10:08 作者: 加強(qiáng)防衛(wèi) 時(shí)間: 2025-3-22 13:16
Type-2 Fuzzy Controllers in Arrow Categories before discussing the extension to a type-2 controller. We discuss how to model type reduction, an essential component of any type-2 controller. In addition, we provide a number of examples of general type reducers.作者: crockery 時(shí)間: 2025-3-22 17:11
Relation Algebra and , Applied to Approval Votinged Computer Algebra system .. Therefore, this tool can be used to solve the problems and to visualize the computed results. The entire approach is extremely formal but also very flexible. In combination with . it is especially appropriate for prototyping and experimentation, and as such very instructive for educational purposes.作者: 殺蟲劑 時(shí)間: 2025-3-22 21:12 作者: bromide 時(shí)間: 2025-3-23 04:22 作者: asthma 時(shí)間: 2025-3-23 08:22 作者: opinionated 時(shí)間: 2025-3-23 13:19
Concurrent Kleene Algebra with Testsconcurrency inequation and have a Kleene-star for both sequential and concurrent composition. Kleene algebra with tests (KAT) were defined earlier by Kozen and Smith [KS97]. . (CKAT) combine these concepts and give a relatively simple algebraic model for reasoning about operational semantics of conc作者: characteristic 時(shí)間: 2025-3-23 17:39
Algebras for Program Correctness in Isabelle/HOLations of tests. Our structured comprehensive libraries for these algebras extend an existing Kleene algebra library. It includes an algebraic account of Hoare logic for partial correctness and several refinement and concurrency control laws in a total correctness setting. Formalisation examples inc作者: CLAIM 時(shí)間: 2025-3-23 19:51 作者: FLING 時(shí)間: 2025-3-24 00:38
A Modified Completeness Theorem of KAT and Decidability of Term Reducibility formulas ∧?...?=?..?→?.?=?. in KAT has been studied so far by several researchers. Continuing this line of research, this paper studies the decidability of existentially quantified equational formulas ??.?∈?P. (.?=?.) in KAT, where P is a fixed collection of KAT terms. A new completeness theorem of作者: harangue 時(shí)間: 2025-3-24 05:40
Kleene Algebra with Converseas studied by Bernátsky, Bloom, ésik, and Stefanescu in 1995. We reformulate some of their proofs in syntactic and elementary terms, and we provide a new algorithm to decide the corresponding theory. This algorithm is both simpler and more efficient; it relies on an alternative automata construction作者: Magnitude 時(shí)間: 2025-3-24 09:18 作者: Lucubrate 時(shí)間: 2025-3-24 11:10
Extended Conscriptions Algebraicallyt to initial states. We show that they instantiate existing algebras for iteration and infinite computations. We use these algebras to derive an approximation order for conscriptions and one for extended conscriptions, which additionally represent aborting executions. We give a new computation model作者: 隱語 時(shí)間: 2025-3-24 18:18
Abstract Dynamic Frames concepts, properties and behaviour of that theory in a pointfree fashion. Moreover, relationships to abstract concepts of separation logic are given to pave the way for a unified treatment of both approaches. In particular, we also sketch the main ideas within the framework of local actions.作者: Affiliation 時(shí)間: 2025-3-24 22:18 作者: Inscrutable 時(shí)間: 2025-3-25 01:22
On Faults and Faulty Programstails unspecified. An incorrect program may be corrected in many different ways, involving different numbers of modifications. Hence neither the location nor the number of of faults may be defined in a unique manner; this, in turn, sheds a cloud of uncertainty on such concepts as fault density, and 作者: 喚醒 時(shí)間: 2025-3-25 05:33 作者: FECT 時(shí)間: 2025-3-25 09:36 作者: LATER 時(shí)間: 2025-3-25 13:37
A Mechanised Abstract Formalisation of Concept Lattices], [Mos13]. We do this in the abstract setting of locally ordered categories with converse (OCCs) with residuals and direct powers, without requiring meets (as in allegories) or joins (as in Kleene categories). The abstract formalisation has the advantage that it can be used both for theoretical rea作者: QUAIL 時(shí)間: 2025-3-25 18:39
A Sufficient Condition for Liftable Adjunctions between Eilenberg-Moore Categoriesry of .′-algebras over .-algebras. The leading example is an adjunction between the category of idempotent semirings and the category of quantales, where . is the finite powerset monad, .′ is the powerset monad, and . is the free monoid monad. The left adjoint of this leading example is given by ide作者: podiatrist 時(shí)間: 2025-3-25 23:50 作者: 厭倦嗎你 時(shí)間: 2025-3-26 01:54 作者: 反饋 時(shí)間: 2025-3-26 04:29 作者: 孤獨(dú)無助 時(shí)間: 2025-3-26 09:03
Extended Conscriptions Algebraicallyximation order for conscriptions and one for extended conscriptions, which additionally represent aborting executions. We give a new computation model which generalises extended conscriptions and apply the algebraic techniques for a unified treatment.作者: 叫喊 時(shí)間: 2025-3-26 14:22 作者: incredulity 時(shí)間: 2025-3-26 17:18
A Mechanised Abstract Formalisation of Concept Latticesmeets (as in allegories) or joins (as in Kleene categories). The abstract formalisation has the advantage that it can be used both for theoretical reasoning, and for executable implementations, by instantiating it with appropriate choices of concrete OCCs.作者: 減弱不好 時(shí)間: 2025-3-26 21:23
Conference proceedings 2014d in specific fields on concurrent Kleene algebras and related formalisms, reasoning about computations and programs, heterogeneous and categorical approaches, applications of relational and algebraic methods and developments related to modal logics and lattices..作者: 陰謀小團(tuán)體 時(shí)間: 2025-3-27 02:13
Developments in Concurrent Kleene Algebra concepts which have proved useful in reasoning about concurrent programs, for example causal dependency and independence, sequentiality and concurrency, allocation and disposal, synchrony and asynchrony, sharing and locality, input and output.作者: 注視 時(shí)間: 2025-3-27 05:44
A Point-Free Relation-Algebraic Approach to General Topologyology, open sets topology, etc., this seems important..Lifting concepts to a relational and, thus, algebraically manipulable and shorthand form, shows that existential and inverse images must here be used for structure comparison. Applying the relational language . to such topological concepts allows to study and also visualize them.作者: 憤世嫉俗者 時(shí)間: 2025-3-27 13:19 作者: decipher 時(shí)間: 2025-3-27 17:06 作者: 受辱 時(shí)間: 2025-3-27 20:07
0302-9743 2014 held in Marienstatt, Germany, in April/May 2014..The 25 revised full papers presented were carefully selected from 37 submissions. The papers are structured in specific fields on concurrent Kleene algebras and related formalisms, reasoning about computations and programs, heterogeneous and cate作者: 厚顏 時(shí)間: 2025-3-28 01:24 作者: 諄諄教誨 時(shí)間: 2025-3-28 02:10 作者: CLASP 時(shí)間: 2025-3-28 10:12
Endowing Concurrent Kleene Algebra with Communication Actionsunication and concurrency called Communicating Concurrent Kleene Algebra (C.KA). C.KAextends concurrent Kleene algebra with the notion of communication actions. This extension captures both the influence of external stimuli on agent behaviour aswell as the communication and concurrency of communicating agents.作者: 鎮(zhèn)痛劑 時(shí)間: 2025-3-28 10:56 作者: Confirm 時(shí)間: 2025-3-28 15:02
Abstract Dynamic Frames concepts, properties and behaviour of that theory in a pointfree fashion. Moreover, relationships to abstract concepts of separation logic are given to pave the way for a unified treatment of both approaches. In particular, we also sketch the main ideas within the framework of local actions.作者: 可行 時(shí)間: 2025-3-28 20:54
978-3-319-06250-1Springer International Publishing Switzerland 2014作者: 關(guān)節(jié)炎 時(shí)間: 2025-3-29 01:48 作者: 小臼 時(shí)間: 2025-3-29 05:32 作者: 確認(rèn) 時(shí)間: 2025-3-29 09:25 作者: Conduit 時(shí)間: 2025-3-29 12:26 作者: 寬大 時(shí)間: 2025-3-29 18:29 作者: helper-T-cells 時(shí)間: 2025-3-29 20:10
Takeo Uramoto of finite noncooperative games has been collected in Chapter 2, with renumbering of the material of the remain- ing chapters. New sections have been added in this chapter: devoted to general questions of equilibrium theory in nondegenerate games, subsections 3.9-3.17, by N.N. Vorob‘ev, Jr.; and § 4作者: Irremediable 時(shí)間: 2025-3-30 03:28 作者: FLINT 時(shí)間: 2025-3-30 07:43
Michael Winterystems. Such control and maintenance systems can be generically described as being composed of 5 analysis steps: (1) predict the expected system signals from their measured values, (2) use the residual of the measured and predicted value to determine if the system is operating in a nominal or a degr作者: 新陳代謝 時(shí)間: 2025-3-30 10:06 作者: HARD 時(shí)間: 2025-3-30 15:41
Rudolf Berghammer,Nikita Danilenko,Henning Schnoororithm (IPGA) under different fitness functions will advance efforts to obtain a theory of adaptation for the simple GA. Unfortunately, for IPGAs with long genomes and non-trivial fitness functions there do not currently exist theoretical results that allow such a study. We develop a simple framewor作者: 協(xié)迫 時(shí)間: 2025-3-30 16:49
Concurrent Kleene Algebra with Testshe test algebra is assumed to be {0,1} the language model reduces to the regular sets of bounded-width sp-strings of Lodaya and Weil..Since the concurrent composition operator distributes over join, it can also be added to relation algebras with transitive closure to obtain the variety CRAT. We prov作者: Kidnap 時(shí)間: 2025-3-30 21:24 作者: Debate 時(shí)間: 2025-3-31 02:00 作者: 燒瓶 時(shí)間: 2025-3-31 07:47 作者: TERRA 時(shí)間: 2025-3-31 12:07
Tony Hoare,Stephan van Staden,Bernhard M?ller,Georg Struth,Jules Villard,Huibiao Zhu,Peter O’Hearn.Eachpart contains a set of papers on a common subject, so that the reader can ?nd similar papers grouped together. Some of these parts comprise the papers of o978-3-540-72917-4978-3-540-72950-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Customary 時(shí)間: 2025-3-31 14:28 作者: dissent 時(shí)間: 2025-3-31 18:18 作者: 清澈 時(shí)間: 2025-3-31 22:43 作者: 撫育 時(shí)間: 2025-4-1 02:11
