Sciweavers

512 search results - page 54 / 103
» Automata as Abstractions
Sort
View
FOAL
2007
ACM
14 years 17 days ago
Requirement enforcement by transformation automata
The goal of this work is to treat safety and security policies as requirements to be composed in an aspectual style with a developing application. Policies can be expressed either...
Douglas R. Smith
POPL
2010
ACM
13 years 11 months ago
Reconfigurable asynchronous logic automata: (RALA)
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
Neil Gershenfeld, David Dalrymple, Kailiang Chen, ...
FAC
2008
100views more  FAC 2008»
13 years 8 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
WMP
2000
14 years 7 days ago
Parikh Mapping and Iteration
orms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages . . . . 135 Manfred Kudlek, Victor Mitrana On Multisets in Database Systems . . ....
Jürgen Dassow
CDC
2008
IEEE
156views Control Systems» more  CDC 2008»
14 years 3 months ago
Diagnosability of hybrid automata with measurement uncertainty
— We propose a diagnosability notion that depends on two parameters denoted as (δd, δm) for the general class of transition systems where the observable output is given by disc...
Maria Domenica Di Benedetto, Stefano Di Gennaro, A...