Verification of multiprocess probabilistic protocols
Distributed Computing
Limits for automatic verification of finite-state concurrent systems
Information Processing Letters
Reasoning about networks with many identical finite-state processes
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Information and Computation
Reasoning in a restricted temporal logic
Information and Computation
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A structural induction theorem for processes
Information and Computation
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Termination of probabilistic concurrent programs: (extended abstract)
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic Deductive Verification with Invisible Invariants
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying Properties of Large Sets of Processes with Network Invariants
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Veryfying Parameterized Networks using Abstraction and Regular Languages
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Parameterized Verification with Automatically Computed Inductive Assertions
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Automatic Verification of Parameterized Synchronous Systems (Extended Abstract)
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
A Platform for Combining Deductive with Algorithmic Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Reducing Model Checking of the Many to the Few
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
STeP: The Stanford Temporal Prover
STeP: The Stanford Temporal Prover
Possibilistic and Probabilistic Abstraction-Based Model Checking
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Model-Checking and Abstraction to the Aid of Parameterized Systems
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Parameterized verification by probabilistic abstraction
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Model checking almost all paths can be less expensive than checking all paths
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
SAS'05 Proceedings of the 12th international conference on Static Analysis
Defining Fairness in Reactive and Concurrent Systems
Journal of the ACM (JACM)
Model checking and abstraction to the aid of parameterized systems (a survey)
Computer Languages, Systems and Structures
Reasoning about almost-certain convergence properties using Event-B
Science of Computer Programming
| Hi-index | 0.00 |
We study automatic methods for establishing P-validity (validity with probability 1) of simple temporal properties over finite-state probabilistic systems. The proposed approach replaces P-validity with validity over a non-probabilistic version of the system, in which probabilistic choices are replaced by non-deterministic choices constrained by compassion (strong fairness) requirements. "Simple" properties are temporal properties whose only temporal operators are l (eventually) and its dual 驴 (always). In general, the appropriate compassion requirements are "global," since they involve global states of the system. Yet, in many cases they can be transformed into "local" requirements, which enables their verification by model checkers. We demonstrate our methodology of translating the problem of P-validity into that of verification of a system with local compassion requirement on the "courteous philosophers" algorithm of [LR81], a parameterized probabilistic system that is notoriously difficult to verify, and outline a verification of the algorithm that was obtained by the tlv model checker.