A Classification of Symbolic Transition Systems

Details A Classification of Symbolic Transition Systems A Classification of Symbolic Transition Systems

2001-01-16

arxiv.org/abs/cs/0101013v1

Computer Science

Logic in Computer Science

21 pages

Scientific paper

We define five increasingly comprehensive classes of infinite-state systems,
called STS1--5, whose state spaces have finitary structure. For four of these
classes, we provide examples from hybrid systems.

Affiliated with

Also associated with

No associations

Rating

A Classification of Symbolic Transition Systems 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 A Classification of Symbolic Transition Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Classification of Symbolic Transition Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-296152