Compositional analysis of probabilistic timed graph transformation systems

DOI10.1145/3572782MaRDI QIDQ6611954zbMATH OpenFDO

Authors Maria Maximova, Sven Schneider, Holger Giese

Publication date 27 September 2024

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3572782

zbMATH Keywords

compositional analysiscyber-physical systemsgraph transformation systemsmodel checkingprobabilistic timed systemsqualitative analysisquantitative analysis

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Compositional analysis of probabilistic timed graph transformation systems
• A simulator for probabilistic timed graph transformation systems with complex large-scale topologies
• Probabilistic timed graph transformation systems
• Probabilistic Metric Temporal Graph Logic
• Probabilistic timed graph transformation systems

Cites work

• A compositional modelling and verification framework for stochastic hybrid systems
• A theory of timed automata
• Automatic verification of real-time systems with discrete probability distributions.
• Compositional analysis of probabilistic timed graph transformation systems
• Compositional probabilistic verification through multi-objective model checking
• Compositionality in graph transformation
• Correctness of high-level transformation systems relative to nested conditions
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Formal verification of invariants for attributed graph transformation systems based on nested attributed graph conditions
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
• Fundamentals of algebraic graph transformation
• Generalised compositionality in graph transformation
• Graph parsing as graph transformation. Correctness of predictive top-down parsers
• Graph transformation for domain-specific discrete event time simulation
• Graph Transformations
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1863175 (Why is no real title available?)
• scientific article; zbMATH DE number 1884410 (Why is no real title available?)
• Interval probabilistic timed graph transformation systems
• Lazy graph transformation
• Lectures on Concurrency and Petri Nets
• Markov Chains
• Model checking probabilistic real-time properties for service-oriented systems with service level agreements
• Optimistic and pessimistic on-the-fly analysis for metric temporal graph logic
• Predictive top-down parsing for hyperedge replacement grammars
• Probabilistic automata
• Probabilistic graph transformation systems
• Probabilistic timed graph transformation systems
• Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
• Stochastic graph transformation systems
• Symbolic graphs for attributed graph constraints

Cited in

(1)

• RNA: R1CS normalization algorithm based on data flow graphs for zero-knowledge proofs

This page was built for publication: Compositional analysis of probabilistic timed graph transformation systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611954)