Amanote Research

Amanote Research

    RegisterSign In

The Reachability Problem for Petri Nets Is Not Elementary

doi 10.1145/3313276.3316369
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2019

Authors
Wojciech CzerwińskiSławomir LasotaRanko LazićJérôme LerouxFilip Mazowiecki
Publisher

ACM Press


Related search

Compositional Reachability in Petri Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems

1974English

A Class of Petri Nets That a Necessary and Sufficient Condition for Reachability Is Obtainable

Transactions of the Society of Instrument and Control Engineers
1988English

On State-Space Compression and State Reachability Retrieval of Petri Nets

Advances in Mechanical Engineering
Mechanical Engineering
2019English

The Symmetry Method for Coloured Petri Nets

DAIMI Report Series
2002English

Control Optimality for Ordinary Petri Nets

IFAC Proceedings Volumes
2011English

Solution Techniques for Stochastic Petri Nets.

English

Supervisors of Petri Nets

Research Papers Faculty of Materials Science and Technology Slovak University of Technology
2019English

Papetri : Environment for the Analysis of PETRI Nets

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy