@conference {SS11,
	title = {Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems},
	booktitle = {Proceedings of the Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics (MFPS {\textquoteright}11)},
	series = {Electronic Notes in Theoretical Computer Science},
	volume = {276},
	year = {2011},
	month = {May},
	pages = {291{\textendash}{\textendash}311},
	publisher = {ACM},
	organization = {ACM},
	address = {Pittsburgh, PA, USA},
	abstract = {<p>Coalgebras provide a uniform framework to study dynamical systems, including several types of automata. In this paper, we make use of the coalgebraic view on systems to investigate, in a uniform way, under which conditions calculi that are sound and complete with respect to behavioral equivalence can be extended to a coarser coalgebraic language equivalence, which arises from a generalised powerset construction. We illustrate the framework with two examples: non-deterministic automata, for which we recover Rabinovich{\textquoteright}s sound and complete calculus for language equivalence, and weighted automata, for which we present the first sound and complete calculus for weighted language equivalence.</p>
},
	attachments = {https://haslab.uminho.pt/sites/default/files/xana/files/bms-11-draft.pdf},
	author = {Alexandra Silva and Ana Sokolova}
}