In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...
In the current discussion of the impact Web 2.0 may have on CSCW and Groupware research, Web 2.0 applications are often considered to be a substitute for Collaboration Support Sys...
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
away concepts from the surface form of the text. The authors argue that while there has been research into automatic classification, general classification schemes are unsuitable f...