Sciweavers

1157 search results - page 85 / 232
» Descriptive Complexity and Model Checking
Sort
View
WWW
2008
ACM
15 years 10 months ago
Structured objects in owl: representation and reasoning
Applications of semantic technologies often require the representation of and reasoning with structured objects--that is, objects composed of parts connected in complex ways. Alth...
Boris Motik, Bernardo Cuenca Grau, Ulrike Sattler
CONCUR
2007
Springer
15 years 1 months ago
Temporal Antecedent Failure: Refining Vacuity
We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in prac...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
CPE
1994
Springer
170views Hardware» more  CPE 1994»
15 years 1 months ago
Automatic Scalability Analysis of Parallel Programs Based on Modeling Techniques
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
ICSOC
2010
Springer
14 years 7 months ago
Automatic Fragment Identification in Workflows Based on Sharing Analysis
In Service-Oriented Computing (SOC), fragmentation and merging of workflows are motivated by a number of concerns, among which we can cite design issues, performance, and privacy. ...
Dragan Ivanovic, Manuel Carro, Manuel V. Hermenegi...
IPL
2007
125views more  IPL 2007»
14 years 9 months ago
State explosion in almost-sure probabilistic reachability
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
François Laroussinie, Jeremy Sproston