A well-structured framework for analysing petri net extensions

Finkel, Alain; McKenzie, Pierre; Picaronny, Claudine

doi:10.1016/j.ic.2004.01.005

Cited by 47 publications

(56 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, question (1) posed above is answered positively. The decidability of coverability for data nets subsumes the results in [6,10,14,11,12,13,15,16,17] that coverability is decidable for the respective classes of infinite-state systems mentioned above, and in most cases the proof in this paper is more succinct.…”

Section: Introductionsupporting

confidence: 72%

“…As was shown in [6], Petri nets and many of their known extensions are special cases of affine WSNs. In particular, Petri nets and their extensions by (generalised) resets and transfers are equivalent to the classes of affine WSNs P, T, F, G, H determined by the following restrictions:…”

Section: Markings Of An Affine Wsn P T F G H Are Vectors In Inmentioning

confidence: 97%

“…We show that affine WSNs [6] are equivalent to a class of data nets whose transitions have arity 1. Data nets also subsume timed Petri nets [10] and timed networks [14], in the sense that systems obtained after quotienting by time regions can be simulated by data nets, where the data domain is fractional parts of clock values.…”

Section: Introductionmentioning

confidence: 99%

“…Hence, two subclasses of affine WSNs are reset nets and transfer nets, in which whole-place operations are restricted to resets and to transfers, respectively. As shown in [6], coverability and termination for affine WSNs, and boundedness for transfer nets, are decidable. However, compared with Petri nets, there is a dramatic increase in complexity: it follows from the results on lossy channel systems in [7] that coverability and termination for reset nets and transfer nets, and boundedness for transfer nets, are not primitive recursive.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Nets with Tokens Which Carry Data

Lazić

Newcomb

Ouaknine

et al.

Petri Nets and Other Models of Concurrency – ICATPN 2007

116

View full text Add to dashboard Cite

Abstract. We study data nets, a generalisation of Petri nets in which tokens carry data from linearly-ordered infinite domains and in which whole-place operations such as resets and transfers are possible. Data nets subsume several known classes of infinite-state systems, including multiset rewriting systems and polymorphic systems with arrays.We show that coverability and termination are decidable for arbitrary data nets, and that boundedness is decidable for data nets in which whole-place operations are restricted to transfers. By providing an encoding of lossy channel systems into data nets without whole-place operations, we establish that coverability, termination and boundedness for the latter class have non-primitive recursive complexity. The main result of the paper is that, even for unordered data domains (i.e., with only the equality predicate), each of the three verification problems for data nets without whole-place operations has non-elementary complexity.

show abstract

Section: Introductionsupporting

confidence: 72%

Section: Markings Of An Affine Wsn P T F G H Are Vectors In Inmentioning

confidence: 97%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Nets with Tokens Which Carry Data

Lazić

Newcomb

Ouaknine

et al.

Petri Nets and Other Models of Concurrency – ICATPN 2007

116

View full text Add to dashboard Cite

show abstract

“…The theory of WSTS has been successfully applied for the verification of safety properties of numerous infinite-state models like Lossy Channel Systems, extensions of Petri Nets like reset/transfer and Affine Well Nets [9], or broadcast protocols. Most of the positive results are based on the decidability of the coverability problem (whether an upward closed set of states is reachable from the initial state) for WSTS, under natural effectiveness hypotheses.…”

Section: Introductionmentioning

confidence: 99%

Ordinal Theory for Expressiveness of Well Structured Transition Systems

Bonnet

Finkel

Haddad

et al. 2011

Foundations of Software Science and Computational Structures

Self Cite

View full text Add to dashboard Cite

Abstract. To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, for usual classes of wpos, the equivalence between the existence of order reflections (nonmonotonic order embeddings) and the simulations with respect to coverability languages. We show that the non-existence of order reflections can be proved by the computation of order types. This allows us to solve some open problems and to unify the existing proofs of the WSTS classification.

show abstract

Bounded Analysis and Decomposition for Behavioural Descriptions of Components

Poizat

Royer

Salaün

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Explicit behavioural interfaces are now accepted as a mandatory feature of components to address architectural analysis. Behavioural interface description languages should be able to deal with data types and with rich communication means. Symbolic Transition Systems (STS) support the definition of component models which take into account control, concurrency, communication and data types. However, verification of components described with protocol modelled by STS, especially model-checking, is difficult since they possibly involve different sources of infinity. In this paper, we propose the notions of bounded analysis and bounded decomposition. They can be used to test boundedness of systems and to generate finite simulations for them so that standard model-checking techniques may be applied for verification purposes.

show abstract

A well-structured framework for analysing petri net extensions

Cited by 47 publications

References 13 publications

Nets with Tokens Which Carry Data

Nets with Tokens Which Carry Data

Ordinal Theory for Expressiveness of Well Structured Transition Systems

Bounded Analysis and Decomposition for Behavioural Descriptions of Components

Contact Info

Product

Resources

About