CTL* model checking for data-aware dynamic systems with arithmetic
From MaRDI portal
Publication:2104496
DOI10.1007/978-3-031-10769-6_4OpenAlexW4289104017MaRDI QIDQ2104496
Marco Montali, Paolo Felli, Sarah Winkler
Publication date: 7 December 2022
Full work available at URL: https://arxiv.org/abs/2205.08976
Uses Software
Cites Work
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
- Balanced multi-perspective checking of process conformance
- Decision procedures. An algorithmic point of view
- An automata-theoretic approach to constraint LTL
- Verification of qualitative \(\mathbb Z\) constraints
- First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus
- Model-checking graded computation-tree logic with finite path semantics
- Process-centric views of data-driven business artifacts
- Verification of gap-order constraint abstractions of counter systems
- LTL over integer periodicity constraints
- Equivalence between model-checking flat counter systems and Presburger arithmetic
- Model-checking CTL* over flat Presburger counter systems
- Branching-Time Model Checking Gap-Order Constraint Systems
- Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
- Iterating Octagons
- Deciding properties of integral relational automata
- Soundness Verification of Data-Aware Process Models with Variable-to-Variable Conditions
- An Automata-based Approach for CTL⋆ With Constraints
- Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints
- Cover Algorithms and Their Combination
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: CTL* model checking for data-aware dynamic systems with arithmetic
