Sciweavers

346 search results - page 18 / 70
» Determinizing Asynchronous Automata
Sort
View
VMCAI
2007
Springer
15 years 4 months ago
Lattice Automata
Abstract. Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a B...
Orna Kupferman, Yoad Lustig
VMCAI
2009
Springer
15 years 4 months ago
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
We study price-per-reward games on hybrid automata with strong resets. They generalise priced games previously studied and have applications in scheduling. We obtain decidability r...
Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski
HYBRID
2000
Springer
15 years 1 months ago
On the Existence of Solutions to Controlled Hybrid Automata
This paper studies the existence of solutions to a class of hybrid automata in which the underlying continuous dynamics are represented by inhomogeneous linear time-invariant syste...
Michael D. Lemmon
ACSD
2009
IEEE
149views Hardware» more  ACSD 2009»
15 years 4 months ago
From Concurrent Multi-clock Programs to Deterministic Asynchronous Implementations
We propose a general method to characterize and synthesize correctness-preserving, asynchronous wrappers for synchronous processes on a globally asynchronous locally synchronous (...
Dumitru Potop-Butucaru, Robert de Simone, Yves Sor...
AII
1989
15 years 2 months ago
Inductive Inference, DFAs, and Computational Complexity
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
Leonard Pitt