scientific article
From MaRDI portal
Publication:3948585
zbMath0487.68027MaRDI QIDQ3948585
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
concurrent programsfinite model propertyprogram synthesisdecision procedurecommunicating sequential processespropositional temporal logicsynchronization part
Other nonclassical logic (03B60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)
Related Items
The complementation problem for Büchi automata with applications to temporal logic ⋮ Introduction to Model Checking ⋮ A decision procedure for combinations of propositional temporal logic and other specialized theories ⋮ The synthesis of communication protocols ⋮ On the Model Checking Problem for Some Extension of CTL* ⋮ Synthesis of communicating process skeletons from temporal-spatial logic specifications ⋮ Distributed Synthesis for Alternating-Time Logics ⋮ DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC ⋮ ATL* Satisfiability Is 2EXPTIME-Complete ⋮ Proof systems for satisfiability in Hennessy-Milner logic with recursion ⋮ Symbolic model checking: \(10^{20}\) states and beyond ⋮ Assume-admissible synthesis ⋮ Axioms for real-time logics ⋮ A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time ⋮ Unnamed Item ⋮ Relating word and tree automata ⋮ Automated theorem proving in temporal logic: \(T\)-resolution ⋮ Description and reasoning of VLSI circuit in temporal logic
