2012
Authors
Bonsangue, MM; Clarke, D; Silva, A;
Publication
Sci. Comput. Program.
Abstract
2012
Authors
Bonchi, F; Bonsangue, M; Boreale, M; Rutten, J; Silva, A;
Publication
INFORMATION AND COMPUTATION
Abstract
Weighted automata are a generalisation of non-deterministic automata where each transition, in addition to an input letter, has also a quantity expressing the weight (e.g. cost or probability) of its execution. As for non-deterministic automata, their behaviours can be expressed in terms of either (weighted) bisimilarity or (weighted) language equivalence. Coalgebras provide a categorical framework for the uniform study of state-based systems and their behaviours. In this work, we show that coalgebras can, suitably model weighted automata in two different ways: coalgebras on Set (the category of sets and functions) characterise weighted bisimilarity, while coalgebras on Vect (the category of vector spaces and linear maps) characterise weighted language equivalence. Relying on the second characterisation, we show three different procedures for computing weighted language equivalence. The first one consists in a generalisation of the usual partition refinement algorithm for ordinary automata. The second one is the backward version of the first one. The third procedure relies on a syntactic representation of rational weighted languages.
2011
Authors
Silva, A; Bonchi, F; Bonsangue, MM; Rutten, JJMM;
Publication
Inf. Comput.
Abstract
2010
Authors
Silva, A; Rutten, JJMM;
Publication
Inf. Comput.
Abstract
2012
Authors
Bonchi, F; Bonsangue, M; Caltais, G; Rutten, J; Silva, A;
Publication
Electronic Notes in Theoretical Computer Science
Abstract
In concurrency theory, various semantic equivalences on labelled transition systems are based on traces enriched or decorated with some additional observations. They are generally referred to as decorated traces, and examples include ready, failure, trace and complete trace equivalence. Using the generalized powerset construction, recently introduced by a subset of the authors [13], we give a coalgebraic presentation of decorated trace semantics. This yields a uniform notion of canonical, minimal representatives for the various decorated trace equivalences, in terms of final Moore automata. As a consequence, proofs of decorated trace equivalence can be given by coinduction, using different types of (Moore-) bisimulation (up-to), which is helpful for automation. © 2012 Elsevier B.V.
2011
Authors
Silva, A; Sokolova, A;
Publication
Electr. Notes Theor. Comput. Sci.
Abstract
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.