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)
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 ⋮ A formalization of programs in first-order logic with a discrete linear order ⋮ Equilibria for games with combined qualitative and quantitative objectives ⋮ Completeness and decidability results for CTL in constructive type theory ⋮ Stutter-invariant temporal properties are expressible without the next-time operator ⋮ Reasoning about coalitional games ⋮ On fairness and randomness ⋮ Checking EMTLK properties of timed interpreted systems via bounded model checking ⋮ A power-set construction for reducing Büchi automata to non-determinism degree two ⋮ Deontic action logic, atomic Boolean algebras and fault-tolerance ⋮ Verifying data refinements using a model checker ⋮ First-order temporal verification in practice ⋮ Coverage metrics for temporal logic model checking ⋮ Feature interaction detection by pairwise analysis of LTL properties -- A case study ⋮ Reasoning about equilibria in game-like concurrent systems ⋮ Question-guided stubborn set methods for state properties ⋮ Property transformation under specification change ⋮ Quantitative temporal logics over the reals: PSpace and below ⋮ Hybridization methods for the analysis of nonlinear systems ⋮ Embedding of biological regulatory networks and property preservation ⋮ Program equilibrium -- a program reasoning approach ⋮ A formal model of emotion triggers: an approach for BDI agents ⋮ Specification and verification of data-driven Web applications ⋮ Open answer set programming for the semantic web ⋮ Programming in metric temporal logic ⋮ Towards a theory of intention revision ⋮ Social laws in alternating time: effectiveness, feasibility, and synthesis ⋮ Model checking quantum Markov chains ⋮ Application of static analyses for state-space reduction to the microcontroller binary code ⋮ Verifying the consistency of web-based technical documentations ⋮ Providing RIA user interfaces with accessibility properties ⋮ Combined model checking for temporal, probabilistic, and real-time logics ⋮ Updating action domain descriptions ⋮ A canonical form based decision procedure and model checking approach for propositional projection temporal logic ⋮ Multiphase until formulas over Markov reward models: an algebraic approach ⋮ A structural/temporal query language for business processes ⋮ Agent planning programs ⋮ The sweep-line state space exploration method ⋮ Symbolic execution of Reo circuits using constraint automata ⋮ Towards a notion of unsatisfiable and unrealizable cores for LTL ⋮ Completeness for flat modal fixpoint logics ⋮ Complexity of synthesis of composite service with correctness guarantee ⋮ Reliability-aware automatic composition approach for web services ⋮ On the analysis of compensation correctness ⋮ Synchronized linear-time temporal logic ⋮ Agent deliberation in an executable temporal framework ⋮ On the computational complexity of behavioral description-based web service composition ⋮ Making a start with the stit logic analysis of intentional action ⋮ Linear temporal logic symbolic model checking ⋮ 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 ⋮ Where logic and agents meet ⋮ Algebraic neighbourhood logic ⋮ Living up to one's commitments: Agency, strategies and trust ⋮ Runtime verification of embedded real-time systems ⋮ Deductive verification of alternating systems ⋮ Cut-free sequent systems for temporal logic ⋮ The monadic second-order logic of graphs. IX: Machines and their behaviours ⋮ A hierarchy of temporal logics with past ⋮ About the expressive power of CTL combinators ⋮ Arity hierarchy for temporal logics ⋮ Translations between modal logics of reactive systems ⋮ Logical formalism for specification of real-time multiagent systems ⋮ Model checking MASL specification of distributed real-time systems ⋮ Linear temporal logic with until and next, logical consecutions ⋮ Embedding finite automata within regular expressions ⋮ Verification of scope-dependent hierarchical state machines ⋮ Enhancing unsatisfiable cores for LTL with information on temporal relevance ⋮ Partial-order Boolean games: informational independence in a logic-based model of strategic interaction ⋮ Prior and temporal sequences for natural language ⋮ Refining autonomous agents with declarative beliefs and desires ⋮ Assume-admissible synthesis ⋮ CPO semantics of timed interactive actor networks ⋮ Tableau systems for deontic action logics based on finite Boolean algebras, and their complexity ⋮ Symbolic trajectory evaluation for word-level verification: theory and implementation ⋮ Constructing situations and time ⋮ Deontic epistemic stit logic distinguishing modes of mens rea ⋮ Continuous valuations of temporal logic specifications with applications to parameter optimization and robustness measures ⋮ Timed modal logics for real-time systems. Specification, verification and control ⋮ Safe reasoning with logic LTS ⋮ Conversation protocols: a formalism for specification and verification of reactive electronic services ⋮ Encapsulating deontic and branching time specifications ⋮ Actor-based slicing techniques for efficient reduction of Rebeca models ⋮ Ready simulation for concurrency: it's logical! ⋮ A note on stutter-invariant PLTL ⋮ A theory of ultimately periodic languages and automata with an application to time granularity ⋮ Reasoning about goal-directed real-time teleo-reactive programs ⋮ Exploring the future with resource-bounded agents ⋮ A logic of strategic ability under bounded memory ⋮ Assisting the design of a groupware system - Model checking usability aspects of thinkteam ⋮ The first-order theory of linear one-step rewriting is undecidable ⋮ Proving possibility properties ⋮ Bounded linear-time temporal logic: a proof-theoretic investigation ⋮ Multi-modal CTL: completeness, complexity, and an application ⋮ Systems of agents controlled by logical programs: complexity of verification ⋮ Quantitative semantics, topology, and possibility measures ⋮ Temporal connectives versus explicit timestamps to query temporal databases ⋮ The complexity of achievement and maintenance problems in agent-based systems ⋮ Weak, strong, and strong cyclic planning via symbolic model checking ⋮ Interpretability of first-order linear temporal logics in fork algebras
This page was built for publication:
