Distances for Weighted Transition Systems: Games and Properties

Details Distances for Weighted Transition Systems: Games and Properties Distances for Weighted Transition Systems: Games and Properties

2011-07-06

arxiv.org/abs/1107.1205v1

EPTCS 57, 2011, pp. 134-147

Computer Science

Logic in Computer Science

In Proceedings QAPL 2011, arXiv:1107.0746

Scientific paper

10.4204/EPTCS.57.10

We develop a general framework for reasoning about distances between transition systems with quantitative information. Taking as starting point an arbitrary distance on system traces, we show how this leads to natural definitions of a linear and a branching distance on states of such a transition system. We show that our framework generalizes and unifies a large variety of previously considered system distances, and we develop some general properties of our distances. We also show that if the trace distance admits a recursive characterization, then the corresponding branching distance can be obtained as a least fixed point to a similar recursive characterization. The central tool in our work is a theory of infinite path-building games with quantitative objectives.

Affiliated with

Also associated with

No associations

Rating

Distances for Weighted Transition Systems: Games and Properties does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distances for Weighted Transition Systems: Games and Properties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distances for Weighted Transition Systems: Games and Properties will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-678844