Dense Counter Machines and Verification Problems

15 years 10 months ago

Download www.eecs.wsu.edu

We generalize the traditional definition of a multicounter machine (where the counters, which can only assume nonnegative integer values, can be incremented/decremented by 1 and tested for zero) by allowing the machine the additional ability to increment/decrement the counters by a nondeterministically chosen fractional amount

Gaoyan Xie, Zhe Dang, Oscar H. Ibarra, Pierluigi S

Real-time Traffic

Binary Reachability Set | CAV 2003 | Hardware | Nonnegative Integer Values | Semilinear Language |

claim paper

» Model checking memoryful lineartime logics over onecounter automata

Post Info
More Details (n/a)

Added	23 Aug 2010
Updated	23 Aug 2010
Type	Conference
Year	2003
Where	CAV
Authors	Gaoyan Xie, Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro

Comments (0)

Sciweavers

Dense Counter Machines and Verification Problems

Binary Reachability Set | CAV 2003 | Hardware | Nonnegative Integer Values | Semilinear Language |

Explore & Download

Productivity Tools

Sciweavers