scientific article; zbMATH DE number 1142326

Cited in

(only showing first 100 items - show all)

Dischargeable obligations in the \(\mathcal{S}\)CIFF framework
THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆
Deontic action logic, atomic Boolean algebras and fault-tolerance
Model checking quantum Markov chains
Parametrised complexity of satisfiability in temporal logic
Equilibria for games with combined qualitative and quantitative objectives
Formal Modelling of Emotions in BDI Agents
Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
Conversation protocols: a formalism for specification and verification of reactive electronic services
A decision procedure for \(\mathrm{CTL}^{*}\) based on tableaux and automata
Optimal tableau method for constructive satisfiability testing and model synthesis in the alternating-time temporal logic \(\mathrm{ATL}^+\)
Multiphase until formulas over Markov reward models: an algebraic approach
On complexity of verification of interacting agents' behavior
Inf-datalog, Modal Logic and Complexities
Weighted operator precedence languages
A Logic for Reasoning about Rational Agents
From LTL to Symbolically Represented Deterministic Automata
Fair Derivations in Monodic Temporal Reasoning
ATL* Satisfiability Is 2EXPTIME-Complete
A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases
Extracting unsatisfiable cores for LTL via temporal resolution
Alternating automata: unifying truth and validity checking for temporal logics
Semantical considerations on intention dynamics for BDI agents
Synchronized linear-time temporal logic
CPO semantics of timed interactive actor networks
Continuous valuations of temporal logic specifications with applications to parameter optimization and robustness measures
Model checking hybrid logics (with an application to semistructured data)
Specification of abstract dynamic-data types: A temporal logic approach
Probabilistic stit logic
Системы временной логики I: моменты, истории, деревья
Representing any-time and program-iteration by infinitary conjunction
Meanings of model checking
Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\)
Relating word and tree automata
Linear temporal logic with until and next, logical consecutions
The computational complexity of scenario-based agent verification and design
Bounded linear-time temporal logic: a proof-theoretic investigation
Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
Clausal resolution in a logic of rational agency
Extending fairness expressibility of ECTL^+: a tree-style one-pass tableau approach
Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
Probabilistic temporal logic with countably additive semantics
Size-change termination and satisfiability for linear-time temporal logics
Towards a notion of unsatisfiable and unrealizable cores for LTL
Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay
On ACTL formulas having linear counterexamples
The complexity of bisimilarity-checking for one-counter processes.
Combined model checking for temporal, probabilistic, and real-time logics
Symbolic model checking for -calculus requires exponential time
On the complexity of rational verification
Model and program repair via group actions
Iterated Boolean games
Enhancing unsatisfiable cores for LTL with information on temporal relevance
The finite satisfiability problem for PCTL is undecidable
ACTLW -- an action-based computation tree logic with unless operator
On fairness and randomness
A formalization of programs in first-order logic with a discrete linear order
Deontic epistemic stit logic distinguishing modes of mens rea
Constructing situations and time
Timed modal logics for real-time systems. Specification, verification and control
Investigation on fragments of first order branching temporal logic
Propositional Dynamic Logic for Message-Passing Systems
Model and program repair via group actions and structure unwinding
Making a start with the stit logic analysis of intentional action
Hierarchical hybrid symbolic robot motion planning and control
Survey on Directed Model Checking
scientific article; zbMATH DE number 7577575 (Why is no real title available?)
On the complexity of resource-bounded logics
Mechanising first-order temporal resolution
Efficient timed model checking for discrete-time systems
A structural/temporal query language for business processes
The sweep-line state space exploration method
Using Temporal Logic to Integrate Goals and Qualitative Preferences into Agent Programming
Finite automata on timed \(\omega\)-trees
Ready simulation for concurrency: it's logical!
Temporal connectives versus explicit timestamps to query temporal databases
t-DeLP: an argumentation-based temporal defeasible logic programming framework
Code obfuscation against abstraction refinement attacks
On the Complexity of Branching-Time Logics
Verification from Declarative Specifications Using Logic Programming
Completeness for flat modal fixpoint logics
Living up to one's commitments: Agency, strategies and trust
Intermittent fault diagnosability of discrete event systems: an overview of automaton-based approaches
On the logic of cooperation and propositional control
Actor-based slicing techniques for efficient reduction of Rebeca models
Decentralized route-planning for multi-vehicle teams to satisfy a subclass of linear temporal logic specifications
Evaluation of cyber security and modelling of risk propagation with Petri nets
First-order temporal verification in practice
Verifying data refinements using a model checker
Intentions and potential intentions revisited
Encapsulating deontic and branching time specifications
Reachability and connectivity queries in constraint databases
Applying model-checking to solve queries on semistructured data
A resolution-based proof method for temporal logics of knowledge and belief
The first-order theory of linear one-step rewriting is undecidable
Proving possibility properties
DP lower bounds for equivalence-checking and model-checking of one-counter automata
Combining static analysis and case-based search space partitioning for reducing peak memory in model checking
Employing symmetry reductions in model checking
Completeness and decidability results for CTL in constructive type theory

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385542)