On divergence-sensitive weak probabilistic bisimilarity

DOI10.1016/J.IC.2023.105033MaRDI QIDQ6040671zbMATH OpenFDO

Authors Kangli He, Hengyang Wu, Yixiang Chen

Publication date 19 May 2023

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2023.105033

zbMATH Keywords

concurrencydivergenceprobabilistic automatonverificationweak probabilistic bisimulation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Analyzing divergence in bisimulation semantics
• Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
• Bisimulation minimization and symbolic model checking
• Branching time and abstraction in bisimulation semantics
• CCS expressions, finite state processes, and three problems of equivalence
• Cost preserving bisimulations for probabilistic automata
• Deciding probabilistic automata weak bisimulation: theory and practice
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1927574 (Why is no real title available?)
• scientific article; zbMATH DE number 7559464 (Why is no real title available?)
• scientific article; zbMATH DE number 3060775 (Why is no real title available?)
• Minimal probabilistic P systems for modelling ecological systems
• Polynomial time decision algorithms for probabilistic automata
• Testing Finitary Probabilistic Processes
• Three Partition Refinement Algorithms

Cited in

(1)

• A unifying approach to probabilistic testing equivalences

This page was built for publication: On divergence-sensitive weak probabilistic bisimilarity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6040671)