scientific article; zbMATH DE number 7311251

MaRDI QIDQ5151002zbMATH OpenFDO

Authors Andreas Morgenstern, Klaus Schneider

Publication date 16 February 2021

Full work available at URL http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF10.11

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Recommendations

• On using temporal logic for refinement and compositional verification of concurrent systems
• scientific article; zbMATH DE number 15894
• scientific article; zbMATH DE number 4081518
• scientific article; zbMATH DE number 4119598
• Combining linear-time temporal logic with constructiveness and paraconsistency
• Temporal logics for concurrent recursive programs: satisfiability and model checking
• Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
• scientific article; zbMATH DE number 176158
• Hybrid Systems: Computation and Control

Cited in

(11)

• Practical synthesis of reactive systems from LTL specifications via parity games
• Compositional construction of most general controllers
• LTL to deterministic Emerson-Lei automata
• Tools and Algorithms for the Construction and Analysis of Systems
• On the power of automata minimization in reactive synthesis
• Synthesizing robust systems
• Safraless Compositional Synthesis
• From LTL to Symbolically Represented Deterministic Automata
• Safraless LTL synthesis considering maximal realizability
• Open Implication
• Enhancing unsatisfiable cores for LTL with information on temporal relevance

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 Q5151002)