Deciding global partial-order properties

DOI10.1007/s10703-005-4592-0zbMath1075.68050OpenAlexW2129137297MaRDI QIDQ1774565

Rajeev Alur, Doron A. Peled, K. L. McMillan

Publication date: 17 May 2005

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://repository.upenn.edu/cis_reports/144

zbMATH Keywords

decision procedurepartial-order temporal logic over global states

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Cites Work

• Unnamed Item
• Stutter-invariant temporal properties are expressible without the next-time operator
• Modeling concurrency with partial orders
• On undecidability of propositional temporal logics on trace systems
• Proving partial order properties
• A partial approach to model checking
• A logical study of distributed transition systems
• Relationships between nondeterministic and deterministic tape complexities
• Interleaving set temporal logic

This page was built for publication: Deciding global partial-order properties