Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[كتاب][B] Introduction to coalgebra
B Jacobs - 2017 - books.google.com
The area of coalgebra has emerged within theoretical computer science with a unifying
claim: to be the mathematics of computational dynamics. It combines ideas from the theory of …
claim: to be the mathematics of computational dynamics. It combines ideas from the theory of …
Generic trace semantics via coinduction
Trace semantics has been defined for various kinds of state-based systems, notably with
different forms of branching such as non-determinism vs. probability. In this paper we claim …
different forms of branching such as non-determinism vs. probability. In this paper we claim …
Expressive quantale-valued logics for coalgebras: an adjunction-based approach
We address the task of deriving fixpoint equations from modal logics characterizing
behavioural equivalences and metrics (summarized under the term conformances). We rely …
behavioural equivalences and metrics (summarized under the term conformances). We rely …
Expressivity of quantitative modal logics: Categorical foundations via codensity and approximation
A modal logic that is strong enough to fully characterize the behavior of a system is called
expressive. Recently, with the growing diversity of systems to be reasoned about …
expressive. Recently, with the growing diversity of systems to be reasoned about …
[HTML][HTML] Trace semantics via determinization
This paper takes a fresh look at the topic of trace semantics in the theory of coalgebras. In
the last few years, two approaches, somewhat incomparable at first sight, captured …
the last few years, two approaches, somewhat incomparable at first sight, captured …
Hennessy-Milner theorems via Galois connections
We introduce a general and compositional, yet simple, framework that allows us to derive
soundness and expressiveness results for modal logics characterizing behavioural …
soundness and expressiveness results for modal logics characterizing behavioural …
Coalgebraic modal logic beyond sets
Polyadic coalgebraic modal logic is studied in the setting of locally presentable categories. It
is shown that under certain assumptions, accessible functors admit expressive logics for …
is shown that under certain assumptions, accessible functors admit expressive logics for …
Expressive logics for coinductive predicates
The classical Hennessy-Milner theorem says that two states of an image-finite transition
system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In …
system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In …
Trace semantics via determinization
This paper takes a fresh look at the topic of trace semantics in the theory of coalgebras. The
first development of coalgebraic trace semantics used final coalgebras in Kleisli categories …
first development of coalgebraic trace semantics used final coalgebras in Kleisli categories …
Coalgebraic trace semantics via forgetful logics
We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility
of the approach with concrete examples such as the language semantics of weighted …
of the approach with concrete examples such as the language semantics of weighted …