The problem of extending model checking from finite state machines to procedural programs has fostered much research toward the definition temporal logics for reasoning on context-free structures. most notable such results are Nested Words, as CaRet and NWTL. Recently, Precedence Oriented Temporal Logic (POTL) been introduced specify prove properties coded trough an Operator Language (OPL). POT...

The evidence presented by Haas and Stack (1983) suggests that a parabolic relationship exists between a nation's level of industrialization and the strike activity among its labor force. Their model is tested using data from a different time period. Criticisms of the original model, including problems of heteroskedasticity, autocorrelation and multicollinearity, are addressed here. The findings...

The US National Science Foundation funded this research in part. Portions of this study were undertaken when Hagedoorn was a visiting scholar at the Center for Economic Policy Research at Stanford University and the Haas School of Business of the University of California at Berkeley. The authors thank participants at seminars at Maastricht University, Utrecht University, University of Californi...

This paper deals with a complete and correct method to compute how many plans exist for an assembly or processing task. Planning is a NP-hard problem and then, in some situations, the application of time consuming search methods must be avoided. However, up to now the computation of the exact number of alternative plans for any situation was not reported elsewhere. Notice that the complexity of...