Pages that link to "Item:Q1123183"

The following pages link to Characterizing finite Kripke structures in propositional temporal logic (Q1123183):

Displaying 50 items.

• Parameterised verification for multi-agent systems (Q253980) (← links)
• Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
• Synthesis of large dynamic concurrent programs from dynamic specifications (Q346790) (← links)
• Dynamical systems in categories (Q513904) (← links)
• An invariant-based approach to the verification of asynchronous parameterized networks (Q604385) (← links)
• On the composition of time Petri nets (Q645045) (← links)
• A hierarchy of temporal logics with past (Q672329) (← links)
• Modular abstractions for verifying real-time distributed systems (Q685095) (← links)
• Universal axioms for bisimulations (Q685411) (← links)
• Game-theoretic simulation checking tool (Q764005) (← links)
• Combining symmetry reduction and under-approximation for symbolic model checking (Q816210) (← links)
• Algebraic simulations (Q844884) (← links)
• Feature interaction detection by pairwise analysis of LTL properties -- A case study (Q853722) (← links)
• Invariance under stuttering in a temporal logic of actions (Q859839) (← links)
• A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures (Q877828) (← links)
• Reasoning about networks with many identical finite state processes (Q921983) (← links)
• Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
• Equational abstractions (Q944377) (← links)
• An automatic abstraction technique for verifying featured, parameterised systems (Q947791) (← links)
• Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
• Reconciling statechart semantics (Q1001804) (← links)
• Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
• An efficient simulation algorithm based on abstract interpretation (Q1049401) (← links)
• Control machines: A new model of parallelism for compositional specifications and their effective compilation (Q1177148) (← links)
• Compositionality and bisimulation: A negative result (Q1182130) (← links)
• Model checking for action-based logics (Q1326587) (← links)
• Logics and decidability for labelled pre- and partially ordered Kripke structures (Q1328764) (← links)
• On the expressivity and complexity of quantitative branching-time temporal logics (Q1401306) (← links)
• Bisimilar linear systems. (Q1421437) (← links)
• Towards a unified view of bisimulation: A comparative study (Q1575240) (← links)
• Interleaving isotactics -- an equivalence notion on behaviour abstractions (Q1643139) (← links)
• Parity game reductions (Q1656552) (← links)
• A partial order approach to branching time logic model checking. (Q1854268) (← links)
• Module checking (Q1854407) (← links)
• The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
• Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice (Q1884863) (← links)
• Applicability of fair simulation (Q1886036) (← links)
• Models of nondeterministic regular expressions (Q1970200) (← links)
• Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models (Q2095426) (← links)
• Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes (Q2257984) (← links)
• Comparative branching-time semantics for Markov chains (Q2387196) (← links)
• To be fair, use bundles (Q2408744) (← links)
• Deciding orthogonal bisimulation (Q2461535) (← links)
• A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
• LTL receding horizon control for finite deterministic systems (Q2628417) (← links)
• Characteristic Formulae for Timed Automata (Q2729632) (← links)
• Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations (Q2830042) (← links)
• (Q2845494) (← links)
• Characteristic formulae for fixed-point semantics: a general framework (Q2883115) (← links)
• Folk Theorems on the Correspondence between State-Based and Event-Based Systems (Q3075540) (← links)