On projective and separable properties

DOI10.1016/S0304-3975(96)00225-3MaRDI QIDQ1389766zbMATH OpenFDO

Authors Doron Peled

Publication date 30 June 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

propositional linear temporal logiccomponent alphabetsprojective languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Propositional Projection Temporal Logic, B $\ddot{u}$ chi Automata and ω-Regular Expressions
• Expressiveness of propositional projection temporal logic with star
• Specification languages for stutter-invariant regular properties
• scientific article; zbMATH DE number 3989329

Cites work

• scientific article; zbMATH DE number 3924161 (Why is no real title available?)
• scientific article; zbMATH DE number 3986679 (Why is no real title available?)
• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 3445172 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• A partial approach to model checking
• A syntactic congruence for rational \(\omega\)-languages
• An algorithmic approach for checking closure properties of temporal logic specifications and -regular languages
• Appraising fairness in languages for distributed programming
• Combinatorics on traces
• Complexity of some problems in Petri nets
• Event fairness and non-interleaving concurrency
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Interleaving set temporal logic
• Linear Automaton Transformations
• Rational and recognizable complex trace languages
• Stutter-invariant temporal properties are expressible without the next-time operator
• Temporal logic can be more expressive
• The complexity of propositional linear temporal logics
• Verification of distributed programs using representative interleaving sequences

Cited in

(3)

• scientific article; zbMATH DE number 2128950 (Why is no real title available?)
• Reconciling statechart semantics
• scientific article; zbMATH DE number 4132203 (Why is no real title available?)

This page was built for publication: On projective and separable properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389766)