Weakly Extended Process Rewrite Systems
Authors | |
---|---|
Year of publication | 2006 |
Type | Appeared in Conference without Proceedings |
MU Faculty or unit | |
Citation | |
Description | We unify a view on state extensions of Process Rewrite Systems (PRS) and compare their expressive power. In addition, we study decidability and complexity of problems related to model checking and other formal verification procedures such as weak and strong bisimulation, the reachability problem, etc. |
Related projects: |