56 search results - page 1 / 12 » On Decidability of LTL Model Checking for Process Rewrite Sy... |
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
HYBRID
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
FOSSACS
2010
Springer
13 years 11 months ago
2010
Springer
CADE
2004
Springer
14 years 5 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...