Sciweavers

268 search results - page 19 / 54
» Expressive Power of Grammatical Formalisms
Sort
View
ENTCS
2008
137views more  ENTCS 2008»
13 years 8 months ago
Computerizing Mathematical Text with MathLang
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
Fairouz Kamareddine, J. B. Wells
BIRTHDAY
2010
Springer
13 years 5 months ago
QPME 2.0 - A Tool for Stochastic Modeling and Analysis Using Queueing Petri Nets
Abstract Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the model...
Samuel Kounev, Simon Spinner, Philipp Meier
LFCS
2007
Springer
14 years 2 months ago
A Decidable Temporal Logic of Repeating Values
Various logical formalisms with the freeze quantifier have been recently considered to model computer systems even though this is a powerful mechanism that often leads to undecida...
Stéphane Demri, Deepak D'Souza, Régi...
EUMAS
2006
13 years 10 months ago
Norm-Oriented Programming of Electronic Institutions: A Rule-based Approach
Norms constitute a powerful coordination mechanism among heterogeneous agents. We propose means to specify and explicitly manage the normative positions of agents (permissions, pro...
Andrés García-Camino, Juan A. Rodr&i...
SAS
2000
Springer
14 years 2 days ago
Tree Schemata and Fair Termination
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
Laurent Mauborgne