Interval probabilistic timed graph transformation systems

DOI10.1007/978-3-030-78946-6_12zbMath1492.68071OpenAlexW3175747059MaRDI QIDQ2117267

Holger Giese, Maria Maximova, Sven Schneider

Publication date: 21 March 2022

Full work available at URL: https://nbn-resolving.org/urn:nbn:de:kobv:517-opus4-512895

zbMATH Keywords

model checkingquantitative analysiscyber-physical systemsqualitative analysisgraph transformation systemsinterval probabilistic timed systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Symbolic graphs for attributed graph constraints
• A theory of timed automata
• Automatic verification of real-time systems with discrete probability distributions.
• Probabilistic timed graph transformation systems
• Compositional analysis of probabilistic timed graph transformation systems
• Fundamentals of algebraic graph transformation
• Probabilistic Graph Transformation Systems

This page was built for publication: Interval probabilistic timed graph transformation systems