An Incremental and Modular Technique for Checking LTL∖X Properties of Petri Nets

DOI10.1007/978-3-540-73196-2_18zbMath1215.68155OpenAlexW2154434220MaRDI QIDQ3612361

Laure Petrucci, Kais Klai, Michel Reniers

Publication date: 10 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73196-2_18

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

Decompositional Petri Net Reductions

Uses Software

• Cadence SMV

Cites Work

• A stubborn attack on state explosion
• Modular Analysis of Petri Nets
• Automated Technology for Verification and Analysis
• Implementation and Application of Automata
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Applications and Theory of Petri Nets 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Incremental and Modular Technique for Checking LTL∖X Properties of Petri Nets