CONCUR
2011
Springer
13 years 16 days ago
2011
Springer
Probabilistic nondeterministic processes are commonly modeled as probabilistic LTSs (PLTSs, a.k.a. probabilistic automata). A number of logical characterizations of the main behavi...
LPAR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
APAL
2008
14 years 26 days ago
2008
Bisimulations, behavioral equivalence and logical equivalence are investigated for stochastic T-coalgebras that interpret coalgebraic logic which is defined in terms of predicate ...
PODS
2008
ACM
15 years 26 days ago
2008
ACM
A schema mapping is a high-level specification that describes the relationship between two database schemas. As schema mappings constitute the essential building blocks of data ex...