Timed Aggregate Graph: A Finite Graph Preserving Event- and State-Based Quantitative Properties of Time Petri Nets

DOI10.1007/978-3-662-48650-4_3zbMath1366.68208OpenAlexW2401816287MaRDI QIDQ5268455

Kais Klai

Publication date: 20 June 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-662-48650-4_3

Mathematics Subject Classification ID

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

Uses Software

• Romeo
• TINA

Cites Work

• Unnamed Item
• Unnamed Item
• On-the-fly \(TCTL\) model checking for time Petri nets
• Model checking of time Petri nets using the state class timed automaton
• A theory of timed automata
• Symbolic model checking for real-time systems
• SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets
• TCTL Model Checking of Time Petri Nets
• Computer Aided Verification
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Timed Aggregate Graph: A Finite Graph Preserving Event- and State-Based Quantitative Properties of Time Petri Nets