On the reachability problem for some classes of Petri nets

Verification of bounded Petri nets using integer programming

Khomenko, V.
Koutny, M.
Newcastle upon Tyne Univ. (United Kingdom). Computing Science

January 2001

SIGLEAvailable from British Library Document Supply Centre-DSC:8724.920(no CS-TR-711) / BLDSC - Brit...

Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem

MA, Ziyue
TONG, Yin
Li, Zhiwu
Giua, Alessandro

March 2017

Paru on-line 27/05/2016. DOI: 10.1109/TAC.2016.2574120 SMASHParu on-line 27/05/2016. DOI: 10.1109/TA...

Some decision problems related to the reachability problem for Petri nets

Araki, Toshiro
Kasami, Tadao

October 1976

AbstractIn this paper, we show that (1) the question to decide whether a given Petri net is consiste...

Reachability analysis of systems based on Petri nets

Hudak, Stefan

January 1999

Available from Slovak Centre of Scientific and Technical Information, under shelf-number: A569371 / ...

Petri Net Reachability Problem (Invited Talk)

January 2019

Petri nets, also known as vector addition systems, are a long established model of concurrency with ...

Acknowledgement

Kamal Lodaya
Praveen M

January 2008

Certified that the work contained in this thesis entitled “Complexity of the reachability problem in...

Analyzing Reachability for Some Petri Nets With Fast Growing Markings

Praveen, M.
Lodaya, Kamal

December 2008

AbstractUsing linear algebraic techniques, we analyse the computational complexity of testing reacha...

The reachability problem for Petri nets and decision problems for Skolem arithmetic

BORGER E

January 1980

rEVIEWS IN MR 82b: 03079, ZBL 453 #03013; MR 81h: 68034, ZBL 453 #03012.Previously published in Pr...

Bouziane’s transformation of the Petri net reachability problem and incorrectness of the related algorithm

Jančar, Petr

November 2008

AbstractThe proceedings of FOCS’98 contain a paper by Zakariae Bouziane, who sketches a new represen...

Semilinearity of the reachability set is decidable for petri nets

Hauschildt, D.
Hamburg Univ. (Germany). Fachbereich 18 - Informatik

January 1990

SIGLETIB: RN 3437(146) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...

A primitive recursive algorithm for the general Petri net reachability problem

Bouziane, Zakariae
Centre National de la Recherche Scientifique (CNRS), 35 - Rennes (France). Inst. de Recherche en Informatique et Systemes Aleatoires (IRISA)
Rennes-1 Univ., 35 (France). Inst. de Recherche en Informatique et Systemes Aleatoires (IRISA)
Institut National des Sciences Appliquees de Rennes (INSA), 35 (France). Inst. de Recherche en Informatique et Systemes Aleatoires (IRISA)
Institut National de Recherche en Informatique et en Automatique (INRIA), 35 - Rennes (France). Inst. de Recherche en Informatique et Systemes Aleatoires (IRISA)

January 1998

Theme 1 - Reseaux et systemes - Projet PAMPASIGLEAvailable from INIST (FR), Document Supply Service,...

Reachability Analysis of P-time Petri Nets with Parametric Marking

Boucheneb, Hanifa
Barkaoui, Kamel

June 2012

H. Boucheneb, K. Barkaoui ?Reachability Analysis of P-time Petri Nets with Parametric Marking?, 12th...

ON THE TRACTABILITY OF THE UN/REACHABILITY PROBLEM

Latif Salum

August 2016

Abstract. The Petri Net (PN) reachability problem is an effective formulation to attack the P vs. NP...

Extensions to coloured Petri nets and their application to protocols

Billington, J

January 1990

SIGLEAvailable from British Library Document Supply Centre- DSC:D61323 / BLDSC - British Library Doc...

An efficient algorithm for unfolding petri nets

Koutny, M.
Khomenko, V.
Newcastle upon Tyne Univ. (United Kingdom). Computing Science

January 2001

