Advances in verification of time Petri nets and timed automata. A temporal logic approach.

DOI10.1007/978-3-540-32870-4zbMath1110.68087OpenAlexW2499902956MaRDI QIDQ2493434

Agata Półrola, Wojciech Penczek

Publication date: 13 June 2006

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-32870-4

zbMATH Keywords

verificationtimed automatatime Petri netstemporal logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Temporal logic (03B44) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Specification and Verification of Multi-Agent Systems ⋮ Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets ⋮ TCTL-preserving translations from timed-arc Petri nets to networks of timed automata ⋮ Verification of Timed-Arc Petri Nets

Uses Software

• CPN/Tools
• Kronos
• Uppaal2k
• Design/CPN
• TINA
• SPIN
• Uppaal
• Chaff
• fc2tools

This page was built for publication: Advances in verification of time Petri nets and timed automata. A temporal logic approach.