Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Deciding bisimilarity and similarity for probabilistic processes
Journal of Computer and System Sciences
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Game-based Abstraction for Markov Decision Processes
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Partial Order Reduction for Probabilistic Branching Time
Electronic Notes in Theoretical Computer Science (ENTCS)
Logical characterizations of bisimulations for discrete probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree Analysis
IEEE Transactions on Dependable and Secure Computing
The Max-Flow Min-Cut theorem for countable networks
Journal of Combinatorial Theory Series B
On Probabilistic Automata in Continuous Time
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Probabilistic Logical Characterization
Information and Computation
Characterising probabilistic processes logically
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Characteristic formulae for fixed-point semantics: A general framework
Mathematical Structures in Computer Science
Revisiting weak simulation for substochastic markov chains
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
| Hi-index | 0.00 |
Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae of many non-probabilistic behavioral relations. Our paper studies their techniques in a probabilistic setting. We provide a general method for determining characteristic formulae of behavioral relations for probabilistic automata using fixed-point probability logics. We consider such behavioral relations as simulations and bisimulations, probabilistic bisimulations, probabilistic weak simulations, and probabilistic forward simulations. This paper shows how their constructions and proofs can follow from a single common technique.