Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties

@inproceedings{Bozzelli2005ModelCF,
  title={Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties},
  author={Laura Bozzelli},
  booktitle={VMCAI},
  year={2005}
}
  • L. Bozzelli
  • Published in VMCAI 3 May 2004
  • Computer Science
We consider the model checking problem for Process Rewrite Systems (PRSs), an infinite-state formalism (non Turing-powerful) which subsumes many common models such as Pushdown Processes and Petri Nets. PRSs can be adopted as formal models for programs with dynamic creation and synchronization of concurrent processes, and with recursive procedures. The model-checking problem for PRSs w.r.t. action-based linear temporal logic (ALTL) is undecidable. However, decidability for some interesting… 
On Decidability of LTL Model Checking for Process Rewrite Systems
TLDR
It is shown that the problem is decidable for wPRS if the authors consider properties defined by formulae with only modalities strict eventually and strict always and 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.
On decidability of LTL model checking for process rewrite systems
TLDR
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.
On Decidability of LTL+Past Model Checking for Process Rewrite Systems
Model-Checking Large Finite-State Systems and Beyond
With the increase in the complexity of computer systems, it becomes even more important to develop formal methods for ensuring their quality. Early detection of errors requires application of
HADES: Microprocessor Hazard Analysis via Formal Verification of Parameterized Systems
TLDR
HADES is a fully automated verification tool for pipeline-based microprocessors that aims at flaws caused by improperly handled data hazards, and combines several techniques, including data-flow analysis, error pattern matching, SMT solving, and abstract regular model checking.

References

SHOWING 1-10 OF 14 REFERENCES
Reachability Analysis of Process Rewrite Systems
TLDR
This work develops automata techniques allowing to build finite representations of the forward/backward sets of reachable configurations of PRSs modulo various term structural equivalences (corresponding to properties of the operators of sequential composition and parallel composition).
Process Rewrite Systems
  • R. Mayr
  • Computer Science
    Inf. Comput.
  • 2000
TLDR
The most general and most expressive class of systems in this hierarchy is called process rewrite systems (PRS), which subsume Petri nets, PA-processes, and pushdown processes and are strictly more expressive than any of these.
Reachability Analysis of Pushdown Automata: Application to Model-Checking
TLDR
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.
Pushdown Processes: Parallel Composition and Model Checking
TLDR
As arbitrary parallel composition between context-free processes provides Turing power, and therefore destroys every hope for automatic verification, pushdown processes can be considered as the appropriate generalization of context- free processes for frameworks for automatic verify.
Model Checking of macro Processes
  • H. Hungar
  • Computer Science, Mathematics
    CAV
  • 1994
Decidability of modal logics is not limited to finite systems. The alternation-free modal mu-calculus has already been shown to be decidable for context-free processes, with a worst case complexity
Verification on Infinite Structures
Constrained Properties, Semilinear Systems, and Petri Nets
TLDR
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.
On the Decidability of Model Checking for Several µ-calculi and Petri Nets
TLDR
The decidability of the model checking problem for several μ-calculi and Petri nets is analysed and it is found that a very simple subset of the modal μ-Calculus is undecidable.
Pushdown Processes: Games and Model Checking
TLDR
It is shown that the model checking problem for the pushdown automata and the propositional mu-calculus is DEXPTIME-complete and there is a winning strategy that is realized by a pushdown process.
On the Complexity of the Linear-Time mu -calculus for Petri-Nets
TLDR
It is shown that the complexity in the size of the formula can be reduced to polynomial space, and it is proved that this is the best one can do.
...
1
2
...