On the public citation graph
Alternating refinement relations
0 signed · 284 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferredcites →https://doi.org/10.1007/3-540-49213-5_2openalex-snapshot
Alternating-time Temporal Logic
inferredcites →https://doi.org/10.1007/3-540-61474-5_84openalex-snapshot
Verification of fair transition systems
inferredcites →https://doi.org/10.1007/bf01784885openalex-snapshot
Modelling knowledge and action in distributed systems
inferredcites →https://doi.org/10.1007/bf03180566openalex-snapshot
Deciding bisimilarity is P -complete
inferredcites →https://doi.org/10.1016/0022-0000(81)90039-8openalex-snapshot
Number of quantifiers is better than number of tape cells
inferredcites →https://doi.org/10.1016/0022-0000(86)90026-7openalex-snapshot
Automata-theoretic techniques for modal logics of programs
inferredcites →https://doi.org/10.1016/0304-3975(87)90133-2openalex-snapshot
Alternating automata on infinite trees
inferredcites →https://doi.org/10.1016/0304-3975(94)00214-4openalex-snapshot
Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50024-xopenalex-snapshot
Operational and Algebraic Semantics of Concurrent Processes
inferredcites →https://doi.org/10.1109/sfcs.1995.492576openalex-snapshot
Computing simulations on finite and infinite graphs
inferredcites →https://doi.org/10.1109/sfcs.1997.646098openalex-snapshot
Alternating-time temporal logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rnc.3204openalex-snapshot
Symbolic models for time-varying time-delay systems via alternating approximate bisimulation
inferred← citeshttps://doi.org/10.1002/stvr.1498openalex-snapshot
Sound and mechanised compositional verification of input‐output conformance
inferred← citeshttps://doi.org/10.1002/stvr.427openalex-snapshot
Model‐based quality assurance of protocol documentation: tools and methodology
inferred← citeshttps://doi.org/10.1007/1-4020-4094-6_3openalex-snapshot
Comparing Semantics of Logics for Multi-Agent Systems
inferred← citeshttps://doi.org/10.1007/11513988_20openalex-snapshot
Formal Verification of Backward Compatibility of Microcode
inferred← citeshttps://doi.org/10.1007/11603009_21openalex-snapshot
Implementation of Timed Automata: An Issue of Semantics or Modeling?
inferred← citeshttps://doi.org/10.1007/11817949_33openalex-snapshot
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
inferred← citeshttps://doi.org/10.1007/11961536openalex-snapshot
Declarative Agent Languages and Technologies IV : 4th International Workshop, DALT 2006, Hakodate, Japan, May 8, 2006 : selected, revised and invited papers
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_15openalex-snapshot
State Space Reductions for Alternating Büchi Automata Quotienting by Simulation Equivalences
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_29openalex-snapshot
Secure Information Flow for Concurrent Processes
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_20openalex-snapshot
Total-Correctness Refinement for Sequential Reactive Systems
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_36openalex-snapshot
Symbolic Algorithms for Infinite-State Games
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_79openalex-snapshot
Discounting the Future in Systems Theory
inferred← citeshttps://doi.org/10.1007/3-540-45089-0_1openalex-snapshot
Automata for Specifying Component Interfaces
inferred← citeshttps://doi.org/10.1007/3-540-45089-0_5openalex-snapshot
Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata
inferred← citeshttps://doi.org/10.1007/3-540-45241-9_17openalex-snapshot
Constraint Database Models Characterizing Timed Bisimilarity
inferred← citeshttps://doi.org/10.1007/3-540-45314-8_11openalex-snapshot
On Use Cases and Their Relationships in the Unified Modelling Language
inferred← citeshttps://doi.org/10.1007/3-540-45448-9_8openalex-snapshot
Agents and Roles: Refinement in Alternating-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-45449-7_11openalex-snapshot
Interface Theories for Component-Based Design
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_13openalex-snapshot
Conformance Checking for Models of Asynchronous Message Passing Software
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_34openalex-snapshot
Synchronous and Bidirectional Component Interfaces
inferred← citeshttps://doi.org/10.1007/3-540-45873-5_23openalex-snapshot
Bisimulation Based Hierarchical System Architecture for Single-Agent Multi-modal Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-0287-8_6openalex-snapshot
Proving feature non-interaction with Alternating-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-29908-8_46openalex-snapshot
Game Equivalence and Bisimulation for Game Description Language
inferred← citeshttps://doi.org/10.1007/978-3-030-32409-4_9openalex-snapshot
Simulations for Multi-Agent Systems with Imperfect Information
inferred← citeshttps://doi.org/10.1007/978-3-030-34968-4_14openalex-snapshot
Relating Alternating Relations for Conformance and Refinement
inferred← citeshttps://doi.org/10.1007/978-3-030-44769-4_1openalex-snapshot
Testing Conformance in Multi-component Enterprise Application Management
inferred← citeshttps://doi.org/10.1007/978-3-030-45234-6_23openalex-snapshot
Combining Partial Specifications using Alternating Interface Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-63406-3_18openalex-snapshot
Accurate Abstractions for Controller Synthesis with Non-uniform Disturbances
inferred← citeshttps://doi.org/10.1007/978-3-030-99429-7_1openalex-snapshot
Information-flow Interfaces
inferred← citeshttps://doi.org/10.1007/978-3-031-22337-2_23openalex-snapshot
From Interface Automata to Hypercontracts
inferred← citeshttps://doi.org/10.1007/978-3-031-37709-9_17openalex-snapshot
Complete Multiparty Session Type Projection with Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-43264-4_20openalex-snapshot
Observational Preorders for Alternating Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-47115-5_2openalex-snapshot
Refinements for Open Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-72621-7_13openalex-snapshot
Robust Deterministic Abstractions for Supervising Discrete-Time Continuous Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-22817-8_12openalex-snapshot
An Intuitionistic Version of Computation Tree Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-07602-7_18openalex-snapshot
On the Complexity of Input Output Conformance Testing
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_31openalex-snapshot
CEGAR for Qualitative Analysis of Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_31openalex-snapshot
Symbolic Model Checking in Non-Boolean Domains
inferred← citeshttps://doi.org/10.1007/978-3-319-11439-2_8openalex-snapshot
Synthesising Succinct Strategies in Safety and Reachability Games
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_21openalex-snapshot
Symmetry Reduction in Infinite Games with Finite Branching
inferred← citeshttps://doi.org/10.1007/978-3-319-24644-4_15openalex-snapshot
A Pre-congruence Format for XY-simulation
inferred← citeshttps://doi.org/10.1007/978-3-319-57666-4_5openalex-snapshot
Compositionality, Decompositionality and Refinement in Input/Output Conformance Testing
inferred← citeshttps://doi.org/10.1007/978-3-319-63121-9_3openalex-snapshot
30 Years of Modal Transition Systems: Survey of Extensions and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-69483-2_2openalex-snapshot
Polynomial-Time Alternating Probabilistic Bisimulation for Interval MDPs
inferred← citeshttps://doi.org/10.1007/978-3-319-70848-5_11openalex-snapshot
A Refinement Relation for Families of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_26openalex-snapshot
Quantitative Analysis of Smart Contracts
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_30openalex-snapshot
Open Maps, Alternating Simulations and Control Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_10openalex-snapshot
On Complementing Nondeterministic Büchi Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_12openalex-snapshot
Game Models for Open Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_12openalex-snapshot
Abstract Interpretation of Game Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_7openalex-snapshot
Quantitative Verification and Control via the Mu-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-45212-6_15openalex-snapshot
Reasoning about Abstract Open Systems with Generalized Module Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-71316-6_6openalex-snapshot
Modal I/O Automata for Interface and Product Line Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_18openalex-snapshot
On the Expressiveness and Complexity of ATL
inferred← citeshttps://doi.org/10.1007/978-3-540-73770-4_8openalex-snapshot
Symbolic Execution Techniques for Refinement Testing
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_30openalex-snapshot
Timed Concurrent Game Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_8openalex-snapshot
On Modal Refinement and Consistency
inferred← citeshttps://doi.org/10.1007/978-3-540-75698-9_1openalex-snapshot
Finite Abstract Models for Deterministic Transition Systems: Fair Parallel Composition and Refinement-Preserving Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-78917-8_2openalex-snapshot
Model-Based Testing of Object-Oriented Reactive Systems with Spec Explorer
inferred← citeshttps://doi.org/10.1007/978-3-540-92687-0_7openalex-snapshot
ATL with Strategy Contexts and Bounded Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-00590-9_22openalex-snapshot
Abstract Processes in Orchestration Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-01665-3_58openalex-snapshot
Compatibility and Conformance of Role-Based Interaction Components in MAS
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_22openalex-snapshot
An Antichain Algorithm for LTL Realizability
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_21openalex-snapshot
Input-Output Model Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-04368-0_8openalex-snapshot
Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation
inferred← citeshttps://doi.org/10.1007/978-3-642-10373-5_35openalex-snapshot
A Compositional Approach on Modal Specifications for Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-11355-0_12openalex-snapshot
Correctness Properties for Multiagent Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_33openalex-snapshot
Symbolic Bounded Conformance Checking of Model Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_2openalex-snapshot
Antichain Algorithms for Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-13754-9_3openalex-snapshot
Quantitative Simulation Games
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_6openalex-snapshot
On Probabilistic Alternating Simulations
inferred← citeshttps://doi.org/10.1007/978-3-642-16561-0_28openalex-snapshot
Towards a Connector Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-16573-3_5openalex-snapshot
Alternating Simulation and IOCO
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_17openalex-snapshot
A Game Approach to Determinize Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_10openalex-snapshot
Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-20715-0_4openalex-snapshot
Commitment-Based Protocols with Behavioral Rules and Correctness Properties of MAS
inferred← citeshttps://doi.org/10.1007/978-3-642-24580-0_13openalex-snapshot
Compositional Random Testing Using Extended Symbolic Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_35openalex-snapshot
An Algorithm for Probabilistic Alternating Simulation
inferred← citeshttps://doi.org/10.1007/978-3-642-29320-7_7openalex-snapshot
Composing Real-Time Concurrent Objects Refinement, Compatibility and Schedulability
inferred← citeshttps://doi.org/10.1007/978-3-642-30793-5_13openalex-snapshot
Synchronous Interface Theories and Time Triggered Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_41openalex-snapshot
Secure Programming via Visibly Pushdown Safety Games
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_18openalex-snapshot
A Theory of History Dependent Abstractions for Learning Interface Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-32943-2_17openalex-snapshot
Ensuring Reachability by Design
inferred← citeshttps://doi.org/10.1007/978-3-642-32943-2_9openalex-snapshot
Modal Process Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-36249-1_1openalex-snapshot
Model Checking Adaptive Software with Featured Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_12openalex-snapshot
Synthesis from LTL Specifications with Mean-Payoff Objectives
inferred← citeshttps://doi.org/10.1007/978-3-642-37635-1_3openalex-snapshot
Quantitative Modal Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-38592-6_9openalex-snapshot
Input-Output Conformance Simulation (iocos) for Model Based Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-39176-7_22openalex-snapshot
Error-Completion in Interface Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-39718-9_13openalex-snapshot
On Refinements of Boolean and Parametric Modal Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-41071-0_12openalex-snapshot
A Refinement Framework for Autonomous Agents
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_39openalex-snapshot
Tight Game Abstractions of Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-981-96-0617-7_11openalex-snapshot
Deciding the Synthesis Problem for Hybrid Games Through Bisimulation
inferred← citeshttps://doi.org/10.1007/s00165-007-0045-4openalex-snapshot
Interface synthesis and protocol conversion
inferred← citeshttps://doi.org/10.1007/s00165-008-0075-6openalex-snapshot
Deductive verification of alternating systems
inferred← citeshttps://doi.org/10.1007/s00165-012-0258-zopenalex-snapshot
Test generation from state based use case models
inferred← citeshttps://doi.org/10.1007/s00165-016-0391-1openalex-snapshot
Refining autonomous agents with declarative beliefs and desires
inferred← citeshttps://doi.org/10.1007/s00236-012-0158-yopenalex-snapshot
On timed alternating simulation for concurrent timed games
inferred← citeshttps://doi.org/10.1007/s00236-015-0215-4openalex-snapshot
Refinement checking on parametric modal transition systems
inferred← citeshttps://doi.org/10.1007/s00450-014-0257-9openalex-snapshot
Automata-based refinement checking for real-time systems
inferred← citeshttps://doi.org/10.1007/s10009-011-0215-9openalex-snapshot
Alternating simulation and IOCO
inferred← citeshttps://doi.org/10.1007/s10009-012-0237-yopenalex-snapshot
Compositional verification of real-time systems using Ecdar
inferred← citeshttps://doi.org/10.1007/s10270-022-01002-3openalex-snapshot
Early timing analysis based on scenario requirements and platform models
inferred← citeshttps://doi.org/10.1007/s10458-013-9231-3openalex-snapshot
Comparing variants of strategic ability: how uncertainty and memory influence general properties of games
inferred← citeshttps://doi.org/10.1007/s10489-021-02658-yopenalex-snapshot
Rational verification: game-theoretic verification of multi-agent systems
inferred← citeshttps://doi.org/10.1007/s10703-011-0115-3openalex-snapshot
Antichains and compositional algorithms for LTL synthesis
inferred← citeshttps://doi.org/10.1007/s10703-013-0201-9openalex-snapshot
A modal characterization of alternating approximate bisimilarity
inferred← citeshttps://doi.org/10.1007/s10703-014-0220-1openalex-snapshot
A game approach to determinize timed automata
inferred← citeshttps://doi.org/10.1007/s10703-015-0235-2openalex-snapshot
CEGAR for compositional analysis of qualitative properties in Markov decision processes
inferred← citeshttps://doi.org/10.1007/s10703-017-0294-7openalex-snapshot
Conditions of contracts for separating responsibilities in heterogeneous systems
inferred← citeshttps://doi.org/10.1007/s10703-024-00447-0openalex-snapshot
Information-flow interfaces
inferred← citeshttps://doi.org/10.1007/s10849-022-09357-yopenalex-snapshot
A Logic for Conditional Local Strategic Reasoning
inferred← citeshttps://doi.org/10.1007/s11334-014-0238-yopenalex-snapshot
A formal framework for service mashups with dynamic service selection
inferred← citeshttps://doi.org/10.1007/s11704-014-4016-7openalex-snapshot
Generalized interface automata with multicast synchronization
inferred← citeshttps://doi.org/10.1007/s11761-022-00341-9openalex-snapshot
Compositional testing of management conformance for multi-component enterprise applications
inferred← citeshttps://doi.org/10.1007/s13218-010-0075-6openalex-snapshot
Reasoning about Time, Action and Knowledge in Multi-Agent Systems
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2019.03.010openalex-snapshot
Control of Cyber-Physical-Systems with logic specifications: A formal methods approach
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2024.100940openalex-snapshot
Formal synthesis of controllers for safety-critical autonomous systems: Developments and challenges
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103353openalex-snapshot
Automated temporal equilibrium analysis: Verification and synthesis of multi-player games
inferred← citeshttps://doi.org/10.1016/j.automatica.2017.04.060openalex-snapshot
Symbolic control design for monotone systems with directed specifications
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.109768openalex-snapshot
Formal controller synthesis from specifications given by discrete-time hybrid automata
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.01.002openalex-snapshot
XRT– Exploring Runtime for .NET Architecture and Applications
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.02.033openalex-snapshot
A Contract-based Approach to Specifying and Verifying Safety Critical Systems
inferred← citeshttps://doi.org/10.1016/j.ic.2014.12.020openalex-snapshot
Augmenting ATL with strategy contexts
inferred← citeshttps://doi.org/10.1016/j.ic.2016.10.006openalex-snapshot
Quantitative fair simulation games
inferred← citeshttps://doi.org/10.1016/j.ic.2016.10.013openalex-snapshot
Refining strategic ability in alternating-time temporal logic
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104552openalex-snapshot
Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104819openalex-snapshot
The refinement calculus of reactive systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.11.183openalex-snapshot
Observer-based Similarity Output Feedback Control of Cyber-Physical Systems**This work was supported by JSPS KAKENHI No. 15K14007.
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.08.484openalex-snapshot
Simulation Relations for Abstraction-based Robust Control of Hybrid Dynamical Systems
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.05.002openalex-snapshot
A survey of stochastic ω-regular games
inferred← citeshttps://doi.org/10.1016/j.jss.2013.02.061openalex-snapshot
An orchestrated survey of methodologies for automated software test case generation
inferred← citeshttps://doi.org/10.1016/j.nahs.2016.02.002openalex-snapshot
Finite abstractions with robustness margins for temporal logic-based control synthesis
inferred← citeshttps://doi.org/10.1016/j.nahs.2018.04.001openalex-snapshot
Deadlock-free output feedback controller design based on approximately abstracted observers
inferred← citeshttps://doi.org/10.1016/j.scico.2011.01.007openalex-snapshot
Modal event-clock specifications for timed component-based design
inferred← citeshttps://doi.org/10.1016/j.scico.2015.06.004openalex-snapshot
A tag contract framework for modeling heterogeneous systems
inferred← citeshttps://doi.org/10.1016/j.scico.2015.09.004openalex-snapshot
Finding available services in TOSCA-compliant clouds
inferred← citeshttps://doi.org/10.1016/j.scico.2018.09.008openalex-snapshot
Unifying modal interface theories and compositional input/output conformance testing
inferred← citeshttps://doi.org/10.1016/j.sysconle.2007.11.005openalex-snapshot
Controller synthesis for bisimulation equivalence
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.01.016openalex-snapshot
Simulation relations for alternating Büchi automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.036openalex-snapshot
Specifications for decidable hybrid games
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.07.031openalex-snapshot
A game-theoretic approach to fault diagnosis and identification of hybrid systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.08.019openalex-snapshot
Interface simulation distances
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.047openalex-snapshot
Error-pruning in interface automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.06.004openalex-snapshot
Synthesising succinct strategies in safety games with an application to real-time scheduling
inferred← citeshttps://doi.org/10.1023/b:synt.0000024915.66183.d1openalex-snapshot
Comparing Semantics of Logics for Multi-Agent Systems
inferred← citeshttps://doi.org/10.1080/00207179.2012.686672openalex-snapshot
Symbolic models for nonlinear control systems affected by disturbances
inferred← citeshttps://doi.org/10.1093/jigpal/jzp009openalex-snapshot
Logics for Qualitative Coalitional Games
inferred← citeshttps://doi.org/10.1093/logcom/exac034openalex-snapshot
Game equivalence and expressive power of game description languages: a bisimulation approach
inferred← citeshttps://doi.org/10.1093/logcom/exp039openalex-snapshot
Verification of Games in the Game Description Language
inferred← citeshttps://doi.org/10.1109/acc.2016.7526478openalex-snapshot
Optimal control with regular objectives using an abstraction-refinement approach
inferred← citeshttps://doi.org/10.1109/access.2024.3374329openalex-snapshot
Abstraction-Based Safe Control With Alternating Simulation-Based Shields and Its Application to Mobile Robots
inferred← citeshttps://doi.org/10.1109/acsd.2006.32openalex-snapshot
Synthesis of Synchronous Interfaces
inferred← citeshttps://doi.org/10.1109/acsd.2009.22openalex-snapshot
Why Are Modalities Good for Interface Theories?
inferred← citeshttps://doi.org/10.1109/acsd.2015.19openalex-snapshot
When Do We (Not) Need Complex Assume-Guarantee Rules?
inferred← citeshttps://doi.org/10.1109/acsd.2017.9openalex-snapshot
A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks
inferred← citeshttps://doi.org/10.1109/cdc.2007.4434957openalex-snapshot
Symbolic models for linear control systems with disturbances
inferred← citeshttps://doi.org/10.1109/cdc.2008.4738788openalex-snapshot
Symbolic models for nonlinear control systems affected by disturbances
inferred← citeshttps://doi.org/10.1109/cdc.2010.5717258openalex-snapshot
Alternating approximately bisimilar symbolic models for nonlinear control systems with unknown time-varying delays
inferred← citeshttps://doi.org/10.1109/cdc.2011.6161338openalex-snapshot
Alternating approximately bisimilar symbolic models for nonlinear control systems affected by disturbances
inferred← citeshttps://doi.org/10.1109/cdc.2016.7799149openalex-snapshot
Symbolic control of systems with dead times using symbolic smith predictors
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9029932openalex-snapshot
Abstraction-Based Synthesis of Opacity-Enforcing Controllers using Alternating Simulation Relations
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9030141openalex-snapshot
Incremental Abstraction Computation for Symbolic Controller Synthesis in a Changing Environment
inferred← citeshttps://doi.org/10.1109/cdc42340.2020.9304184openalex-snapshot
Construction of continuous abstractions for discrete-time time-delay systems
inferred← citeshttps://doi.org/10.1109/cdc42340.2020.9304293openalex-snapshot
A symbolic approach to distributed control of interconnected systems
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9683448openalex-snapshot
Alternating Simulation on Hierarchical Abstractions
inferred← citeshttps://doi.org/10.1109/compsac.2010.52openalex-snapshot
A Game Perspective of Refinement of Component Models
inferred← citeshttps://doi.org/10.1109/compsac.2017.118openalex-snapshot
Enforcing Generalized Refinement-Based Noninterference for Secure Interface Composition
inferred← citeshttps://doi.org/10.1109/fdl53530.2021.9568383openalex-snapshot
Debugging and Verification Tools for Lingua Franca in Gemoc Studio
inferred← citeshttps://doi.org/10.1109/fmcad.2006.22openalex-snapshot
Optimizations for LTL Synthesis
inferred← citeshttps://doi.org/10.1109/fmcad.2013.7035519openalex-snapshot
Secure programs via game-based synthesis
inferred← citeshttps://doi.org/10.1109/iccps.2011.25openalex-snapshot
Sandboxing Controllers for Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1109/icra.2014.6907643openalex-snapshot
Switching control of dynamical systems from metric temporal logic specifications
inferred← citeshttps://doi.org/10.1109/icse.2013.6606546openalex-snapshot
Automatic synthesis of modular connectors via composition of protocol mediation patterns
inferred← citeshttps://doi.org/10.1109/lics.2004.1319611openalex-snapshot
Three-valued abstractions of games: uncertainty, but with precision
inferred← citeshttps://doi.org/10.1109/lics.2004.1319628openalex-snapshot
The existence of finite abstractions for branching time model checking
inferred← citeshttps://doi.org/10.1109/lics.2004.42openalex-snapshot
The existence of finite abstractions for branching time model checking
inferred← citeshttps://doi.org/10.1109/lics.2006.10openalex-snapshot
An Abstraction-Refinement Framework for Multi-Agent Systems
inferred← citeshttps://doi.org/10.1109/lics.2015.20openalex-snapshot
Game Semantics for Type Soundness
inferred← citeshttps://doi.org/10.1109/qest.2007.15openalex-snapshot
Qualitative Logics and Equivalences for Probabilistic Systems
inferred← citeshttps://doi.org/10.1109/qsic.2005.10openalex-snapshot
Action Machines - Towards a Framework for Model Composition, Exploration and Conformance Testing Based on Symbolic Computation
inferred← citeshttps://doi.org/10.1109/seaa.2012.68openalex-snapshot
A Property-Based Proof System for Contract-Based Design
showing the first 200 of 271 · page through all 271
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.