Sciweavers

697 search results - page 22 / 140
» Implementation of Timed Automata: An Issue of Semantics or M...
Sort
View
CORR
1998
Springer
127views Education» more  CORR 1998»
13 years 7 months ago
Towards an implementable dependency grammar
Syntactic models should be descriptively adequate and parsable. A syntactic description is autonomous in the sense that it has certain explicitformal properties. Such a descriptio...
Timo Järvinen, Pasi Tapanainen
HYBRID
2000
Springer
13 years 11 months ago
Computing Optimal Operation Schemes for Chemical Plants in Multi-batch Mode
We propose a computer-aided methodology to automatically generate time optimal production schemes for chemical batch plants operating in multi-batch mode. Our approach is based on ...
Peter Niebert, Sergio Yovine
TOSEM
2010
168views more  TOSEM 2010»
13 years 2 months ago
Analysis and applications of timed service protocols
Web services are increasingly gaining acceptance as a framework for facilitating application-to-application interactions within and across enterprises. It is commonly accepted tha...
Julien Ponge, Boualem Benatallah, Fabio Casati, Fa...
RTSS
2005
IEEE
14 years 1 months ago
Event Count Automata: A State-Based Model for Stream Processing Systems
Recently there has been a growing interest in models and methods targeted towards the (co)design of stream processing applications; e.g. those for audio/video processing. Streams ...
Samarjit Chakraborty, Linh T. X. Phan, P. S. Thiag...
FM
2009
Springer
146views Formal Methods» more  FM 2009»
13 years 5 months ago
Verifying Real-Time Systems against Scenario-Based Requirements
Abstract. We propose an approach to automatic verification of realtime systems against scenario-based requirements. A real-time system is modeled as a network of Timed Automata (TA...
Kim Guldstrand Larsen, Shuhao Li, Brian Nielsen, S...