Separators in Continuous Petri Nets

DOI10.46298/LMCS-20(1:15)2024arXiv2209.02767v4MaRDI QIDQ6151564FDOQ6151564

Authors: Michael Blondin, Javier Esparza 

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

Recommendations

• Separators in continuous Petri nets
• Separability in persistent Petri nets
• The logical view on continuous Petri nets
• Separability in Conflict-Free Petri Nets
• Complexity analysis of continuous Petri nets

zbMATH Keywords

Petri netseparatorscertificatescontinuous reachability

Mathematics Subject Classification ID

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

Cites Work

• Component-based synthesis for complex APIs
• Title not available (Why is that?)
• Reasoning about systems with many processes
• Free Choice Petri Nets
• Complexity analysis of continuous Petri nets
• Understanding and using linear programming
• Real addition and the polynomial hierarchy
• Constraint solving for interpolation
• Checking qualitative liveness properties of replicated systems with stochastic scheduling
• The logical view on continuous Petri nets
• Logics for continuous reachability in Petri nets and vector addition systems with states
• Improving interpolants for linear arithmetic

Cited In (1)

• Separators in continuous Petri nets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151564)