## 186 Citations

### Model checking for process rewrite systems and a class of action-based regular properties

- Computer ScienceTheor. Comput. Sci.
- 2006

### On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit

- Computer ScienceINFINITY
- 2003

### A Refining the Process Rewrite Systems Hierarchy via Ground Tree

- Computer Science
- 2014

GTRS and models in the PRS hierarchy in terms of their expressive power with respect to strong, weak, and branching bisimulation is pinpointed to give new insights into the decidability results for subclasses of PRS.

### Modal Process Rewrite Systems

- Computer Science, MathematicsICTAC
- 2012

Modal transition systems with infinite state space generated by finite sets of rules are considered and decidability for pushdown automata extending the non-modal case and surprising undecideability for basic parallel processes are shown.

### Extended Process Rewrite Systems: Expressiveness and Reachability

- Computer ScienceCONCUR
- 2004

It is shown that the class of Petri nets is less expressive up to bisimulation equivalence than theclass of PA processes extended with a finite state control unit.

### Process Rewrite Systems with Weak Finite-State Unit by Mojmír Křetínský Vojtěch

- Computer Science
- 2003

It is shown how the hierarchy of new classes (w.r.t. bisimilarity) is related to both PRS hierarchy of Mayr and two other hierarchies of PRS extensions introduced in [9, 21].

### On decidability of LTL model checking for process rewrite systems

- MathematicsActa Informatica
- 2008

It is shown that the problem is decidable for wPRS if the problem remains undecidable for PA processes even with respect to the LTL fragment with the only modality until or the fragment with modalities next and infinitely often.

### Reachability is decidable for weakly extended process rewrite systems

- Mathematics, Computer ScienceInf. Comput.
- 2009

### Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems

- Computer ScienceTOCL
- 2014

GTRS and models in the PRS hierarchy in terms of their expressive power with respect to strong, weak, and branching bisimulation is pinpointed to give new insights into the decidability results for subclasses of PRS.

## References

SHOWING 1-10 OF 31 REFERENCES

### Constrained Properties, Semilinear Systems, and Petri Nets

- Computer Science, MathematicsCONCUR
- 1996

It is shown that the verification problem of semilinear systems (PA processes in particular) is undecidable even w.r.t. LTL formulas, and another fragment is identified called CLTL◊, a restriction of LTL extended with counting constraints covering a significant class of properties and for which the verification Problem is decidable for all PA processes.

### Reachability Analysis of Pushdown Automata: Application to Model-Checking

- Computer ScienceCONCUR
- 1997

This work considers the more general class of alternating pushdown systems and uses alternating finite-state automata as a representation structure for sets of their configurations and gives a simple and natural procedure to compute sets of predecessors using this representation structure.

### Combining Petri Nets and PA-Processes

- Computer ScienceTACS
- 1997

A new model PAN (= PA + PN) is defined that subsumes both Petri nets and PA-processes and is thus strictly more expressive than Petrinets, and it is shown that the reachability problem is still decidable for PAN.

### On the Regular Structure of Prefix Rewriting

- Mathematics, Computer ScienceTheor. Comput. Sci.
- 1992

### Model Checking PA-Processes

- Computer Science, MathematicsCONCUR
- 1997

It is shown that the model checking problem for the branching time temporal logic EF is decidable for PA-processes.

### Checking System Properties via Integer Programming

- Computer ScienceESOP
- 1996

This paper complements the marking equation by a so called trap equation, and shows that both together significantly extend the range of verifiable systems by conducting several case studies.

### On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes

- Computer ScienceCAV
- 1995

It is shown that the model checking problem for branching time logics and Basic Parallel Processes is undecidable for the logic ∀L(O, F, U) (equivalent to CTL*) in the usual interleaving semantics, but decidable in a standard partial order interpretation.

### More Innnite Results

- Mathematics
- 1996

Recently there has been a spurt of activity in concurrency theory centered on the analysis of innnite-state systems. The following two problems have been intensely investigated: (1) given two…