512 search results - page 41 / 103 » Automata as Abstractions |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
FORMATS
2004
Springer
14 years 11 days ago
2004
Springer
We discuss the modeling and verification of real-time systems using the SAL model checker. A new modeling framework based on event calendars enables dense timed systems to be descr...
FSTTCS
1998
Springer
14 years 8 days ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
nalysis of a TA modeled component. First, we abstract fine models to work with event streams at coarse granularity. We perform analysis of the component at multiple coarse granular...
CDC
2009
IEEE
13 years 6 months ago
2009
IEEE
Abstract-- The safety control problem for hybrid automata with imperfect mode information and continuous control is addressed. When the controller does not have access to the mode ...