Bounded parametric model checking for elementary net systems

DOI10.1007/978-3-642-18222-8_3MaRDI QIDQ3066133zbMATH OpenOpenAlexFDO

Authors Michał Knapik, MacIej Szreter, Wojciech Penczek

Publication date 8 January 2011

Published in Transactions on Petri Nets and Other Models of Concurrency IV (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18222-8_3

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1799521
• Bounded parametric verification for distributed time Petri nets with discrete-time semantics
• Bounded Model Checking for Parametric Timed Automata
• Parametric model checking with VerICS
• Bounded model checking with parametric data structures

Cited in

(4)

• Bounded model checking with parametric data structures
• Parametric model checking with VerICS
• Bounded parametric verification for distributed time Petri nets with discrete-time semantics
• scientific article; zbMATH DE number 1799521 (Why is no real title available?)

This page was built for publication: Bounded parametric model checking for elementary net systems

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