The following pages link to Proving partial order properties (Q1322161):
Displaying 8 items.
- Undecidability of partial order logics (Q294640) (← links)
- Abstraction for model checking multi-agent systems (Q352029) (← links)
- Efficient model checking for LTL with partial order snapshots (Q732005) (← links)
- Combining partial-order reductions with on-the-fly model-checking. (Q960506) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- Deciding global partial-order properties (Q1774565) (← links)
- Difficult configurations -- on the complexity of LTrL (Q1774566) (← links)
- An expressively complete linear time temporal logic for Mazurkiewicz traces (Q2506491) (← links)
