10271 search results - page 542 / 2055 » Computer Science |
170
click to vote
TCS
1998
15 years 6 months ago
1998
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...
221
click to vote
TCS
1998
15 years 6 months ago
1998
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
174
click to vote
TCS
1998
15 years 6 months ago
1998
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...
168
click to vote
TCS
1998
15 years 6 months ago
1998
Parsing schemata provide a high-level formal description of parsers. These can be used, among as an intermediate level of abstraction for deriving the formal correctness of a pars...
168
click to vote
GI
2010
Springer
15 years 5 months ago
2010
Springer
: This paper presents a framework for Service Level Management in dynamic, heterogeneous environments for service composition. Assumptions to and the architecture of a framework is...