The following pages link to Bisimulation of automata (Q1822987):
Displaying 13 items.
- Petri nets and bisimulation (Q672873) (← links)
- CCS expressions, finite state processes, and three problems of equivalence (Q918211) (← links)
- An algebraic characterization of observational equivalence (Q1351804) (← links)
- Topological characterisation of multi-buffer simulation (Q1685786) (← links)
- Bisimulation relations for weighted automata (Q2481957) (← links)
- Automated Generation of BSP Automata (Q4598934) (← links)
- Bisimilarity in Fresh-Register Automata (Q4635800) (← links)
- Hybrid automata with finite bisimulations (Q4645189) (← links)
- Enumerated BSP Automata (Q4686652) (← links)
- Morphisms and Minimisation of Weighted Automata (Q5038573) (← links)
- Convenient category of processes and simulations I: Modulo strong bisimilarity (Q5057463) (← links)
- Formal Techniques for Networked and Distributed Systems - FORTE 2005 (Q5479164) (← links)
- Compatibility of refining and controlling plant automata with bisimulation quotients (Q6174416) (← links)