Proving partial order properties
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4153903 (Why is no real title available?)
- scientific article; zbMATH DE number 3972158 (Why is no real title available?)
- scientific article; zbMATH DE number 4037216 (Why is no real title available?)
- scientific article; zbMATH DE number 4085006 (Why is no real title available?)
- scientific article; zbMATH DE number 3707731 (Why is no real title available?)
- scientific article; zbMATH DE number 3735115 (Why is no real title available?)
- scientific article; zbMATH DE number 3569793 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 4119617 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A proof rule for fair termination of guarded commands
- Adequate proof principles for invariance and liveness properties of concurrent programs
- Communicating sequential processes
- Concurrent and maximally concurrent evolution of nonsequential systems
- Concurrent systems and inevitability
- Decomposition of distributed programs into communication-closed layers
- Defining conditional independence using collapses
- Event fairness and non-interleaving concurrency
- First-order dynamic logic
- Guarded commands, nondeterminacy and formal derivation of programs
- Modeling concurrency with partial orders
- Petri nets, event structures and domains. I
- Recursive assertions and parallel programs
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
- Soundness and Completeness of an Axiom System for Program Verification
- Synthesis of Communicating Processes from Temporal Logic Specifications
- The \(\mu\)-calculus as an assertion-language for fairness arguments
- Using branching time temporal logic to synthesize synchronization skeletons
- Verification of distributed programs using representative interleaving sequences
- “Sometimes” and “not never” revisited
Cited in
(18)- Serializable histories in quantified propositional temporal logic
- Trace consistency and inevitability
- scientific article; zbMATH DE number 1536568 (Why is no real title available?)
- Undecidability of partial order logics
- Efficient model checking for LTL with partial order snapshots
- Difficult configurations -- on the complexity of LTrL
- Adding partial orders to linear temporal logic
- Combining partial-order reductions with on-the-fly model-checking.
- Deciding global partial-order properties
- An algorithmic approach for checking closure properties of Ω-regular languages
- An algorithmic approach for checking closure properties of temporal logic specifications and -regular languages
- The serializability problem for a temporal logic of transaction queries
- On induction principles for partial orders
- Abstraction for model checking multi-agent systems
- scientific article; zbMATH DE number 4119602 (Why is no real title available?)
- An expressively complete linear time temporal logic for Mazurkiewicz traces
- scientific article; zbMATH DE number 177840 (Why is no real title available?)
- Time Unbalanced Partial Order
This page was built for publication: Proving partial order properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322161)
