The reachability problem for Petri nets is not elementary

W Czerwiński, S Lasota, R Lazić, J Leroux… - Journal of the ACM …, 2020 - dl.acm.org
Petri nets, also known as vector addition systems, are a long established model of
concurrency with extensive applications in modeling and analysis of hardware, software …

Design and verification of real-life processes with application of Petri nets

I Grobelna, R Wiśniewski, M Grobelny… - … on Systems, Man …, 2016 - ieeexplore.ieee.org
This paper focuses on the design and verification methods of distributed logic controllers
supervising real-life processes. Such systems have to be designed very carefully and …

The reachability problem for two-dimensional vector addition systems with states

M Blondin, M Englert, A Finkel, S Göller… - Journal of the ACM …, 2021 - dl.acm.org
We prove that the reachability problem for two-dimensional vector addition systems with
states is NL-complete or PSPACE-complete, depending on whether the numbers in the input …

Improved Ackermannian lower bound for the Petri nets reachability problem

S Lasota - arXiv preprint arXiv:2105.08551, 2021 - arxiv.org
Petri nets, equivalently presentable as vector addition systems with states, are an
established model of concurrency with widespread applications. The reachability problem …

A polynomial-time algorithm to obtain state machine cover of live and safe Petri nets

AG Karatkevich, R Wiśniewski - IEEE Transactions on Systems …, 2019 - ieeexplore.ieee.org
A method to find the minimized state machine cover of live and safe Petri nets (PNs) is
proposed in this paper. It is required that a cover be obtained in some implementation …

Reachability in fixed dimension vector addition systems with states

W Czerwiński, S Lasota, R Lazić, J Leroux… - arXiv preprint arXiv …, 2020 - arxiv.org
The reachability problem is a central decision problem for formal verification based on vector
addition systems with states (VASS), which are equivalent to Petri nets and form one of the …

Improved lower bounds for reachability in vector addition systems

W Czerwiński, S Lasota… - … Colloquium on Automata …, 2021 - drops.dagstuhl.de
We investigate computational complexity of the reachability problem for vector addition
systems (or, equivalently, Petri nets), the central algorithmic problem in verification of …

Advanced 56 channels stimulation system to drive intrafascicular electrodes

T Guiho, D Andreu, VM López-Alvarez… - Converging Clinical and …, 2017 - Springer
A wearable, 56-channel stimulator was developed and successfully tested to drive
multichannel intrafascicular electrodes. It is able to safely elicit sensory afferent signals …

Interpreted synchronous extension of time Petri nets: Definition, semantics and formal analysis

K Godary-Dejean, H Leroux, D Andreu - Discrete Event Dynamic Systems, 2022 - Springer
Our work is integrated into a global methodology to design synchronously executed
embedded critical systems. It is used for the development of medical devices implanted into …

Cascading Failure Modeling for Circuit Systems Considering Continuous Degradation and Random Shocks Using an Impedance Network

Y Jin, Q Zhang - Symmetry, 2024 - mdpi.com
The reliability of circuit systems is primarily affected by cascading failures due to their
complex structural and functional coupling. Causes of cascading failure during circuit …