Semirings, automata, languages
Semirings, automata, languages
Three partition refinement algorithms
SIAM Journal on Computing
An implementation of an efficient algorithm for bisimulation equivalence
Science of Computer Programming
Bisimulation through probabilistic testing
Information and Computation
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Stochastic process algebras—between LOTOS and Markov chains
Computer Networks and ISDN Systems - Special issue: trends in formal description techniques
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
Communication and Concurrency
Automata, Languages, and Machines
Automata, Languages, and Machines
Pattern-matching problems for two-dimensional images described by finite automata
Nordic Journal of Computing
Abstraction in Probabilistic Process Algebra
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Methods and Applications of (MAX, +) Linear Algebra
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Finite-state transducers in language and speech processing
Computational Linguistics
Bisimulation relations for weighted automata
Theoretical Computer Science
Placement Inference for a Client-Server Calculus
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Component Simulation-based Substitutivity Managing QoS Aspects
Electronic Notes in Theoretical Computer Science (ENTCS)
Model Checking for a Class of Weighted Automata
Discrete Event Dynamic Systems
Component simulation-based substitutivity managing QoS and composition issues
Science of Computer Programming
Coinduction in Concurrent Timed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In this paper we propose a notion of weak bisimulation for a class of weighted automata with unobservable transitions where weights are taken from an idempotent semiring. In particular the (max/+), (min/+) or (max/min) dioid are considered. The proposed bisimulation is a natural extension of Milner's well known weak bisimulation for untimed automata (i.e., weighted automata over the boolean semiring). It is shown that weakly equivalent automata yield identical results with respect to the weights of arbitrarily labelled paths. The basic steps of an algorithm for the computation of the largest weak bisimulation relation for a given weighted automaton is outlined. Furthermore we present composition operations for weighted automata and prove that weak bisimulation is a congruence according to the composition operations presented in this paper.