Fast and simple nested fixpoints
Information Processing Letters
Languages, automata, and logic
Handbook of formal languages, vol. 3
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Automata and Games for Synthesis
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Combining supervisor synthesis and model checking
ACM Transactions on Embedded Computing Systems (TECS)
A decidable class of problems for control under partial observation
Information Processing Letters
Modal logics for timed control
CONCUR 2005 - Concurrency Theory
Synthesis of distributed systems from knowledge-based specifications
CONCUR 2005 - Concurrency Theory
Games with winning conditions of high Borel complexity
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Ambiguous classes in µ-calculi hierarchies
Theoretical Computer Science - Foundations of software science and computation structures
Modal Specifications for the Control Theory of Discrete Event Systems
Discrete Event Dynamic Systems
Control of discrete-event systems with modular or distributed structure
Theoretical Computer Science
Residual for Component Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
A Temporal Logic of Robustness
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Approximately Bisimilar Symbolic Models for Incrementally Stable Switched Systems
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Approximately bisimilar symbolic models for nonlinear control systems
Automatica (Journal of IFAC)
Generation of concurrency control code using discrete-event systems theory
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Distributed synthesis for well-connected architectures
Formal Methods in System Design
Electronic Notes in Theoretical Computer Science (ENTCS)
Solving Parity Games in Practice
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
A Compositional Approach on Modal Specifications for Timed Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Synthesising Features by Games
Electronic Notes in Theoretical Computer Science (ENTCS)
A decidable class of problems for control under partial observation
Information Processing Letters
Ambiguous classes in the games µ-calculus hierarchy
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Admissibility in infinite games
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Controller/Orchestrator Synthesis via Filtration
Electronic Notes in Theoretical Computer Science (ENTCS)
Error-avoiding adaptors for black-box software components
Proceedings of the IEEE/ACM international conference on Automated software engineering
Extended computation tree logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Synthesis of switching controllers using approximately bisimilar multiscale abstractions
Proceedings of the 14th international conference on Hybrid systems: computation and control
Timed Modal Logics for Real-Time Systems
Journal of Logic, Language and Information
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Reasoning about transfinite sequences
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
On distributed program specification and synthesis in architectures with cycles
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Tree automata and discrete distributed games
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Brief paper: Controller synthesis for safety and reachability via approximate bisimulation
Automatica (Journal of IFAC)
Decompositional reasoning about the history of parallel processes
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Behavior based service composition
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
Modal event-clock specifications for timed component-based design
Science of Computer Programming
A cure for stuttering parity games
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
From qualitative to quantitative enforcement of security policy
MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security
A framework for automatic generation of security controller
Software Testing, Verification & Reliability
Fair Synthesis for Asynchronous Distributed Systems
ACM Transactions on Computational Logic (TOCL)
Branching-time logics with path relativisation
Journal of Computer and System Sciences
Hi-index | 0.01 |
The synthesis of controllers for discrete event systems, as introduced by Ramadge and Wonham, amounts to computing winning strategies in parity games. We show that in this framework it is possible to extend the specifications of the supervised systems as well as the constraints on the controllers by expressing them in the modal µ-calculus.In order to express unobservability constraints, we propose an extension of the modal µ-calculus in which one can specify whether an edge of a graph is a loop. This extended µ-calculus still has the interesting properties of the classical one. In particular it is equivalent to automata with loop testing. The problems such as emptiness testing and elimination of alternation are solvable for such automata.The method proposed in this paper to solve a control problem consists in transforming this problem into a problem of satisfiability of a µ-calculus formula so that the set of models of this formula is exactly the set of controllers that solve the problem. This transformation relies on a simple construction of the quotient of automata with loop testing by a deterministic transition system. This is enough to deal with centralized control problems. The solution of decentralized control problems uses a more involved construction of the quotient of two automata.This work extends the framework of Ramadge and Wonham in two directions. We consider infinite behaviours and arbitrary regular specifications, while the standard framework deals only with specifications on the set of finite paths of processes. We also allow dynamic changes of the sets of observable and controllable events.