On the public citation graph
Realizable and unrealizable specifications of reactive systems
0 signed · 254 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.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_29openalex-snapshot
Solving Sequential Conditions by Finite-State Strategies
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_17openalex-snapshot
On the Development of Reactive Systems
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_4openalex-snapshot
Notes on Communicating Sequential Systems
inferredcites →https://doi.org/10.1007/bfb0027046openalex-snapshot
Process theory: Semantics, specification and verification
inferredcites →https://doi.org/10.1007/bfb0035790openalex-snapshot
On the synthesis of an asynchronous reactive module
inferredcites →https://doi.org/10.1016/0003-4843(71)90018-0openalex-snapshot
Higher set theory and mathematical practice
inferredcites →https://doi.org/10.1016/0016-0032(60)90366-5openalex-snapshot
Contributions to the theory of games.
inferredcites →https://doi.org/10.1016/0022-0000(84)90023-0openalex-snapshot
A complete inference system for a class of regular behaviours
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/0167-6423(83)90017-5openalex-snapshot
Using branching time temporal logic to synthesize synchronization skeletons
inferredcites →https://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot
The temporal semantics of concurrent programs
inferredcites →https://doi.org/10.1016/0304-3975(87)90008-9openalex-snapshot
The complementation problem for Büchi automata with applications to temporal logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)71121-2openalex-snapshot
Descriptive Set Theory: Projective Sets
inferredcites →https://doi.org/10.1090/s0002-9904-1968-12122-6openalex-snapshot
Decidability of second-order theories and automata on infinite trees
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0280205-0openalex-snapshot
Solving sequential conditions by finite-state strategies
inferredcites →https://doi.org/10.1109/lics.1988.5115openalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1109/sfcs.1983.51openalex-snapshot
Reasoning about infinite computation paths
inferredcites →https://doi.org/10.1109/sfcs.1988.21948openalex-snapshot
On the complexity of omega -automata
inferredcites →https://doi.org/10.1109/sfcs.1988.21949openalex-snapshot
The complexity of tree automata and logics of programs
inferredcites →https://doi.org/10.1109/swat.1972.28openalex-snapshot
The emptiness problem for automata on infinite trees
inferredcites →https://doi.org/10.1145/357233.357237openalex-snapshot
Synthesis of Communicating Processes from Temporal Logic Specifications
inferredcites →https://doi.org/10.1145/75277.75293openalex-snapshot
On the synthesis of a reactive module
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.1515/9781400882014-008openalex-snapshot
7. Infinite Games of Perfect Information
inferredcites →https://doi.org/10.21236/ada156190openalex-snapshot
Specifying and Verifying Concurrent Programs.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1999.2820openalex-snapshot
Contracts, Games and Refinement
inferred← citeshttps://doi.org/10.1007/11874683_19openalex-snapshot
Algorithms for Omega-Regular Games with Imperfect Information
inferred← citeshttps://doi.org/10.1007/11901914_20openalex-snapshot
Synthesis for Probabilistic Environments
inferred← citeshttps://doi.org/10.1007/11944836_21openalex-snapshot
Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
inferred← citeshttps://doi.org/10.1007/11944836_30openalex-snapshot
Distributed Synthesis for Well-Connected Architectures
inferred← citeshttps://doi.org/10.1007/3-540-36126-x_23openalex-snapshot
Smart Play-out of Behavioral Requirements
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_14openalex-snapshot
Generalized Model Checking: Reasoning about Partial State Spaces
inferred← citeshttps://doi.org/10.1007/3-540-44674-5_1openalex-snapshot
Synthesizing State-Based Object Systems from LSC Specifications
inferred← citeshttps://doi.org/10.1007/3-540-45089-0_18openalex-snapshot
Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_55openalex-snapshot
Synthesis of Uninitialized Systems
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-45694-5_11openalex-snapshot
A Decidable Class of Asynchronous Distributed Controllers
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_7openalex-snapshot
Automata-Theoretic Decision of Timed Games
inferred← citeshttps://doi.org/10.1007/3-540-48118-4_27openalex-snapshot
Reasoning about interactive systems
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_33openalex-snapshot
Distributed Controller Synthesis for Local Specifications
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_2openalex-snapshot
Alternating-time Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-53932-8_44openalex-snapshot
Using the temporal logic RDL for design specifications
inferred← citeshttps://doi.org/10.1007/3-540-55676-1_2openalex-snapshot
Combining Petri Nets and other formal methods
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_92openalex-snapshot
System specification and refinement in temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_184openalex-snapshot
Derivation of the input conditional formula from a reactive system specification in temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_121openalex-snapshot
Finite-state strategies in regular infinite games
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_57openalex-snapshot
On the synthesis of strategies in infinite games
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_76openalex-snapshot
On the synthesis of discrete controllers for timed systems
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_49openalex-snapshot
Local liveness for compositional modeling of fair reactive systems
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_54openalex-snapshot
On polynomial-size programs winning finite-state games
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_56openalex-snapshot
An automata-theoretic approach to fair realizability and synthesis
inferred← citeshttps://doi.org/10.1007/3-540-60472-3_1openalex-snapshot
Symbolic controller synthesis for discrete and timed systems
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_6openalex-snapshot
An automata-theoretic approach to linear temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-61042-1_46openalex-snapshot
Strategy construction in infinite games with Streett and Rabin chain winning conditions
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_49openalex-snapshot
Effective strategies for enumeration games
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_46openalex-snapshot
Dynamic scheduling in the presence of faults: Specification and verification
inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_2openalex-snapshot
Enforcing behavior with contracts
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_8openalex-snapshot
Synchronous Observers and the Verification of Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_10openalex-snapshot
The Ecology of Class Refinement
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_21openalex-snapshot
Distributed Concurrent Programs as Strategies in Games
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_17openalex-snapshot
Concurrent Programs as Strategies in Games
inferred← citeshttps://doi.org/10.1007/978-1-4614-3363-7_13openalex-snapshot
Developing Embedded Systems from Formal Specifications Written in Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_12openalex-snapshot
Formal Methods for Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-030-30281-8_7openalex-snapshot
Strategy Representation by Decision Trees with Linear Classifiers
inferred← citeshttps://doi.org/10.1007/978-3-031-17146-8_11openalex-snapshot
Real-Time Policy Enforcement with Metric First-Order Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-19992-9_21openalex-snapshot
STOMPC: Stochastic Model-Predictive Control with Uppaal Stratego
inferred← citeshttps://doi.org/10.1007/978-3-031-30820-8_20openalex-snapshot
LTL Reactive Synthesis with a Few Hints
inferred← citeshttps://doi.org/10.1007/978-3-031-56222-8_3openalex-snapshot
SynthLearn: A Tool for Guided Reactive Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-65630-9_8openalex-snapshot
Proactive Real-Time First-Order Enforcement
inferred← citeshttps://doi.org/10.1007/978-3-031-90653-4_9openalex-snapshot
Synthesis of Universal Safety Controllers
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_27openalex-snapshot
Graph Games and Reactive Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-11629-7_6openalex-snapshot
Complexity of Checking Strong Satisfiability of Reactive System Specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-11737-9_24openalex-snapshot
Fast Translation from LTL to Büchi Automata via Non-transition-based Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-11764-5_17openalex-snapshot
On the Synthesis of Mobile Robots Algorithms: The Case of Ring Gathering
inferred← citeshttps://doi.org/10.1007/978-3-319-21410-8_51openalex-snapshot
Extracting Environmental Constraints in Reactive System Specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-21410-8_52openalex-snapshot
Implementation of Decision Procedure of Stepwise Satisfiability of Reactive System Specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-24537-9_13openalex-snapshot
Reducing Bounded Realizability Analysis to Reachability Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-26129-4_10openalex-snapshot
Formulation of Homeostasis by Realisability on Linear Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-54430-4_11openalex-snapshot
The Relation Between Syntax Restriction of Temporal Logic and Properties of Reactive System Specification
inferred← citeshttps://doi.org/10.1007/978-3-319-63121-9_12openalex-snapshot
Synchronous Interfaces and Assume/Guarantee Contracts
inferred← citeshttps://doi.org/10.1007/978-3-319-89960-2_21openalex-snapshot
Strategy Representation by Decision Trees in Reactive Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-94806-5_11openalex-snapshot
Compositional Analysis of Homeostasis of Gene Networks by Clustering Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_34openalex-snapshot
Composability of Infinite-State Activity Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_23openalex-snapshot
The Complexity of Live Sequence Charts
inferred← citeshttps://doi.org/10.1007/978-3-540-37621-7_8openalex-snapshot
Decision Procedures for Several Properties of Reactive System Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_8openalex-snapshot
Playing Games with Boxes and Diamonds
inferred← citeshttps://doi.org/10.1007/978-3-540-72912-9_3openalex-snapshot
Analyzing Conversations: Realizability, Synchronizability, and Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_20openalex-snapshot
Distributed Synthesis for Alternating-Time Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-78163-9_9openalex-snapshot
Diagnostic Information for Realizability
inferred← citeshttps://doi.org/10.1007/978-3-642-00431-5_8openalex-snapshot
Model Checking Driven Heuristic Search for Correct Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-00593-0_6openalex-snapshot
Controller Synthesis from LSC Requirements
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_9openalex-snapshot
Compositional Synthesis of Reactive Systems from Live Sequence Chart Specifications
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-03816-7_27openalex-snapshot
Admissible Strategies in Infinite Games over Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_7openalex-snapshot
Towards a Notion of Unsatisfiable Cores for LTL
inferred← citeshttps://doi.org/10.1007/978-3-642-15643-4_10openalex-snapshot
Compositional Algorithms for LTL Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_18openalex-snapshot
Synthesis of Trigger Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-21455-4_4openalex-snapshot
Modeling and Verification of Components and Connectors
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_34openalex-snapshot
A Compositional Framework for Controller Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_8openalex-snapshot
Recent Challenges and Ideas in Temporal Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_18openalex-snapshot
Robustness of Structurally Equivalent Concurrent Parity Games
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_45openalex-snapshot
Acacia+, a Tool for LTL Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-34188-5_5openalex-snapshot
Synthesis with Clairvoyance
inferred← citeshttps://doi.org/10.1007/978-3-642-34281-3_21openalex-snapshot
Stepwise Satisfiability Checking Procedure for Reactive System Specifications by Tableau Method and Proof System
inferred← citeshttps://doi.org/10.1007/978-3-642-36818-9_7openalex-snapshot
SAT–Based Bounded Strong Satisfiability Checking of Reactive System Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_6openalex-snapshot
Detecting Unrealizable Specifications of Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-44485-6_10openalex-snapshot
Formal Analysis of Gene Networks Using Network Motifs
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_12openalex-snapshot
Synthesis from Component Libraries with Costs
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_37openalex-snapshot
Qualitative Concurrent Parity Games: Bounded Rationality
inferred← citeshttps://doi.org/10.1007/978-94-015-9586-5_6openalex-snapshot
Synthesis with Incomplete Informatio
inferred← citeshttps://doi.org/10.1007/bf01439153openalex-snapshot
On control of systems modelled as deterministic Rabin automata
inferred← citeshttps://doi.org/10.1007/bfb0000478openalex-snapshot
On bisimulation, fault-monotonicity and provable fault-tolerance
inferred← citeshttps://doi.org/10.1007/bfb0017489openalex-snapshot
On projective and separable properties
inferred← citeshttps://doi.org/10.1007/bfb0023741openalex-snapshot
Synthesizing processes and schedulers from temporal specifications
inferred← citeshttps://doi.org/10.1007/bfb0023782openalex-snapshot
Control of ω-automata, Church's problem, and the emptiness problem for tree ω-automata
inferred← citeshttps://doi.org/10.1007/bfb0032043openalex-snapshot
Markov decision processes and regular events
inferred← citeshttps://doi.org/10.1007/bfb0055614openalex-snapshot
Synthesis from knowledge-based specifications
inferred← citeshttps://doi.org/10.1007/s00165-015-0348-9openalex-snapshot
Analysing sanity of requirements for avionics systems
inferred← citeshttps://doi.org/10.1007/s00236-015-0239-9openalex-snapshot
Compositional construction of most general controllers
inferred← citeshttps://doi.org/10.1007/s00236-016-0280-3openalex-snapshot
Safraless LTL synthesis considering maximal realizability
inferred← citeshttps://doi.org/10.1007/s00766-013-0169-4openalex-snapshot
Features meet scenarios: modeling and consistency-checking scenario-based product line specifications
inferred← citeshttps://doi.org/10.1007/s10009-012-0222-5openalex-snapshot
Exploiting structure in LTL synthesis
inferred← citeshttps://doi.org/10.1007/s10270-011-0216-xopenalex-snapshot
On the realizability of collaborative services
inferred← citeshttps://doi.org/10.1007/s10559-014-9637-1openalex-snapshot
Using the Compatibility Analysis of Logical Specifications of Automata to Solve Game Problems
inferred← citeshttps://doi.org/10.1007/s10559-015-9759-0openalex-snapshot
Harmonization of Interacting Automata
inferred← citeshttps://doi.org/10.1007/s10559-017-9953-3openalex-snapshot
Some Subsets of Monadic First-Order Logic (MFO) Used for the Specification and Synthesis of Σ-Automata
inferred← citeshttps://doi.org/10.1007/s10559-017-9969-8openalex-snapshot
Problems of Synthesis of Σ-Automata Specified in Languages LP and LF of First Order Logic
inferred← citeshttps://doi.org/10.1007/s10626-015-0223-0openalex-snapshot
Supervisory control and reactive synthesis: a comparative introduction
inferred← citeshttps://doi.org/10.1007/s10703-008-0064-7openalex-snapshot
Distributed synthesis for well-connected architectures
inferred← citeshttps://doi.org/10.1007/s10703-011-0115-3openalex-snapshot
Antichains and compositional algorithms for LTL synthesis
inferred← citeshttps://doi.org/10.1007/s10817-025-09737-6openalex-snapshot
LTL Reactive Synthesis with a Few Hints
inferred← citeshttps://doi.org/10.1007/s12530-013-9098-1openalex-snapshot
Self-* programming: run-time parallel control search for reflection box
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00206-eopenalex-snapshot
Games and winning strategies
inferred← citeshttps://doi.org/10.1016/0164-1212(96)00021-0openalex-snapshot
Compositional adjustment of concurrent programs to satisfy temporal logic constraints in MENDELS ZONE
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00084-vopenalex-snapshot
On Gabbay's temporal fixed point operator
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00117-2openalex-snapshot
Computable concurrent processes
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90054-6openalex-snapshot
A model of concurrency with fair merge and full recursion
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferred← citeshttps://doi.org/10.1016/j.artint.2008.03.005openalex-snapshot
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
inferred← citeshttps://doi.org/10.1016/j.artint.2012.12.001openalex-snapshot
Automatic behavior composition synthesis
inferred← citeshttps://doi.org/10.1016/j.ic.2014.12.019openalex-snapshot
Computability and realizability for interactive computations
inferred← citeshttps://doi.org/10.1016/j.ic.2015.03.001openalex-snapshot
The complexity of multi-mean-payoff and multi-energy games
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.11.198openalex-snapshot
Controller Synthesis for Mode-Target Games
inferred← citeshttps://doi.org/10.1016/j.jal.2005.12.013openalex-snapshot
The computational complexity of scenario-based agent verification and design
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.jcss.2011.08.007openalex-snapshot
Synthesis of Reactive(1) designs
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.08.008openalex-snapshot
Synthesis from scenario-based specifications
inferred← citeshttps://doi.org/10.1016/j.scico.2010.11.004openalex-snapshot
Towards a notion of unsatisfiable and unrealizable cores for LTL
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.004openalex-snapshot
Conversation protocols: a formalism for specification and verification of reactive electronic services
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.06.009openalex-snapshot
On composition and lookahead delegation of e -services modeled by automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.08.021openalex-snapshot
Automata-theoretic decision of timed games
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.017openalex-snapshot
Qualitative analysis of gene regulatory networks by temporal logic
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00031-3openalex-snapshot
Planning control rules for reactive agents
inferred← citeshttps://doi.org/10.1016/s0164-1212(01)00083-8openalex-snapshot
Designing reactive systems: integration of abstraction techniques into a synthesis procedure
inferred← citeshttps://doi.org/10.1023/a:1026107209351openalex-snapshot
Guarded Quantification in Least Fixed Point Logic
inferred← citeshttps://doi.org/10.1023/a:1026537232278openalex-snapshot
Dynamic Scheduling and Fault-Tolerance: Specification and Verification
inferred← citeshttps://doi.org/10.1063/1.5033715openalex-snapshot
Efficiency of the strong satisfiability checking procedure for reactive system specifications
inferred← citeshttps://doi.org/10.1109/9.720497openalex-snapshot
Markov decision processes and regular events
inferred← citeshttps://doi.org/10.1109/9.728871openalex-snapshot
A method for the synthesis of controllers to handle safety, liveness, and real-time constraints
inferred← citeshttps://doi.org/10.1109/acc.2016.7525009openalex-snapshot
Symbolic construction of GR(1) contracts for systems with full information
inferred← citeshttps://doi.org/10.1109/apsec.2009.70openalex-snapshot
Extracting Environmental Constraints to Make Reactive System Specifications Realizable
inferred← citeshttps://doi.org/10.1109/bibe.2010.45openalex-snapshot
Qualitative Analysis of Gene Regulatory Networks by Satisfiability Checking of Linear Temporal Logic
inferred← citeshttps://doi.org/10.1109/csd.2003.1207698openalex-snapshot
Synthesis of open reactive systems from scenario-based specifications
inferred← citeshttps://doi.org/10.1109/hicss.1995.375522openalex-snapshot
Compositional adjustment of concurrent programs to satisfy temporal logic constraints in MENDELS ZONE
inferred← citeshttps://doi.org/10.1109/icse.2013.6606605openalex-snapshot
Requirements modelling by synthesis of deontic input-output automata
inferred← citeshttps://doi.org/10.1109/icse55347.2025.00031openalex-snapshot
Unavoidable Boundary Conditions: a Control Perspective on Goal Conflicts
inferred← citeshttps://doi.org/10.1109/ispse.2000.913222openalex-snapshot
Program synthesis for stepwise satisfiable specification of reactive system
inferred← citeshttps://doi.org/10.1109/jproc.2018.2834926openalex-snapshot
Layering Assume-Guarantee Contracts for Hierarchical System Design
inferred← citeshttps://doi.org/10.1109/lics.1997.614939openalex-snapshot
How much memory is needed to win infinite games?
inferred← citeshttps://doi.org/10.1109/lics.2001.932505openalex-snapshot
Deterministic generators and games for LTL fragments
inferred← citeshttps://doi.org/10.1109/lics.2012.28openalex-snapshot
Partial-Observation Stochastic Games: How to Win When Belief Fails
inferred← citeshttps://doi.org/10.1109/models.2017.35openalex-snapshot
Symbolic Execution for Realizability-Checking of Scenario-Based Specifications
inferred← citeshttps://doi.org/10.1109/pmmp.1993.315559openalex-snapshot
Formal methods for concurrent systems design: a survey
inferred← citeshttps://doi.org/10.1109/real.1992.242655openalex-snapshot
The input-output control of real-time discrete event systems
inferred← citeshttps://doi.org/10.1109/real.1993.393490openalex-snapshot
Really visual temporal reasoning
inferred← citeshttps://doi.org/10.1109/saso.2008.48openalex-snapshot
Self-* Programming: Run-Time Parallel Control Search for Reflection Box
inferred← citeshttps://doi.org/10.1109/seams59076.2023.00012openalex-snapshot
Adapting Specifications for Reactive Controllers
inferred← citeshttps://doi.org/10.1109/sefm.2004.1347501openalex-snapshot
Finding the causes of unrealizability of reactive system formal specifications
inferred← citeshttps://doi.org/10.1109/sefm.2004.17openalex-snapshot
Finding the causes of unrealizability of reactive system formal specifications
inferred← citeshttps://doi.org/10.1109/smc.2015.33openalex-snapshot
Behavior Composition Meets Supervisory Control
inferred← citeshttps://doi.org/10.1109/synasc.2018.00031openalex-snapshot
Experimental Evaluation of Acacia-K: A Tool for Synthesis of Reactive Systems from KLTL+ Specifications
inferred← citeshttps://doi.org/10.1109/tse.2005.137openalex-snapshot
From live sequence charts to state machines and back: a guided tour
inferred← citeshttps://doi.org/10.1109/tse.2005.141openalex-snapshot
Synchronizability of conversations among Web services
inferred← citeshttps://doi.org/10.1137/s0363012991217536openalex-snapshot
Control of Infinite Behavior of Finite Automata
inferred← citeshttps://doi.org/10.1145/1007568.1007722openalex-snapshot
Tools for design of composite Web services
inferred← citeshttps://doi.org/10.1145/1035167.1035203openalex-snapshot
Automated composition of e-services
inferred← citeshttps://doi.org/10.1145/1514894.1514896openalex-snapshot
Automatic verification of database-driven systems
inferred← citeshttps://doi.org/10.1145/1572272.1572275openalex-snapshot
Analyzing singularity channel contracts
inferred← citeshttps://doi.org/10.1145/1970398.1970404openalex-snapshot
Qualitative concurrent parity games
inferred← citeshttps://doi.org/10.1145/2095654.2095662openalex-snapshot
Analyzing realizability of choreographies using initiating and responding flows
inferred← citeshttps://doi.org/10.1145/2220357.2220360openalex-snapshot
Defining Fairness in Reactive and Concurrent Systems
inferred← citeshttps://doi.org/10.1145/2491411.2491445openalex-snapshot
Incrementally synthesizing controllers from scenario-based product line specifications
inferred← citeshttps://doi.org/10.1145/2642937.2642968openalex-snapshot
Minimal strongly unsatisfiable subsets of reactive system specifications
inferred← citeshttps://doi.org/10.1145/270580.270582openalex-snapshot
Semantics and verification of action diagrams with linear timing
inferred← citeshttps://doi.org/10.1145/276698.276748openalex-snapshot
Weak alternating automata and tree automata emptiness
inferred← citeshttps://doi.org/10.1145/2897667.2897672openalex-snapshot
Simple synthesis of reactive systems with tolerance for unexpected environmental behavior
inferred← citeshttps://doi.org/10.1145/3056662.3056702openalex-snapshot
Modularization of formal specifications or efficient synthesis of reactive systems
inferred← citeshttps://doi.org/10.1145/3127041.3127046openalex-snapshot
Extraction of missing formal assumptions in under-constrained designs
inferred← citeshttps://doi.org/10.1145/3288759openalex-snapshot
Mining Missing Assumptions from Counter-Examples
inferred← citeshttps://doi.org/10.1145/3316615.3316634openalex-snapshot
Towards Efficient Implementation of Realizability Checking for Reactive System Specifications
inferred← citeshttps://doi.org/10.1145/3610579openalex-snapshot
Proceedings of the 21st ACM-IEEE International Conference on Formal Methods and Models for System Design
inferred← citeshttps://doi.org/10.1145/3610579.3611089openalex-snapshot
Constraint-Behavior Contracts: A Formalism for Specifying Physical Systems
inferred← citeshttps://doi.org/10.1145/581339.581353openalex-snapshot
Agent-based tactics for goal-oriented requirements elaboration
inferred← citeshttps://doi.org/10.1145/585265.585270openalex-snapshot
Alternating-time temporal logic
inferred← citeshttps://doi.org/10.1145/602461.602501openalex-snapshot
Evolution mechanism of reactive system programs
inferred← citeshttps://doi.org/10.1145/963927.963928openalex-snapshot
Deterministic generators and games for Ltl fragments
inferred← citeshttps://doi.org/10.1201/9780429261350-4openalex-snapshot
A characterization on necessary conditions of realizability for reactive system specifications
inferred← citeshttps://doi.org/10.15479/at:ist-2011-0008openalex-snapshot
Bounded Rationality in Concurrent Parity Games
showing the first 200 of 222 · page through all 222
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.