Pages that link to "Item:Q789895"
From MaRDI portal
The following pages link to The temporal logic of branching time (Q789895):
Displaying 50 items.
- Completeness and decidability results for CTL in constructive type theory (Q287375) (← links)
- Axiomatization of a branching time logic with indistinguishability relations (Q288245) (← links)
- The modeling library of eavesdropping methods in quantum cryptography protocols by model checking (Q518056) (← links)
- A hierarchy of temporal logics with past (Q672329) (← links)
- On Gabbay's temporal fixed point operator (Q673958) (← links)
- The expressive power of implicit specifications (Q685409) (← links)
- Encapsulating deontic and branching time specifications (Q714879) (← links)
- Bounded linear-time temporal logic: a proof-theoretic investigation (Q764266) (← links)
- Temporal logic with accessibility temporal relations generated by time states themselves (Q779153) (← links)
- The temporal logic of branching time (Q789895) (← links)
- A generalized nexttime operator in temporal logic (Q800722) (← links)
- On the strength of temporal proofs (Q809066) (← links)
- Branching versus linear logics yet again (Q911747) (← links)
- Proof systems for satisfiability in Hennessy-Milner logic with recursion (Q912592) (← links)
- SnS can be modally characterized (Q914397) (← links)
- Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms (Q929294) (← links)
- Deductive verification of alternating systems (Q939163) (← links)
- Branching-time logics repeatedly referring to states (Q1047801) (← links)
- A multiprocess network logic with temporal and spatial modalities (Q1058846) (← links)
- ``During'' cannot be expressed by ``after'' (Q1085154) (← links)
- Synthesis of communicating process skeletons from temporal-spatial logic specifications (Q1116944) (← links)
- Characterizing finite Kripke structures in propositional temporal logic (Q1123183) (← links)
- A decidable temporal logic of parallelism (Q1130239) (← links)
- TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
- A logical characterization of well branching event structures (Q1190487) (← links)
- A non-reified temporal logic (Q1190791) (← links)
- Formal timing analysis of distributed systems (Q1193762) (← links)
- \(R\)-generability, and definability in branching time logics (Q1197983) (← links)
- A note about the axioms for branching-time logic (Q1203784) (← links)
- An extended branching-time Ockhamist temporal logic (Q1288173) (← links)
- Undivided and indistinguishable histories in branching-time logics (Q1289103) (← links)
- Axiomatisation and decidability of \(F\) and \(P\) in cyclical time (Q1319266) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- Logics and decidability for labelled pre- and partially ordered Kripke structures (Q1328764) (← links)
- A branching time logic with past operators (Q1337463) (← links)
- Bisimulations for temporal logic (Q1371312) (← links)
- Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL (Q1395428) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Quantitative program logic and expected time bounds in probabilistic distributed algorithms. (Q1603711) (← links)
- Sublogics of a branching time logic of robustness (Q1740655) (← links)
- Branching within time: An expressively complete and elementarily decidable temporal logic for time granularity (Q1768798) (← links)
- Combining temporal logic systems (Q1815427) (← links)
- An infinite hierarchy of temporal logics over branching time (Q1854487) (← links)
- Linear, branching time and joint closure semantics for temporal logic (Q1863748) (← links)
- Branching time logics with multiagent temporal accessibility relations (Q2030777) (← links)
- Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models (Q2095426) (← links)
- Decision procedures and expressiveness in the temporal logic of branching time (Q2265816) (← links)
- Automatic and hierarchical verification for concurrent systems (Q2277847) (← links)
- Branching time agents logics, satisfiability problem by rules in reduced form (Q2331127) (← links)
- A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
