ACM Transactions on Computer Systems (TOCS)
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Three partition refinement algorithms
SIAM Journal on Computing
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)
Stochastic process algebras—between LOTOS and Markov chains
Computer Networks and ISDN Systems - Special issue: trends in formal description techniques
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
Using the exact state space of a Markov model to compute approximate stationary measures
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Communication and Concurrency
Efficient Computation and Representation of Large Reachability Sets for Composed Automata
Discrete Event Dynamic Systems
Hierarchical Structuring of Superposed GSPNs
IEEE Transactions on Software Engineering
Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A Notion of Equivalence for Stochastic Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Verifying Continuous Time Markov Chains
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Bisimulation for Labelled Markov Processes
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Weak bisimulation for (max/+) automata and related models
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)
Optimal state-space lumping in Markov chains
Information Processing Letters
Backward Stochastic Bisimulation in CSL Model Checking
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
A Bialgebraic Approach to Automata and Formal Language Theory
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Deriving Syntax and Axioms for Quantitative Regular Behaviours
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Weighted Bisimulation in Linear Algebraic Form
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Backward and forward bisimulation minimization of tree automata
Theoretical Computer Science
Model Checking for a Class of Weighted Automata
Discrete Event Dynamic Systems
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
Electronic Notes in Theoretical Computer Science (ENTCS)
Linking algebraic observational equivalence and bisimulation
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Fragments-based Model Reduction: Some Case Studies
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantitative Kleene coalgebras
Information and Computation
Automatica (Journal of IFAC)
Simulations of weighted tree automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
A randomised inference algorithm for regular tree languages
Natural Language Engineering
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
A coalgebraic perspective on linear weighted automata
Information and Computation
Lumpability abstractions of rule-based systems
Theoretical Computer Science
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
Typed linear algebra for weigthed (probabilistic) automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
ACM Transactions on Computational Logic (TOCL)
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
| Hi-index | 5.23 |
Bisimulation is a well known equivalence relation for discrete event systems and has been extended to probabilistic and stochastic systems. This paper introduces a general definition of bisimulation which can be applied to finite automata where weights and labels are assigned to transitions. It is shown that this general view contains several known bisimulations as special cases and defines naturally equivalences for different classes of models. Apart from the well known forward bisimulation, also backward bisimulation is introduced and it is shown that both types of bisimulation preserve different types of results. Furthermore it is shown that forward and backward bisimulation are congruences according to commonly known composition operations for automata.