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

Křetínský, Mojmír; Řehák, Vojtěch; Strejček, Jan

doi:10.1016/j.entcs.2003.10.008

Cited by 11 publications

(15 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…m m m m m P P P P P P P P P P P P P P P P P P P wPA seBPP=MSA wBPA wBPP fcBPA fcBPP The strictness (' ') of the PRS-hierarchy has been proved by Mayr [May00], that of the corresponding classes of PRS and fcPRS has been proved in [Str02], and the relations among MSA and the classes of fcPRS and wPRS have been studied in [KŘS03]. Note that the strictness relations wX seX hold for all X = PA, PAD, PAN, PRS due to our reachability result for wPRS given in Sec.…”

Section: Expressivenessmentioning

confidence: 99%

“…In this section we recall the definitions of three different extensions of process rewrite systems, namely state-extended PRS (sePRS) [JKM01], PRS with a finite constraint system (fcPRS) [Str02], and PRS with a weak finite-state unit (wPRS) [KŘS03]. In all cases, the PRS formalism is extended with a finite state unit of some kind.…”

Section: Extended Prsmentioning

confidence: 99%

“…This paper presents a hierarchy of PRS classes and their respective extensions of three types: fcPRS classes ( [Str02], inspired by concurrent constraint programming [SR90]), wPRS classes ( [KŘS03], PRS systems equipped with weak FSU inspired by weak automata [MSS92]), and state-extended PRS classes [JKM01]. The classes in the hierarchy (depicted in Figure 1) are related by their expressive power with respect to (strong) bisimulation equivalence.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Extended Process Rewrite Systems: Expressiveness and Reachability

Křetínský

Řehák

Strejček

2004

CONCUR 2004 - Concurrency Theory

Self Cite

View full text Add to dashboard Cite

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 expressive up to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Further we show our main result that the reachability problem for PRS extended with a so called weak finite state unit is decidable.

show abstract

Section: Expressivenessmentioning

confidence: 99%

Section: Extended Prsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Extended Process Rewrite Systems: Expressiveness and Reachability

Křetínský

Řehák

Strejček

2004

CONCUR 2004 - Concurrency Theory

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [KŘS04b], we have presented weakly extended PRS (wPRS), where a finite-state control unit with self-loops as the only loops is added to the standard PRS formalism (addition of a general finite-state control unit makes PRS Turing powerful). This control unit enriches PRS by abilities to model a bounded number of arbitrary communication events and global variables whose values are changed only a bounded number of times during any computation.…”

Section: Introductionmentioning

confidence: 99%

On Decidability of LTL Model Checking for Process Rewrite Systems

Bozzelli

Křetínský

Řehák

et al. 2006

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. 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 (wPRS), and properties described by basic fragments of action-based Linear Temporal Logic (LTL). It is known that the problem for general LTL properties is decidable for Petri nets and for pushdown processes, while it is undecidable for PA processes. As our main result, we show that the problem is decidable for wPRS if we consider properties defined by formulae with only modalities strict eventually and strict always. Moreover, we show that 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.

show abstract

“…We have proposed two PRS extensions, namely fcPRS ( [19], inspired by concurrent constraint programming [17]) and wPRS ( [9] for PRS equipped with weak FSU inspired by weak automata [16]). It is shown that they increase the expressive power of those PRS subclasses which do not subsume the notion of finite control.…”

Section: Introductionmentioning

confidence: 99%

On the Expressive Power of Extended Process Rewrite Systems

Křetínský¹,

Řehák²,

Strejček³

2004

BRICS

View full text Add to dashboard Cite

We provide a unified view on three extensions of Process rewrite systems (PRS) and compare their and PRS's expressive power. We show that the class of Petri Nets is less expressible up to bisimulation than the class of Process Algebra extended with finite state control unit. Further we show our main result that the reachability problem for PRS extended with a so called weak finite state unit is decidable.

show abstract

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

Cited by 11 publications

References 17 publications

Extended Process Rewrite Systems: Expressiveness and Reachability

Extended Process Rewrite Systems: Expressiveness and Reachability

On Decidability of LTL Model Checking for Process Rewrite Systems

On the Expressive Power of Extended Process Rewrite Systems

Contact Info

Product

Resources

About