1650 search results - page 119 / 330 » The HOM problem is decidable |
128
click to vote
CONCUR
2004
Springer
15 years 7 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...
152
Voted
FORMATS
2006
Springer
15 years 7 months ago
2006
Springer
Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as...
115
click to vote
SAC
1995
ACM
15 years 7 months ago
1995
ACM
A trigger system in High Energy Physics Experiments (HEPE) has to decide, in few µs, if the data related to a nuclear event have to be stored or not. Normally, these data, are co...
136
click to vote
CAV
2008
Springer
15 years 6 months ago
2008
Springer
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...
137
click to vote
CSR
2008
Springer
15 years 5 months ago
2008
Springer
We prove that every rational language of words indexed by linear orderings is definable in monadic second-order logic. We also show that the converse is true for the class of langu...