66 search results - page 1 / 14 » Reachability Analysis of Process Rewrite Systems |
FSTTCS
2003
Springer
13 years 10 months ago
2003
Springer
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
CONCUR
2004
Springer
13 years 8 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...
AMAST
2008
Springer
13 years 7 months ago
2008
Springer
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
AI
2008
Springer
13 years 5 months ago
2008
Springer
Verification of reachability properties for probabilistic systems is usually based on variants of Markov processes. Current methods assume an exact model of the dynamic behavior a...
CORR
2011
Springer
13 years 1 days ago
2011
Springer
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...