Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Daniel Schwencke"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 3 (2013)
Terminal coalgebras for a functor serve as semantic domains for state-based systems of various types. For example, behaviors of CCS processes, streams, infinite trees, formal languages and non-well-founded sets form terminal coalgebras. We present a
Externí odkaz:
https://doaj.org/article/1821ce7e953c47668be8429003e98200
Autor:
Daniel Schwencke
Publikováno v:
CMCS
Coequations, which are subsets of a cofree coalgebra, can be viewed as properties of systems. In case of a polynomial functor, a logic of coequations was formulated by J. Adámek. However, the logic is more complicated for other functors than polynom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a6109ec6763115d28366b1833d170e6
There has been recent research on the analysis and assessment of human-machine interaction in railways based on barriers. Considering the theory of multiple resources, we take this approach further and develop additional assessment criteria as well a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::319252393b50a4aa0d8a7462c4e41767
https://elib.dlr.de/85266/
https://elib.dlr.de/85266/
Terminal coalgebras for a functor serve as semantic domains for state-based systems of various types. For example, behaviors of CCS processes, streams, infinite trees, formal languages and non-well-founded sets form terminal coalgebras. We present a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ecae6718ef0d77daad13ed09c6c3bdd
Publikováno v:
Foundations of Software Science and Computational Structures ISBN: 9783642120312
FoSSaCS
FoSSaCS
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, non-well-founded sets and behaviors of CCS processes form final coalgebras. We present a uniform account of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::796f487f84a73ec435db62b30e01b569
https://doi.org/10.1007/978-3-642-12032-9_22
https://doi.org/10.1007/978-3-642-12032-9_22
Publikováno v:
Algebra and Coalgebra in Computer Science ISBN: 9783642037405
CALCO
CALCO
Completely iterative algebras (cias) are those algebras in which recursive equations have unique solutions. In this paper we study complete iterativity for algebras with computational effects (described by a monad). First, we prove that for every ana
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56303417fdcbdf0726113a9eebe00395
https://doi.org/10.1007/978-3-642-03741-2_4
https://doi.org/10.1007/978-3-642-03741-2_4
Autor:
Daniel Schwencke
Publikováno v:
Information and Computation. (12):1469-1489
Covarieties of coalgebras are those classes of coalgebras for an endofunctor H on the category of sets that are closed under coproducts, subcoalgebras and quotients. Equivalently, covarieties are classes of H-coalgebras that can be presented by coequ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ccc0b3c38329638eaddc0446bc5dc451