Uniform Analysis for Communicating Timed Systems (Extended Technical Report)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
In this paper we show a progressive way for managing abstract algebraic specifications in order to obtain efficient parallel or distributed algorithms. Our approach is based on TSPP technique (Transformations de Sp cifications de probl mes orient es vers l ...
We present timed automata and timed Petri nets and argue that timed automata and their associated parallel composition operator are not well adapted for the compositional description of timed Petri nets. Timed automata with deadlines are presented. We pres ...
This paper presents algorithms for computing the Gröbner fan of an arbitrary polynomial ideal. The computation involves enumeration of all reduced Gröbner bases of the ideal. Our algorithms are based on a uniform definition of the Gröbner fan that applies ...
In large area reactors, a local asymmetry of the electrode area, due to lateral grounded walls, causes a perturbation in rf plasma potential, due to the redistribution of lateral rf current, which propagates along the resistive plasma between capacitive sh ...
The authors propose a numerical method for the uniformization of Riemann surfaces and algebraic curves in genus two with highly accurate results. Let G be a Fuchsian group acting on the unit disk BbbD, and let S=BbbD/G. It is well known that $S ...
The purpose of this paper is to develop methods that can reconstruct a bandlimited discrete-time signal from an irreg- ular set of samples at unknown locations. We define a solution to the problem using first a geometric and then an algebraic point of view ...
In this thesis we will show that unsteady, incompressible fluid-flow problems, as described by the three-dimensional Navier-Stokes equations, can efficiently be simulated by a parallel computer code based on a spectral element discretization. This efficien ...
We present a constructive approach to the realization of a parallel system for the vision processing. This approach follows the classical software engineering principles: analysis, specification, design and implementation. The language CO-OPN (Concurrent O ...
Most of music related tasks need a joint time-because a music signal varies with time. The existing time-frequency analysis approaches show some serious limitations for application in music signal processing. This paper presents an original frequency-depen ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007
This paper presents a proposal of a language, based on synchronous active objects that introduces the CSP primitives into Java. The proposal does not use channels to realise the inter-process communications, but is shown to offer the same expressive power ...
