48 search results - page 6 / 10 » On the Complexity of Intersecting Finite State Automata |
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper, we analyze the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on ...
ENTCS
2006
13 years 7 months ago
2006
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
ICDAR
1995
IEEE
13 years 11 months ago
1995
IEEE
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the dat...
PTS
2007
13 years 9 months ago
2007
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...