Verification of Reachability Properties for Time Petri Nets

DOI10.1007/978-3-642-41036-9_15zbMath1407.68293OpenAlexW135860055MaRDI QIDQ5168522

Naim Aber, Laure Petrucci, Kais Klai

Publication date: 7 July 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-41036-9_15

zbMATH Keywords

time Petri netsmodel checkingreachability properties

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)

Related Items (1)

Approximated timed reachability graphs for the robust control of discrete event systems

This page was built for publication: Verification of Reachability Properties for Time Petri Nets