Sciweavers

11740 search results - page 34 / 2348
» More Problems in Rewriting
Sort
View
VLDB
1989
ACM
77views Database» more  VLDB 1989»
14 years 23 days ago
ENIAM: A More Complete Conceptual Schema Language
The problem of knowledge representation has been extensively addressedin the information systemsfield and there has been a wide range of suggestionsfor capturing semantics.A numbe...
Peter N. Creasy
WSC
2008
13 years 11 months ago
Smooth flexible models of nonhomogeneous poisson processes using one or more process realizations
We develop and evaluate a semiparametric method to estimate the mean-value function of a nonhomogeneous Poisson process (NHPP) using one or more process realizations observed over...
Michael E. Kuhl, Shalaka C. Deo, James R. Wilson
CONCUR
2004
Springer
14 years 14 days ago
Extended Process Rewrite Systems: Expressiveness and Reachability
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
Mojmír Kretínský, Vojtech Reh...
FMOODS
2007
13 years 10 months ago
On Formal Analysis of OO Languages Using Rewriting Logic: Designing for Performance
Rewriting logic provides a powerful, flexible mechanism for language definition and analysis. This flexibility in design can lead to problems during analysis, as different desi...
Mark Hills, Grigore Rosu
ENTCS
2002
108views more  ENTCS 2002»
13 years 8 months ago
Rewriting in the partial algebra of typed terms modulo AC
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
Thomas Colcombet