56 search results - page 6 / 12 » On Decidability of LTL Model Checking for Process Rewrite Sy... |
129
Voted
ICALP
1998
Springer
15 years 8 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
135
Voted
AOSD
2009
ACM
15 years 6 months ago
2009
ACM
Cyber-physical systems increasingly rely on dynamically adaptive programs to respond to changes in their physical environment; examples include ecosystem monitoring and disaster r...
147
Voted
IANDC
2011
14 years 10 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
104
Voted
FUIN
2006
15 years 3 months ago
2006
In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain ...
100
Voted
FMSD
2006
15 years 3 months ago
2006
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...