scientific article; zbMATH DE number 1142326
From MaRDI portal
Publication:4385542
zbMath0900.03030MaRDI QIDQ4385542
Publication date: 14 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Model checking QCTL plus on quantum Markov chains ⋮ Decentralized route-planning for multi-vehicle teams to satisfy a subclass of linear temporal logic specifications ⋮ Code obfuscation against abstraction refinement attacks ⋮ Complete axiomatization and decidability of alternating-time temporal logic ⋮ Efficient timed model checking for discrete-time systems ⋮ Combining static analysis and case-based search space partitioning for reducing peak memory in model checking ⋮ Modeling and querying biomolecular interaction networks ⋮ Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice ⋮ Employing symmetry reductions in model checking ⋮ DP lower bounds for equivalence-checking and model-checking of one-counter automata ⋮ The computational complexity of scenario-based agent verification and design ⋮ Ultraproducts and possible worlds semantics in institutions ⋮ The satisfiability problem for a quantitative fragment of PCTL ⋮ Imperfect information in reactive modules games ⋮ Diagnosability of fair transition systems ⋮ On control of systems modelled as deterministic Rabin automata ⋮ Maintenance goals of agents in a dynamic environment: formulation and policy construction ⋮ Process-centric views of data-driven business artifacts ⋮ A theoretical foundation of the DSSSL location model ⋮ A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations ⋮ From model checking to equilibrium checking: reactive modules for rational verification ⋮ Bounded variability of metric temporal logic ⋮ A propositional probabilistic logic with discrete linear time for reasoning about evidence ⋮ Axiomatising extended computation tree logic ⋮ Fixed point characterization of infinite behavior of finite-state systems ⋮ Specification of abstract dynamic-data types: A temporal logic approach ⋮ Verification of relational transducers for electronic commerce ⋮ Reachability and connectivity queries in constraint databases ⋮ Finite automata on timed \(\omega\)-trees ⋮ Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL ⋮ Application of formal methods to biological regulatory networks: extending Thomas' asynchronous logical approach with temporal logic ⋮ Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay ⋮ Pattern-based and composition-driven automatic generation of logical specifications for workflow-oriented software models ⋮ Exponential improvement of time complexity of model checking for multiagent systems with perfect recall ⋮ The complexity of the temporal logic with ``until over general linear time ⋮ On the expressivity and complexity of quantitative branching-time temporal logics ⋮ Undecidable problems in unreliable computations. ⋮ On feasible cases of checking multi-agent systems behavior. ⋮ On temporal logic versus Datalog ⋮ The complexity of bisimilarity-checking for one-counter processes. ⋮ Reasoning about non-immediate triggers in biological networks ⋮ Proving properties of continuous systems: Qualitative simulation and temporal logic ⋮ Expressiveness of propositional projection temporal logic with star ⋮ A proof-theoretic investigation of a logic of positions ⋮ Allen-like theory of time for tree-like structures ⋮ Probabilistic stit logic and its decomposition ⋮ Generalizing input-driven languages: theoretical and practical benefits ⋮ Automated temporal equilibrium analysis: verification and synthesis of multi-player games ⋮ Bisimilar linear systems. ⋮ Mathematical modal logic: A view of its evolution ⋮ Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus ⋮ Operator precedence temporal logic and model checking ⋮ Distributed synthesis is simply undecidable ⋮ A propositional linear time logic with time flow isomorphic to \(\omega^2\) ⋮ On the logic of cooperation and propositional control ⋮ Understanding planning with incomplete information and sensing ⋮ Using temporal logics to express search control knowledge for planning ⋮ Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\) ⋮ Applying model-checking to solve queries on semistructured data ⋮ Analyzing probabilistic pushdown automata ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ t-DeLP: an argumentation-based temporal defeasible logic programming framework ⋮ ACTLW -- an action-based computation tree logic with unless operator ⋮ Transformation from PLTL to automata via NFGs ⋮ An approach to infinitary temporal proof theory ⋮ A compositional approach to CTL\(^*\) verification ⋮ On the expressiveness of TPTL and MTL ⋮ A system for deduction-based formal verification of workflow-oriented software models ⋮ Model-based safety assessment of a triple modular generator with xSAP ⋮ Computation tree measurement language (CTML) ⋮ Static and dynamic property-preserving updates ⋮ Event-based time-stamped claim logic ⋮ Reasoning about strings in databases ⋮ Branching interval algebra: an almost complete picture ⋮ Intermittent fault diagnosability of discrete event systems: an overview of automaton-based approaches ⋮ Logic, semigroups and automata on words ⋮ A probabilistic approach to navigation in Hypertext ⋮ Weighted operator precedence languages ⋮ Swinging types=functions+relations+transition systems ⋮ Symbolic model checking for \(\mu\)-calculus requires exponential time ⋮ Evaluation of cyber security and modelling of risk propagation with Petri nets ⋮ A logic-based approach to incremental reasoning on multi-agent systems ⋮ How to decide continuity of rational functions on infinite words ⋮ Deductive verification of real-time systems using STeP ⋮ Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models ⋮ Relational transducers for electronic commerce ⋮ Modal algebra and Petri nets ⋮ Specification in CTL + past for verification in CTL. ⋮ An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic ⋮ Inductive synthesis of recursive processes from logical properties ⋮ Module checking ⋮ The complexity of propositional linear temporal logics in simple cases ⋮ Iterated Boolean games ⋮ The composition and validation of heterogeneous control laws ⋮ A goal-directed decision procedure for hybrid PDL ⋮ Clausal resolution in a logic of rational agency ⋮ Querying datalog programs with temporal logic ⋮ Expressibility of output equals input. Negative and positive results ⋮ Next-preserving branching bisimulation ⋮ Qualitative analysis of gene regulatory networks by temporal logic
This page was built for publication:
