Pages that link to "Item:Q2480780"

The following pages link to A decision procedure for propositional projection temporal logic with infinite models (Q2480780):

Displaying 33 items.

• A cylinder computation model for many-core parallel computing (Q391222) (← links)
• A complete proof system for propositional projection temporal logic (Q391223) (← links)
• A novel algorithm for intrusion detection based on RASL model checking (Q474447) (← links)
• A practical decision procedure for propositional projection temporal logic with infinite models (Q744099) (← links)
• A formal proof of the deadline driven scheduler in PPTL axiomatic system (Q744103) (← links)
• A canonical form based decision procedure and model checking approach for propositional projection temporal logic (Q896152) (← links)
• A complete axiom system for propositional projection temporal logic with cylinder computation model (Q896162) (← links)
• Unconditional secure communication: a Russian cards protocol (Q987501) (← links)
• A note on stutter-invariant PLTL (Q989448) (← links)
• A compiler for MSVL and its applications (Q1630985) (← links)
• A temporal programming model with atomic blocks based on projection temporal logic (Q1633057) (← links)
• An explicit transition system construction approach to LTL satisfiability checking (Q1707341) (← links)
• Verify heaps via unified model checking (Q1986561) (← links)
• A decision procedure and complete axiomatization for projection temporal logic (Q1986563) (← links)
• PPTL specification mining based on LNFG (Q2089678) (← links)
• Efficient decision procedure for propositional projection temporal logic (Q2197530) (← links)
• A sound and complete proof system for a unified temporal logic (Q2197533) (← links)
• Temporal logic specification mining of programs (Q2220776) (← links)
• Verification and enforcement of access control policies (Q2248087) (← links)
• Transformation from PLTL to automata via NFGs (Q2253959) (← links)
• Translating Xd-C programs to MSVL programs (Q2290648) (← links)
• Index set expressions can represent temporal logic formulas (Q2317353) (← links)
• A structural transformation from p-\(\pi\) to MSVL (Q2354315) (← links)
• Operational semantics of Framed Tempura (Q2378283) (← links)
• Model checking open systems with alternating projection temporal logic (Q2424878) (← links)
• Expressiveness of propositional projection temporal logic with star (Q2430015) (← links)
• Bounded model checking of traffic light control system (Q2520617) (← links)
• Extending MSVL with Semaphore (Q2817902) (← links)
• Satisfiability of Linear Time Mu-Calculus on Finite Traces (Q2817904) (← links)
• Some Fixed-Point Issues in PPTL (Q2842634) (← links)
• Axiomatic semantics of projection temporal logic programs (Q3060195) (← links)
• Symbolic Model Checking for Alternating Projection Temporal Logic (Q3467865) (← links)
• Complexity of propositional projection temporal logic with star (Q3616217) (← links)