{"id":{"repo_id":"radboud","oai_identifier":"oai:repository.ubn.ru.nl:2066/32095"},"canonical_url":"https://search.dev.ndltd.org/etd/radboud/oai:repository.ubn.ru.nl:2066/32095","repository":{"repo_id":"radboud","name":"Radboud University Nijmegen","base_url":"https://repository.ubn.ru.nl/oai/request"},"display":{"title":"Tracing Anonymity with Coalgebras","abstract":"Contains fulltext : 32095_tracanwic.pdf (Publisher’s version ) (Open Access)","abstract_html":"Contains fulltext : 32095_tracanwic.pdf (Publisher’s version ) (Open Access)","abstract_has_math":false,"creators":["Hasuo, I."],"institution":"[S.l.] : [S.n.]","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Jacobs, B.P.F."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2008,"date_issued":"2008","date_published":"2008","updated_at":"2026-07-24T04:01:29Z","subjects":["Digital Security"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2066/72428","9789090228273"],"render_values":[{"text":"http://hdl.handle.net/2066/72428","href":"http://hdl.handle.net/2066/72428","code":true},{"text":"9789090228273","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2066/32095","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Jacobs, B.P.F."]},{"key":"dc:creator","label":"Author","values":["Hasuo, I."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2008"]},{"key":"dc:publisher","label":"Institution","values":["[S.l.] : [S.n.]"]},{"key":"dc:type","label":"Dc Type","values":["Doctoral thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Digital Security"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://repository.ubn.ru.nl//bitstream/handle/2066/32095/32095_tracanwic.pdf","http://hdl.handle.net/2066/32095","http://hdl.handle.net/2066/72428","9789090228273"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Contains fulltext : 32095_tracanwic.pdf (Publisher’s version ) (Open Access)","The aim of this thesis is to obtain better understanding of the nature of computer systems, that is, to develop a mathematical theory of computer systems. By computer systems we mean information-processing systems consisting of computers. We cannot overemphasize their important roles in the modern world. Unfortunately, however, computer systems are very much error-prone at the same time. This thesis ultimately aims at proper understanding of computer systems which will help us getting them right; we do so through extending the theory of coalgebras. The use of coalgebras as a mathematical model of state-based systems has been increasingly recognized in the last couple of decades. We follow this view since, we believe, the theory of coalgebras has a right balance of (potential) applicability and mathematical simplicity. The very core of the existing theory of coalgebras that we start with can be summarized as follows. - A system is modeled mathematically as a coalgebra; - a behavior-preserving map between systems as a morphism of coalgebras; and - the behavior of a system is given by the principle of coinduction. These points have been established by many authors in a large body of existing work. In each chapter of this thesis, however, we try to shed new light on them.","RU Radboud Universiteit Nijmegen, 10 maart 2008","Promotor : Jacobs, B.P.F.","188 p."]},{"key":"dc:title","label":"Title","values":["Tracing Anonymity with Coalgebras"]}]}],"canonical_facts":{"dc:contributor":["Jacobs, B.P.F."],"dc:creator":["Hasuo, I."],"dc:date":["2008"],"dc:description":["Contains fulltext : 32095_tracanwic.pdf (Publisher’s version ) (Open Access)","The aim of this thesis is to obtain better understanding of the nature of computer systems, that is, to develop a mathematical theory of computer systems. By computer systems we mean information-processing systems consisting of computers. We cannot overemphasize their important roles in the modern world. Unfortunately, however, computer systems are very much error-prone at the same time. This thesis ultimately aims at proper understanding of computer systems which will help us getting them right; we do so through extending the theory of coalgebras. The use of coalgebras as a mathematical model of state-based systems has been increasingly recognized in the last couple of decades. We follow this view since, we believe, the theory of coalgebras has a right balance of (potential) applicability and mathematical simplicity. The very core of the existing theory of coalgebras that we start with can be summarized as follows. - A system is modeled mathematically as a coalgebra; - a behavior-preserving map between systems as a morphism of coalgebras; and - the behavior of a system is given by the principle of coinduction. These points have been established by many authors in a large body of existing work. In each chapter of this thesis, however, we try to shed new light on them.","RU Radboud Universiteit Nijmegen, 10 maart 2008","Promotor : Jacobs, B.P.F.","188 p."],"dc:identifier":["https://repository.ubn.ru.nl//bitstream/handle/2066/32095/32095_tracanwic.pdf","http://hdl.handle.net/2066/32095","http://hdl.handle.net/2066/72428","9789090228273"],"dc:publisher":["[S.l.] : [S.n.]"],"dc:subject":["Digital Security"],"dc:title":["Tracing Anonymity with Coalgebras"],"dc:type":["Doctoral thesis"]},"updated_at":"2026-07-24T04:01:29Z"}