Separators in continuous Petri nets

DOI10.1007/978-3-030-99253-8_5arXiv2209.02767OpenAlexW4226424099MaRDI QIDQ6181924

Michael Blondin, Javier Esparza

Publication date: 23 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.02767

zbMATH Keywords

Petri netseparatorscertificatescontinuous reachability

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Constraint solving for interpolation
• Checking qualitative liveness properties of replicated systems with stochastic scheduling
• Complexity Analysis of Continuous Petri Nets
• Improving Interpolants for Linear Arithmetic
• Reasoning about systems with many processes
• Free Choice Petri Nets
• The reachability problem for Petri nets is not elementary
• The Logical View on Continuous Petri Nets
• Component-based synthesis for complex APIs

This page was built for publication: Separators in continuous Petri nets