tracing relations probalistically

Full metadata record

DC Field	Value	Language
dc.contributor.author	Doberkat, Ernst-Erich	de
dc.date.accessioned	2004-12-06T12:55:01Z	-
dc.date.available	2004-12-06T12:55:01Z	-
dc.date.created	2003	de
dc.date.issued	2003-04-23	de
dc.identifier.uri	http://hdl.handle.net/2003/2674	-
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-14963	-
dc.description.abstract	We investigate similarities between non-deterministic and probabilistic ways of describing a system in terms of computation trees. We first show that the construction of traces for both kinds of relations follow the same principles of construction (which could be described in terms of monads, but this does not happen here). Finally representations of measurable trees in terms of probabilistic relations are given.	en
dc.format.extent	278530 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	de
dc.publisher	Universität Dortmund	de
dc.relation.ispartofseries	Internes Memorandum des Lehrstuhls für Software-Technologie / Fachbereich Informatik, Universität Dortmund ; 134	de
dc.subject	probabilistic relations	en
dc.subject	representation theory	en
dc.subject	specification techniques (nondeterministic, stochastic)	en
dc.subject.ddc	004	de
dc.title	tracing relations probalistically	en
dc.type	Text	de
dc.type.publicationtype	workingPaper	-
dcterms.accessRights	open access	-
Appears in Collections:	LS 10 Software-Technologie

Files in This Item:

File	Description	Size	Format
134.pdf	DNB	272 kB	Adobe PDF	View/Open

This item is protected by original copyright

Show simple item record

This item is protected by original copyright rightsstatements.org