Titlebook: Relational and Algebraic Methods in Computer Science; 18th International C Uli Fahrenberg,Peter Jipsen,Michael Winter Conference proceeding

Aggrief

书目名称Relational and Algebraic Methods in Computer Science影响因子(影响力)




书目名称Relational and Algebraic Methods in Computer Science影响因子(影响力)学科排名




书目名称Relational and Algebraic Methods in Computer Science网络公开度




书目名称Relational and Algebraic Methods in Computer Science网络公开度学科排名




书目名称Relational and Algebraic Methods in Computer Science被引频次




书目名称Relational and Algebraic Methods in Computer Science被引频次学科排名




书目名称Relational and Algebraic Methods in Computer Science年度引用




书目名称Relational and Algebraic Methods in Computer Science年度引用学科排名




书目名称Relational and Algebraic Methods in Computer Science读者反馈




书目名称Relational and Algebraic Methods in Computer Science读者反馈学科排名

oncologist

Commutative Doubly-Idempotent Semirings Determined by Chains and by Preorder Forests,all .. Bounded distributive lattices are cdi-semirings that satisfy ., and the variety of cdi-semirings covers the variety of bounded distributive lattices. Chajda and Länger showed in 2017 that the variety of all cdi-semirings is generated by a 3-element cdi-semiring. We show that there are seven c

Detoxification

友好

Hardness of Network Satisfaction for Relation Algebras with Normal Representations, contains a non-trivial equivalence relation with a finite number of equivalence classes, then the network satisfaction problem for . is NP-hard. As a second result, we prove hardness if . has domain size at least three and contains no non-trivial equivalence relations but a symmetric atom . with a

IVORY

绿州

Bisimilarity of Diagrams,lly defined using the theory of open maps of Joyal et al., we prove two characterisations of this bisimilarity: it is equivalent to the existence of a bisimulation-like relation and has a logical characterisation à la Hennessy and Milner. We then prove that we capture both path bisimilarity and stro

植物茂盛

Generating Posets Beyond ,their basic algebraic properties as well as the hierarchy of gluing-parallel posets generated from singletons by finitary applications of the two compositions. We show that not only series-parallel posets, but also interval orders, which seem more interesting for modelling concurrent and distributed

泰然自若

Automated Algebraic Reasoning for Collections and Local Variables with Lenses,mated proof in the Isabelle/UTP verification framework. In this paper, we expand our lens library with (1) dynamic lenses, that support mutable indexed collections, such as arrays, and (2) symmetric lenses, which allow partitioning of a state space into disjoint local and global regions to support v

Corral

积习难改