Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
Bisimulation through probabilistic testing
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Weak Bisimulation is Sound and Complete for PCTL*
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Category Theory and Computer Science
Weak Bisimulation and Open Maps
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A hierarchy of probabilistic system types
Theoretical Computer Science - Selected papers of CMCS'03
An Exercise on Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebraising Subsequential Transducers
Electronic Notes in Theoretical Computer Science (ENTCS)
New Bisimulation Semantics for Distributed Systems
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Weak bisimilarity coalgebraically
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Subsequential transducers: a coalgebraic perspective
Information and Computation
A categorical view of timed weak bisimulation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
We propose a coalgebraic definition of weak bisimulation for a class of coalgebras obtained from bifunctors over the category Set. Weak bisimilarity for a system is obtained as strong bisimilarity of a transformed system. The transformation consists of two steps: First, the behaviour on actions is expanded to behaviour on finite words. Second, the behaviour on finite words is taken modulo the hiding of invisible actions, yielding behaviour on equivalence classes of words closed under silent steps. The coalgebraic definition is justified by two correspondence results, one for the classical notion of weak bisimulation of Milner and another for the notion of weak bisimulation for generative probabilistic transition systems as advocated by Baier and Hermanns.