CTL* model checking for data-aware dynamic systems with arithmetic
From MaRDI portal
Publication:2104496
Cites work
- scientific article; zbMATH DE number 1232241 (Why is no real title available?)
- scientific article; zbMATH DE number 1954380 (Why is no real title available?)
- scientific article; zbMATH DE number 1408336 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- An automata-based approach for \(\text{CTL}^{*}\) with constraints
- An automata-theoretic approach to constraint LTL
- Balanced multi-perspective checking of process conformance
- Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints
- Branching-time model checking gap-order constraint systems
- Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
- Cover Algorithms and Their Combination
- Deciding properties of integral relational automata
- Decision procedures. An algorithmic point of view
- Equivalence between model-checking flat counter systems and Presburger arithmetic
- First-order -calculus over generic transition systems and applications to the situation calculus
- Iterating Octagons
- LTL over integer periodicity constraints
- Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems
- Model-checking graded computation-tree logic with finite path semantics
- Process-centric views of data-driven business artifacts
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
- Soundness verification of data-aware process models with variable-to-variable conditions
- Verification of gap-order constraint abstractions of counter systems
- Verification of qualitative \(\mathbb Z\) constraints
This page was built for publication: CTL* model checking for data-aware dynamic systems with arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104496)
