We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted not as boolean values, but as real values in the interval [0,1]. Trace inclusion and equivalence give rise to asymmetrical and symmetrical linear distances, while simulation and bisimulation give rise to asymmetrical and symmetrical branching distances. We study the relationships among these distances, and we provide a full logical characterization of the distances in terms of quantitative versions of Ltl and -calculus. We show that, while trace inclusion (resp. equivalence) coincides with simulation (resp. bisimulation) for deterministic boolean transition systems, linear and branching distances do not coincide for deterministic quantitative transition systems. Finally, we provide algorithms for computing the distances, together with matching lower and upper complexity bounds. This research was supported in part by the NSF CAREER grant CCR-0132780, the NSF grant CCR-0234690, and the ONR grant N00014-02-1-0671.
|Number of pages||13|
|Publication status||Published - 2004|
|Event||Proc. 31st Int'l Colloq. on Automata, Languages and Programming (ICALP04) - Turku, Finland|
Duration: 12 Jul 2004 → 16 Jul 2004
|Workshop||Proc. 31st Int'l Colloq. on Automata, Languages and Programming (ICALP04)|
|Period||12/07/04 → 16/07/04|
|Other||July 12-16, 2004|