scientific article; zbMATH DE number 2209335
From MaRDI portal
Publication:5692280
Recommendations
Cited in
(75)- An abstraction-refinement methodology for reasoning about network games
- Generalized interface automata with multicast synchronization
- Symbolic control design for monotone systems with directed specifications
- Deadlock-free output feedback controller design based on approximately abstracted observers
- Conditions of contracts for separating responsibilities in heterogeneous systems
- Modal event-clock specifications for timed component-based design
- A game approach to determinize timed automata
- A logic for conditional local strategic reasoning
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
- Refinement checking on parametric modal transition systems
- Interface synthesis and protocol conversion
- Error-pruning in interface automata
- Controller synthesis for bisimulation equivalence
- Synthesising succinct strategies in safety games with an application to real-time scheduling
- Formal controller synthesis from specifications given by discrete-time hybrid automata
- The refinement calculus of reactive systems
- An algorithm for probabilistic alternating simulation
- Off-line test selection with test purposes for non-deterministic timed automata
- Finite abstractions with robustness margins for temporal logic-based control synthesis
- Symbolic model checking in non-Boolean domains
- Tester versus bug: a generic framework for model-based testing via games
- Play to Test
- A pre-congruence format for XY-simulation
- Quantitative simulation games
- Efficient on-the-fly algorithm for checking alternating timed simulation
- A game-theoretic approach to fault diagnosis and identification of hybrid systems
- An algebraic theory of interface automata
- A survey of stochastic -regular games
- Antichains and compositional algorithms for LTL synthesis
- Faster algorithms for alternating refinement relations
- Refinement modal logic
- Interface simulation distances
- A modal characterization of alternating approximate bisimilarity
- A domain equation for refinement of partial systems
- Symbolic models for nonlinear control systems affected by disturbances
- scientific article; zbMATH DE number 7136658 (Why is no real title available?)
- Combining partial specifications using alternating interface automata
- Safe and optimal scheduling for hard and soft tasks
- Nash equilibrium and bisimulation invariance
- Model-based testing
- Refining autonomous agents with declarative beliefs and desires
- Abstraction in fixpoint logic
- Quantitative fair simulation games
- Refining strategic ability in alternating-time temporal logic
- Game models for open systems
- Verification of general Markov decision processes by approximate similarity relations and policy refinement
- From interface automata to hypercontracts
- A Simpler Alternative: Minimizing Transition Systems Modulo Alternating Simulation Equivalence
- Robust stutter bisimulation for abstraction and controller synthesis with disturbance
- Goodbye ioco
- Specifications for decidable hybrid games
- Information-flow interfaces
- Complete multiparty session type projection with automata
- Relating alternating relations for conformance and refinement
- Refinements for open automata
- Subtyping context-free session types
- Decentralized control of finite state systems: a game theoretic approach
- Strategic dominance: a new preorder for nondeterministic processes
- Regular games with imperfect information are not that regular
- Symbolic control: unveiling free robustness margins
- Information-flow interfaces
- CONCUR test-of-time award for the period 1994--97 interview with Uwe Nestmann and Benjamin C. Pierce
- Subtyping context-free session types
- Alternating refinement relations for fuzzy concurrent game structures
- Memoryless concretization relation
- Composing model programs for analysis
- On timed alternating simulation for concurrent timed games
- Data-driven abstractions for control systems via random exploration
- The non-cooperative rational synthesis problem for SPEs and -regular objectives
- Test generation from state based use case models
- CEGAR for compositional analysis of qualitative properties in Markov decision processes
- Simulation distances
- Augmenting ATL with strategy contexts
- Deductive verification of alternating systems
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 Q5692280)
