SMT-based reachability checking for bounded time Petri nets

DOI10.3233/FI-2014-1135zbMATH Open1315.68194OpenAlexW1876919938MaRDI QIDQ5259305FDOQ5259305

Authors: Agata Półrola, Piotr Cybula, Artur Męski 

Publication date: 26 June 2015

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2014-1135

Recommendations

• SAT-based (parametric) reachability for a class of distributed time Petri nets
• Symbolic Reachability Analysis of Integer Timed Petri Nets
• scientific article; zbMATH DE number 4209631
• scientific article; zbMATH DE number 1534591
• Automated Technology for Verification and Analysis

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (10)

• Title not available (Why is that?)
• On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
• Automated Technology for Verification and Analysis
• SMT-based reachability analysis for simply-timed systems
• Title not available (Why is that?)
• A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking
• SAT-based (parametric) reachability for a class of distributed time Petri nets
• Shrinking of time Petri nets
• Symbolic analysis and parameter synthesis for time Petri nets using Maude and SMT solving
• BDD-based bounded model checking for temporal properties of 1-safe Petri nets

This page was built for publication: SMT-based reachability checking for bounded time Petri nets

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