Expressiveness of Dynamic Networks of Timed Petri Nets

Martos-Salgado, María; Rosa-Velardo, Fernando

doi:10.1007/978-3-319-04921-2_42

Search citation statements

Order By: Relevance

Paper Sections

Select...

Expressiveness2

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

2016

Publication Types

Select...

Article2

Book1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finer grained comparisons between AWN, νNets and (fragments of) Data nets are presented in [29]. More general models of Petri nets with data are presented in [89].…”

Section: Expressivenessmentioning

confidence: 99%

Parameterized verification

Abdulla

Delzanno

2016

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

The goal of parameterized verification is to prove the correctness of a system specification regardless of the number of its components. The problem is of interest in several different areas: verification of hardware design, multithreaded programs, distributed systems, and communication protocols. The problem is undecidable in general. Solutions for restricted classes of systems and properties have been studied in areas like theorem proving, model checking, automata and logic, process algebra, and constraint solving. In this introduction to the special issue, dedicated to a selection of works from the Parameterized Verification workshop PV ’14 and PV ’15, we survey some of the works developed in this research area

show abstract

“…Finer grained comparisons between AWN, νNets and (fragments of) Data nets are presented in [29]. More general models of Petri nets with data are presented in [89].…”

Section: Expressivenessmentioning

confidence: 99%

Parameterized verification

Abdulla

Delzanno

2016

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

show abstract

“…We remark that AW N are a generalization of Broadcast Protocols, BP for short, but from the analysis in [64], we also have that LpP N q LpBP q Finer grained comparisons between AWN, νNets and (fragments of) Data nets are presented in [29]. More general models of Petri nets with data are presented in [89].…”

Section: Expressivenessmentioning

confidence: 99%