Forward Analysis and Model Checking for Trace Bounded WSTS

Details Forward Analysis and Model Checking for Trace Bounded WSTS Forward Analysis and Model Checking for Trace Bounded WSTS

2010-04-16

arxiv.org/abs/1004.2802v3

In Kristensen, L.M. and Petrucci, L., editors, Petri Nets 2011, 32nd International Conference on Application and Theory of Pet

Computer Science

Logic in Computer Science

Scientific paper

10.1007/978-3-642-21834-7_4

We investigate a subclass of well-structured transition systems (WSTS), the bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (ICALP 2009). Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, boundedness is decidable. Boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all {\omega}-regular properties on the set of infinite traces of the system.

Affiliated with

Also associated with

No associations

Rating

Forward Analysis and Model Checking for Trace Bounded WSTS 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 Forward Analysis and Model Checking for Trace Bounded WSTS, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Forward Analysis and Model Checking for Trace Bounded WSTS will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-623851