Sciweavers

93 search results - page 13 / 19
» Weak Alternating Timed Automata
Sort
View
ASE
2002
160views more  ASE 2002»
13 years 7 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
STACS
2007
Springer
14 years 1 months ago
Bounded-Variable Fragments of Hybrid Logics
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
Thomas Schwentick, Volker Weber
HYBRID
1995
Springer
13 years 11 months ago
Supervisory Control of Real-Time Systems Using Prioritized Synchronization
The theory of supervisory control of discrete event systems is extended to the real-time setting. The real-time behavior of a system is represented by the set of all possible time...
Ratnesh Kumar, Mark A. Shayman
FORTE
2009
13 years 5 months ago
Keep It Small, Keep It Real: Efficient Run-Time Verification of Web Service Compositions
Abstract. Service compositions leverage remote services to deliver addedvalue distributed applications. Since services are administered and run by independent parties, the governan...
Luciano Baresi, Domenico Bianculli, Sam Guinea, Pa...
HYBRID
2007
Springer
13 years 11 months ago
Safety Verification of an Aircraft Landing Protocol: A Refinement Approach
Abstract. In this paper, we propose a new approach for formal verification of hybrid systems. To do so, we present a new refinement proof technique, a weak refinement using step in...
Shinya Umeno, Nancy A. Lynch