Pages that link to "Item:Q3719811"

The following pages link to Automatic verification of finite-state concurrent systems using temporal logic specifications (Q3719811):

Displaying 50 items.

• Verification of \(\mathrm{EB}^3\) specifications using CADP (Q282110) (← links)
• Completeness and decidability results for CTL in constructive type theory (Q287375) (← links)
• Synthesis of large dynamic concurrent programs from dynamic specifications (Q346790) (← links)
• A complete proof system for propositional projection temporal logic (Q391223) (← links)
• Improved model checking of hierarchical systems (Q418123) (← links)
• \textsc{NeVer}: a tool for artificial neural networks verification (Q421446) (← links)
• Kripke modelling and verification of temporal specifications of a multiple UAV system (Q434449) (← links)
• A formal model for service-oriented interactions (Q436383) (← links)
• A novel logic-based automatic approach to constructing compliant security policies (Q439715) (← links)
• \textit{Once} and \textit{for all} (Q439961) (← links)
• Three-valued abstraction for probabilistic systems (Q444484) (← links)
• Static analysis of IMC (Q444504) (← links)
• Feasibility analysis for robustness quantification by symbolic model checking (Q453480) (← links)
• Linear temporal logic symbolic model checking (Q465680) (← links)
• An introduction to mechanized reasoning (Q504394) (← links)
• On-line compositional controller synthesis for AGV (Q513815) (← links)
• On the axiomatizability of some first-order spatio-temporal theories (Q514577) (← links)
• Complexity of validity for propositional dependence logics (Q515658) (← links)
• The modeling library of eavesdropping methods in quantum cryptography protocols by model checking (Q518056) (← links)
• Computation tree logic model checking based on possibility measures (Q529055) (← links)
• A data-flow approach to test multi-agent ASMs (Q539229) (← links)
• IDD-based model validation of biochemical networks (Q548487) (← links)
• Modeling dynamic reconfigurations in Reo using high-level replacement systems (Q608354) (← links)
• A state/event-based model-checking approach for the analysis of abstract system properties (Q617925) (← links)
• Trace-based verification of imperative programs with I/O (Q617977) (← links)
• Where logic and agents meet (Q657584) (← links)
• A hierarchy of temporal logics with past (Q672329) (← links)
• About the expressive power of CTL combinators (Q672975) (← links)
• Compilation of the ELECTRE reactive language into finite transition systems (Q673127) (← links)
• Synthesis of obfuscation policies to ensure privacy and utility (Q682359) (← links)
• A stubborn attack on state explosion (Q685106) (← links)
• Compositional checking of satisfaction (Q685107) (← links)
• Linear reachability problems and minimal solutions to linear Diophantine equation systems (Q703515) (← links)
• Abstract reduction in directed model checking CCS processes (Q715051) (← links)
• A formal proof of the deadline driven scheduler in PPTL axiomatic system (Q744103) (← links)
• A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria (Q747538) (← links)
• Priority systems with many identical processes (Q758201) (← links)
• Game-theoretic simulation checking tool (Q764005) (← links)
• Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
• Conformant planning via symbolic model checking and heuristic search (Q814631) (← links)
• Verifying time partitioning in the DEOS scheduling kernel (Q816194) (← links)
• Distributed symbolic model checking for \(\mu\)-calculus (Q816198) (← links)
• Reduced models for efficient CCS verification (Q816205) (← links)
• Combining symmetry reduction and under-approximation for symbolic model checking (Q816210) (← links)
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners (Q835826) (← links)
• The formal-CAFE methodology and model checking patterns in the specification of e-commerce systems (Q862581) (← links)
• Data structures for symbolic multi-valued model-checking (Q862857) (← links)
• Minimal probabilistic P systems for modelling ecological systems (Q896706) (← links)
• Multiphase until formulas over Markov reward models: an algebraic approach (Q896909) (← links)
• A reduced maximality labeled transition system generation for recursive Petri nets (Q903505) (← links)