4666 search results - page 14 / 934 » Equations on Timed Languages |
BMCBI
2007
13 years 10 months ago
2007
Background: The need to build a tool to facilitate the quick creation and editing of models encoded in the Systems Biology Markup language (SBML) has been growing with the number ...
PLDI
1993
ACM
14 years 2 months ago
1993
ACM
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...
QUESTA
2007
13 years 9 months ago
2007
We consider an extension of the standard G/G/1 queue, described by the equation W D = max{0, B − A + Y W}, where P[Y = 1] = p and P[Y = −1] = 1 − p. For p = 1 this model red...
ENTCS
2007
13 years 10 months ago
2007
This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is a...
DCC
2011
IEEE
13 years 5 months ago
2011
IEEE
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...