3169 search results - page 124 / 634 » Robust Timed Automata |
FOSSACS
2006
Springer
14 years 1 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
TAPSOFT
1991
Springer
14 years 1 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
SERVICES
2008
13 years 11 months ago
2008
an abstract form of service composition where Web services are represented as nondeterministic communicating automata. Considering the case in which communication is done via chan...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Cellular automata have been mainly studied for on very regular graphs carrying the cells (like lines or grids) and under synchronous dynamics (all cells update simultaneo...
IJFCS
2008
13 years 10 months ago
2008
We consider the problem of synchronizing the activity of all the membranes of a P system. After pointing at the connection with a similar problem dealt with in the field of cellul...