Separators in Continuous Petri Nets

DOI10.46298/lmcs-20(1:15)2024arXiv2209.02767v4MaRDI QIDQ6151564

Javier Esparza, Michael Blondin

Publication date: 11 March 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Petri netseparatorscertificatescontinuous reachability

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Constraint solving for interpolation
• Understanding and using linear programming
• Real addition and the polynomial hierarchy
• 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 Logical View on Continuous Petri Nets
• Component-based synthesis for complex APIs

This page was built for publication: Separators in Continuous Petri Nets