Sciweavers

346 search results - page 47 / 70
» Determinizing Asynchronous Automata
Sort
View
ETFA
2008
IEEE
15 years 4 months ago
Reactivity analysis of different Networked Automation System architectures
The reactivity of Networked Automation Systems (NAS) has direct influence on safety and quality aspects. It can be determined by a response time analysis, which itself can be calc...
Jürgen Greifeneder, Georg Frey
IPPS
2007
IEEE
15 years 4 months ago
Implementing Hirschberg's PRAM-Algorithm for Connected Components on a Global Cellular Automaton
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
Johannes Jendrsczok, Rolf Hoffmann, Jörg Kell...
ICTCS
2005
Springer
15 years 3 months ago
Checking Risky Events Is Enough for Local Policies
Abstract. An extension of the λ-calculus is proposed to study historybased access control. It allows for parametrized security policies with a possibly nested, local scope. To gov...
Massimo Bartoletti, Pierpaolo Degano, Gian Luigi F...
FSTTCS
2004
Springer
15 years 3 months ago
Visibly Pushdown Games
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
Christof Löding, P. Madhusudan, Olivier Serre
HYBRID
2003
Springer
15 years 3 months ago
On Systematic Simulation of Open Continuous Systems
Abstract. In this paper we investigate a new technique to determine whether an open continuous system behaves correctly for all admissible input signals. This technique is based on...
James Kapinski, Bruce H. Krogh, Oded Maler, Olaf S...