Pages that link to "Item:Q1258296"

The following pages link to Propositional dynamic logic of regular programs (Q1258296):

Displaying 50 items.

• Existential second-order logic and modal logic with quantified accessibility relations (Q259071) (← links)
• Bisimilar and logically equivalent programs in PDL (Q281144) (← links)
• Extending propositional dynamic logic for Petri nets (Q281154) (← links)
• Bounded situation calculus action theories (Q286407) (← links)
• Completeness and decidability results for CTL in constructive type theory (Q287375) (← links)
• The undecidability of quantified announcements (Q310079) (← links)
• ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching (Q352943) (← links)
• Action emulation (Q375313) (← links)
• Branching-time logics with path relativisation (Q386037) (← links)
• Complexity of synthesis of composite service with correctness guarantee (Q439758) (← links)
• \textit{Once} and \textit{for all} (Q439961) (← links)
• Linear temporal logic symbolic model checking (Q465680) (← links)
• Propositional dynamic logic for searching games with errors (Q472791) (← links)
• Temporal logics for concurrent recursive programs: satisfiability and model checking (Q472794) (← links)
• Public announcement logic with distributed knowledge: expressivity, completeness and complexity (Q484926) (← links)
• The complexity of debate checking (Q493647) (← links)
• Epistemic protocols for dynamic gossip (Q504511) (← links)
• Completely and partially executable sequences of actions in deontic context (Q513930) (← links)
• Complexity of validity for propositional dependence logics (Q515658) (← links)
• Parametric linear dynamic logic (Q515660) (← links)
• An algebraic approach to multirelations and their properties (Q516032) (← links)
• Rewrite rules for \(\mathrm{CTL}^\ast\) (Q518745) (← links)
• A calculus for automatic verification of Petri nets based on resolution and dynamic logics (Q530854) (← links)
• CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks (Q548484) (← links)
• Reasoning about common knowledge with infinitely many agents (Q598197) (← links)
• A description logic based situation calculus (Q604908) (← links)
• Reasoning about permitted announcements (Q652739) (← links)
• Reasoning about plan revision in BDI agent programs (Q655407) (← links)
• Games for the \(\mu\)-calculus (Q671352) (← links)
• Logical analysis of demonic nondeterministic programs (Q671651) (← links)
• Visibly linear temporal logic (Q682377) (← links)
• The expressive power of implicit specifications (Q685409) (← links)
• Gentzen-type axiomatization for PAL (Q688720) (← links)
• Propositional dynamic logic of nonregular programs (Q792083) (← links)
• A probabilistic dynamic logic (Q792757) (← links)
• The propositional dynamic logic of deterministic, well-structured programs (Q801682) (← links)
• Results on the propositional \(\mu\)-calculus (Q801893) (← links)
• Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\) (Q801901) (← links)
• Decidability of finite probabilistic propositional dynamic logics (Q809069) (← links)
• Propositional dynamic logic of context-free programs and fixpoint logic with chop (Q845832) (← links)
• Branching versus linear logics yet again (Q911747) (← links)
• A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
• Determinism and looping in combinatory PDL (Q921968) (← links)
• Deciding expressive description logics in the framework of resolution (Q924723) (← links)
• Local variable scoping and Kleene algebra with tests (Q929964) (← links)
• Cut-free sequent systems for temporal logic (Q941433) (← links)
• Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
• A note on an extension of PDL (Q959057) (← links)
• Alternating-time stream logic for multi-agent systems (Q967523) (← links)
• On the proof theory of the modal mu-calculus (Q1005937) (← links)