Paper Info
Title
Simulation Is Decidable for One-Counter Nets (Extended Abstract)
Abstract
)Parosh Aziz AbdullaDept. of Computer SystemsP.O. Box 325S-751 05 Uppsala, Swedenparosh@docs.uu.seKarlisCeransInstitute of Mathematicsand Computer ScienceUniversity of Latviakarlis@cclu.lvAbstractWe prove that the simulation preorder is decidable for the class of one-counter nets. A one-counternet consists of a finite-state machine operating on a variable (counter) which ranges over the naturalnumbers. Each transition can increase or decrease the value of the counter. A...
Year
Venue
Keywords
1998
CONCUR
one-counter nets,extended abstract,finite state machine
Field
DocType
ISBN
Discrete mathematics,Computer science,Decidability
Conference
3-540-64896-8
Citations 
PageRank 
References 
19
1.33
17
Authors
2
Name
Order
Citations
PageRank
Parosh Aziz Abdulla12010122.22
Karlis Cerans231448.74