Sciweavers

4666 search results - page 211 / 934
» Equations on Timed Languages
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 6 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
157
Voted
WEBDB
2005
Springer
132views Database» more  WEBDB 2005»
16 years 2 days ago
On the role of composition in XQuery
Nonrecursive XQuery is known to be hard for nondeterministic exponential time. Thus it is commonly believed that any algorithm for evaluating XQuery has to require exponential amo...
Christoph Koch
ENTCS
2008
142views more  ENTCS 2008»
15 years 6 months ago
Worst Case Reaction Time Analysis of Concurrent Reactive Programs
Reactive programs have to react continuously to their inputs. Here the time needed to react with the according output is important. While the synchrony hypothesis takes the view t...
Marian Boldt, Claus Traulsen, Reinhard von Hanxled...
WWW
2002
ACM
16 years 7 months ago
Multimedia meets computer graphics in SMIL2.0: a time model for the web
Multimedia scheduling models provide a rich variety of tools for managing the synchronization of media like video and audio, but generally have an inflexible model for time itself...
Patrick Schmitz
IS
2011
15 years 1 months ago
Time prediction based on process mining
Abstract. Process mining allows for the automated discovery of process models from event logs. These models provide insights and enable various types of model-based analysis. This ...
Wil M. P. van der Aalst, M. H. Schonenberg, Minseo...