Rational series and their languages
Rational series and their languages
Bisimulation through probabilistic testing
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
Noncommutative minimization algorithms
Information Processing Letters
Exact performance equivalence: an equivalence relation for stochastic automata
Theoretical Computer Science
Deciding bisimilarity and similarity for probabilistic processes
Journal of Computer and System Sciences
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Quantifying the Dynamic Behavior of Process Algebras
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Coinductive counting with weighted automata
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Bisimulation relations for weighted automata
Theoretical Computer Science
Probabilistic i/o automata: theories of two equivalences
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Quantitative Kleene coalgebras
Information and Computation
A coalgebraic perspective on linear weighted automata
Information and Computation
A coalgebraic perspective on minimization and determinization
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa ). In a lwa , the state-space of the automaton is represented by a vector space, and the transitions and weighting maps by linear morphisms over this vector space. Weighted bisimulations are represented by sub-spaces that are invariant under the transition morphisms. We show that the largest bisimulation coincides with weighted language equivalence, can be computed by a geometrical version of partition refinement and that the corresponding quotient gives rise to the minimal weighted-language equivalence automaton. Relations to Larsen and Skou's probabilistic bisimulation and to classical results in Automata Theory are also discussed.