Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
Fairness
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
The Evolving Philosophers Problem: Dynamic Change Management
IEEE Transactions on Software Engineering
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Model Checking LTL Properties of High-Level Petri Nets with Fairness Constraints
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Distributed Computing
Model Checking with Strong Fairness
Formal Methods in System Design
Theoretical Computer Science
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
PAT: Towards Flexible Verification under Fairness
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
On-the-fly Emptiness Check of Transition-Based Streett Automata
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Automata-theoretic model checking revisited
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
The linear temporal logic of rewriting Maude model checker
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A dash of fairness for compositional reasoning
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Localized fairness: a rewriting semantics
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
On-the-fly emptiness checks for generalized büchi automata
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Model checking LTLR formulas under localized fairness
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
| Hi-index | 0.00 |
In modeling a concurrent system, fairness constraints are usually considered at a specific granularity level of the system, leading to many different variants of fairness: transition fairness, object/process fairness, actor fairness, etc. These different notions of fairness can be unified by making explicit their parametrization over the relevant entities in the system as universal quantification. We propose a state/event-based framework as well as an on-the-fly model checking algorithm to verify LTL properties under universally quantified parametric fairness assumptions, specified by generalized strong/weak fairness formulas. It enables verification of temporal properties under fairness conditions associated to dynamic entities such as new process creations. We have implemented our algorithm within the Maude system.