Pages that link to "Item:Q1820578"
From MaRDI portal
The following pages link to Modalities for model checking: Branching time logic strikes back (Q1820578):
Displaying 50 items.
- Synthesis of large dynamic concurrent programs from dynamic specifications (Q346790) (← links)
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks (Q548484) (← links)
- Global and local views of state fairness (Q804304) (← links)
- A taxonomy of fairness and temporal logic problems for Petri nets (Q805257) (← links)
- Automated analysis of mutual exclusion algorithms using CCS (Q911263) (← links)
- A Rice-style theorem for parallel automata (Q1004287) (← links)
- Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
- Safety, liveness and fairness in temporal logic (Q1343862) (← links)
- A methodology for designing proof rules for fair parallel programs (Q1377299) (← links)
- On temporal logic versus Datalog (Q1401358) (← links)
- Systolic tree \(\omega\)-languages: The operational and the logical view (Q1575949) (← links)
- Fairness modulo theory: a new approach to LTL software model checking (Q1702910) (← links)
- A compositional approach to CTL\(^*\) verification (Q1770366) (← links)
- An infinite hierarchy of temporal logics over branching time (Q1854487) (← links)
- The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
- Employing symmetry reductions in model checking (Q1886448) (← links)
- Model checking LTL with regular valuations for pushdown systems (Q1887158) (← links)
- Branching-time temporal logic and tree automata (Q1917081) (← links)
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives (Q2029600) (← links)
- Temporal logic with recursion (Q2051830) (← links)
- Determinization and limit-determinization of Emerson-Lei automata (Q2147175) (← links)
- Diagnosability of fair transition systems (Q2152493) (← links)
- Off-the-shelf automated analysis of liveness properties for just paths (Q2182670) (← links)
- LTL to self-loop alternating automata with generic acceptance and back (Q2202003) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- Certifying inexpressibility (Q2233423) (← links)
- Model checking for hybrid branching-time logics (Q2291813) (← links)
- Efficient timed model checking for discrete-time systems (Q2368994) (← links)
- To be fair, use bundles (Q2408744) (← links)
- Model checking with fairness assumptions using PAT (Q2418662) (← links)
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) (Q2500472) (← links)
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps (Q2505621) (← links)
- Model checking with strong fairness (Q2505624) (← links)
- Equivalence between model-checking flat counter systems and Presburger arithmetic (Q2636509) (← links)
- Learning to verify branching time properties (Q2642669) (← links)
- Mean-payoff games with \(\omega\)-regular specifications (Q2669180) (← links)
- Specification and Verification of Multi-Agent Systems (Q3166991) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- Generic Emptiness Check for Fun and Profit (Q3297604) (← links)
- (Q3384875) (← links)
- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic (Q3447697) (← links)
- Discriminative Model Checking (Q3512513) (← links)
- Quantitative Analysis under Fairness Constraints (Q3648696) (← links)
- On-the-fly Emptiness Check of Transition-Based Streett Automata (Q3648699) (← links)
- TTL : a formalism to describe local and global properties of distributed systems (Q3992090) (← links)
- (Q4037390) (← links)
- A clausal resolution method for CTL branching-time temporal logic (Q4421285) (← links)
- On global induction mechanisms in a<i>μ</i>-calculus with explicit approximations (Q4460690) (← links)
- A tableau calculus for first-order branching time logic (Q4632314) (← links)
- Logical questions concerning the <i>μ</i>-calculus: Interpolation, Lyndon and Łoś-Tarski (Q4953222) (← links)