Also available via the InternetAvailable from British Library Document Supply Centre-DSC:8724.920(no...

Verification of bounded Petri nets using integer programming

Khomenko, V.
Koutny, M.
Newcastle upon Tyne Univ. (United Kingdom). Computing Science

January 2001

SIGLEAvailable from British Library Document Supply Centre-DSC:8724.920(no CS-TR-711) / BLDSC - Brit...

Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem

MA, Ziyue
TONG, Yin
Li, Zhiwu
Giua, Alessandro

March 2017

Paru on-line 27/05/2016. DOI: 10.1109/TAC.2016.2574120 SMASHParu on-line 27/05/2016. DOI: 10.1109/TA...

Some decision problems related to the reachability problem for Petri nets

Araki, Toshiro
Kasami, Tadao

October 1976

AbstractIn this paper, we show that (1) the question to decide whether a given Petri net is consiste...

Reachability analysis of systems based on Petri nets

Hudak, Stefan

January 1999

Available from Slovak Centre of Scientific and Technical Information, under shelf-number: A569371 / ...

Petri Net Reachability Problem (Invited Talk)

January 2019

Petri nets, also known as vector addition systems, are a long established model of concurrency with ...

Acknowledgement

Kamal Lodaya
Praveen M

January 2008

Certified that the work contained in this thesis entitled “Complexity of the reachability problem in...

Analyzing Reachability for Some Petri Nets With Fast Growing Markings

Praveen, M.
Lodaya, Kamal

December 2008

AbstractUsing linear algebraic techniques, we analyse the computational complexity of testing reacha...

The reachability problem for Petri nets and decision problems for Skolem arithmetic

BORGER E

January 1980

rEVIEWS IN MR 82b: 03079, ZBL 453 #03013; MR 81h: 68034, ZBL 453 #03012.Previously published in Pr...

Bouziane’s transformation of the Petri net reachability problem and incorrectness of the related algorithm

Jančar, Petr

November 2008

AbstractThe proceedings of FOCS’98 contain a paper by Zakariae Bouziane, who sketches a new represen...

Semilinearity of the reachability set is decidable for petri nets

Hauschildt, D.
Hamburg Univ. (Germany). Fachbereich 18 - Informatik

January 1990

SIGLETIB: RN 3437(146) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...

A primitive recursive algorithm for the general Petri net reachability problem

Bouziane, Zakariae
Centre National de la Recherche Scientifique (CNRS), 35 - Rennes (France). Inst. de Recherche en Informatique et Systemes Aleatoires (IRISA)
Rennes-1 Univ., 35 (France). Inst. de Recherche en Informatique et Systemes Aleatoires (IRISA)
Institut National des Sciences Appliquees de Rennes (INSA), 35 (France). Inst. de Recherche en Informatique et Systemes Aleatoires (IRISA)
Institut National de Recherche en Informatique et en Automatique (INRIA), 35 - Rennes (France). Inst. de Recherche en Informatique et Systemes Aleatoires (IRISA)

January 1998

Theme 1 - Reseaux et systemes - Projet PAMPASIGLEAvailable from INIST (FR), Document Supply Service,...

Reachability Analysis of P-time Petri Nets with Parametric Marking

Boucheneb, Hanifa
Barkaoui, Kamel

June 2012

H. Boucheneb, K. Barkaoui ?Reachability Analysis of P-time Petri Nets with Parametric Marking?, 12th...

ON THE TRACTABILITY OF THE UN/REACHABILITY PROBLEM

Latif Salum

August 2016

Abstract. The Petri Net (PN) reachability problem is an effective formulation to attack the P vs. NP...

Extensions to coloured Petri nets and their application to protocols

Billington, J

January 1990

SIGLEAvailable from British Library Document Supply Centre- DSC:D61323 / BLDSC - British Library Doc...

An efficient algorithm for unfolding petri nets

Koutny, M.
Khomenko, V.
Newcastle upon Tyne Univ. (United Kingdom). Computing Science

January 2001

Also available via the InternetAvailable from British Library Document Supply Centre-DSC:8724.920(no...

Verification of bounded Petri nets using integer programming

Khomenko, V.
Koutny, M.
Newcastle upon Tyne Univ. (United Kingdom). Computing Science

January 2001

SIGLEAvailable from British Library Document Supply Centre-DSC:8724.920(no CS-TR-711) / BLDSC - Brit...

Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem

MA, Ziyue
TONG, Yin
Li, Zhiwu
Giua, Alessandro

March 2017

Paru on-line 27/05/2016. DOI: 10.1109/TAC.2016.2574120 SMASHParu on-line 27/05/2016. DOI: 10.1109/TA...

Some decision problems related to the reachability problem for Petri nets

Araki, Toshiro
Kasami, Tadao

October 1976

AbstractIn this paper, we show that (1) the question to decide whether a given Petri net is consiste...

On the reachability problem for some classes of Petri nets

Abstract

Extracted data

On the reachability problem for some classes of Petri nets

Abstract

Extracted data

Related items

Related items