scientific article; zbMATH DE number 3328724
From MaRDI portal
Publication:5606989
Cited in
(21)- A symbolic algorithm for lazy synthesis of eager strategies
- High-level representation of benchmark families for Petri games
- Matching regular expressions on uncertain data
- Canonical representations for direct generation of strategies in high-level Petri games
- Timed Petri nets with reset for pipelined synchronous circuit design
- Computability and realizability for interactive computations
- Transfer of model checking to industrial practice
- On the relation between reactive synthesis and supervisory control of non-terminating processes
- From Logic to Theoretical Computer Science – An Update
- Reactive synthesis from interval temporal logic specifications
- scientific article; zbMATH DE number 7204449 (Why is no real title available?)
- scientific article; zbMATH DE number 7147442 (Why is no real title available?)
- Algorithms: From Al-Khwarizmi to Turing and Beyond
- The mu-calculus and Model Checking
- Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
- Synthesis of deterministic top-down tree transducers from automatic tree relations
- Synthesis in presence of dynamic links
- Church’s Problem and a Tour through Automata Theory
- Solving high-level Petri games
- The synthesis problem for repeatedly communicating Petri games
- From Monadic Logic to PSL
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 Q5606989)
