MOCHA

swMATH12935MaRDI QIDQ24858FDOQ24858

Author name not available (Why is that?)

Cited In (82)

• Title not available (Why is that?)
• Algebraic Methodology and Software Technology
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Compositional verification for timed systems based on automatic invariant generation
• Title not available (Why is that?)
• Automated Technology for Verification and Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Formal Methods for Components and Objects
• Parameterised verification for multi-agent systems
• Formal analysis of multiparty contract signing
• Selective Approaches for Solving Weak Games
• A formal treatment of agents, goals and operations using alternating-time temporal logic
• Title not available (Why is that?)
• Automatic verification of concurrent systems using a formula-based compositional approach
• Exploiting design structure in model checking. (Abstract)
• Multi-player games with LDL goals over finite traces
• Refining Interface Alphabets for Compositional Verification
• Title not available (Why is that?)
• Verifying Time and Communication Costs of Rule-Based Reasoners
• A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
• Conditions of contracts for separating responsibilities in heterogeneous systems
• Automatic symbolic compositional verification by learning assumptions
• Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
• On the logic of cooperation and propositional control
• Title not available (Why is that?)
• Verifying time, memory and communication bounds in systems of reasoning agents
• CTL-property transformations along an incremental design process
• Testing Systems of Concurrent Black-Boxes—An Automata-Theoretic and Decompositional Approach
• Model checking abilities of agents: a closer look
• Verification of games in the game description language
• Proving ATL* Properties of Infinite-State Systems
• Assume-guarantee synthesis for digital contract signing
• Automated temporal equilibrium analysis: verification and synthesis of multi-player games
• Types as models: model checking message-passing programs
• Synthesizing protocols for digital contract signing
• A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic
• Quantitative verification and strategy synthesis for stochastic games
• On obligations and normative ability: Towards a logical analysis of the social contract
• Formal Approaches to Software Testing
• Synthesis and verification of uniform strategies for multi-agent systems
• To know or not to know: Epistemic approaches to security protocol verification
• Model-checking iterated games
• From model checking to equilibrium checking: reactive modules for rational verification
• Social laws in alternating time: effectiveness, feasibility, and synthesis
• Reasoning about equilibria in game-like concurrent systems
• A logical characterisation of qualitative coalitional games
• Strategic reasoning with a bounded number of resources: the quest for tractability
• Approximate verification of strategic abilities under imperfect information
• Algorithms for finding coalitions exploiting a new reciprocity condition
• Verification of multi-agent systems with public actions against strategy logic
• Tools and Algorithms for the Construction and Analysis of Systems
• Verifying systems of resource-bounded agents
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automatic verification of competitive stochastic systems
• Model Checking Software
• Symbolic model checking for alternating projection temporal logic
• Compositional Verification of Quantitative Properties of Statecharts
• Deductive verification of alternating systems
• Title not available (Why is that?)
• Action and knowledge in alternating-time temporal logic
• Title not available (Why is that?)
• A methodology for hardware verification using compositional model checking
• Expressing properties of coalitional ability under resource bounds
• Title not available (Why is that?)
• PRISM-games: a model checker for stochastic multi-player games
• Towards integrated verification of timed transition models
• Verification of SpecC using predicate abstraction
• Imperfect information in reactive modules games
• Theoretical Computer Science
• A first-order coalition logic for BDI-agents
• Compositional reasoning
• Title not available (Why is that?)
• Logical formalism for specification of real-time multiagent systems
• Symbolic computational techniques for solving games
• Modular refinement of hierarchic reactive machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems

This page was built for software: MOCHA