SMT-Based Reachability Checking for Bounded Time Petri Nets

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

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

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

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking

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)