State/Event-Based LTL Model Checking under Parametric Generalized Fairness

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 to verify LTL properties under parametric fairness, specified by generalized strong/weak fairness formulas. We also present an onthe-fly automata-based algorithm for model checking LTL formulas under universally quantified parameterized fairness assumptions. 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.