7778 search results - page 14 / 1556 » Designing Controllers for Reachability |
HYBRID
2009
Springer
14 years 2 months ago
2009
Springer
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
SIGMOD
2010
ACM
13 years 7 months ago
2010
ACM
We develop a compact and efficient reachability labeling scheme for answering provenance queries on workflow runs that conform to a given specification. Even though a workflow run...
RP
2010
Springer
13 years 5 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
CONCUR
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
ATVA
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...