scientific article; zbMATH DE number 7311251

zbMATH Open1456.68099MaRDI QIDQ5151002FDOQ5151002

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

Title of this publication is not available (Why is that?)

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

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)

Cited In (11)

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

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)