Pages that link to "Item:Q3673090"

The following pages link to Synthesis of Communicating Processes from Temporal Logic Specifications (Q3673090):

Displaying 34 items.

• Synthesis of large dynamic concurrent programs from dynamic specifications (Q346790) (← links)
• Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
• Synthesis of Reactive(1) designs (Q439954) (← links)
• Synchronous counting and computational algorithm design (Q896024) (← links)
• Theoretical foundations of handling large substitution sets in temporal integrity monitoring (Q914364) (← links)
• Transformation of dynamic integrity constraints into transaction specifications (Q915441) (← links)
• Defining, analysing and implementing communication protocols using attribute grammars (Q919803) (← links)
• Specification and verification of database dynamics (Q1092680) (← links)
• A decision procedure for combinations of propositional temporal logic and other specialized theories (Q1097264) (← links)
• Complementing deterministic Büchi automata in polynomial time (Q1116702) (← links)
• Synthesis of communicating process skeletons from temporal-spatial logic specifications (Q1116944) (← links)
• The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565) (← links)
• Characterizing finite Kripke structures in propositional temporal logic (Q1123183) (← links)
• Factorisation of finite state machines under strong and observational equivalences (Q1176112) (← links)
• Control machines: A new model of parallelism for compositional specifications and their effective compilation (Q1177148) (← links)
• Resolution for some first-order modal systems (Q1178699) (← links)
• TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
• The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\) (Q1190479) (← links)
• On undecidability of propositional temporal logics on trace systems (Q1199555) (← links)
• Submodule construction as equation solving in CCS (Q1262748) (← links)
• Proving partial order properties (Q1322161) (← links)
• Fair Petri nets and structural induction for rings of processes (Q1346633) (← links)
• A temporal logic-based approach for the description of object behavior evolution (Q1353949) (← links)
• Supervisory control and reactive synthesis: a comparative introduction (Q1693819) (← links)
• Verification by augmented finitary abstraction (Q1854391) (← links)
• Inductive synthesis of recursive processes from logical properties (Q1854392) (← links)
• MetateM: An introduction (Q1904643) (← links)
• Reactive synthesis from interval temporal logic specifications (Q2062122) (← links)
• Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\) (Q2249659) (← links)
• Maintenance goals of agents in a dynamic environment: formulation and policy construction (Q2389664) (← links)
• From complementation to certification (Q2575735) (← links)
• Graph Games and Reactive Synthesis (Q3176385) (← links)
• Compositional Control Synthesis for Partially Observable Systems (Q3184691) (← links)
• Unifying models (Q5047155) (← links)