69 search results - page 6 / 14 » Hybrid Systems with Finite Bisimulations |
92
Voted
HYBRID
2009
Springer
15 years 6 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...
102
Voted
PARLE
1987
15 years 3 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
HYBRID
2007
Springer
15 years 3 months ago
2007
Springer
We study the possibility to steer the state of a single-input single-output linear switched system to the origin in finite time by output feedback with finite memory. We show that ...
FOSSACS
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Symbolic bisimulations were introduced as a mean to define value-passing process calculi using smaller, possibly finite labelled transition systems, equipped with symboli...
GECCO
2009
Springer
15 years 6 months ago
2009
Springer