Pages that link to "Item:Q2506491"
From MaRDI portal
The following pages link to An expressively complete linear time temporal logic for Mazurkiewicz traces (Q2506491):
Displaying 16 items.
- Undecidability of partial order logics (Q294640) (← links)
- Realizable temporal logics for web service choreography (Q739636) (← links)
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces (Q859824) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- LTL is expressively complete for Mazurkiewicz traces (Q1608324) (← links)
- Finite-trace linear temporal logic: coinductive completeness (Q1667649) (← links)
- Model checking properties on reduced trace systems (Q1736621) (← links)
- Local temporal logic is expressively complete for cograph dependence alphabets (Q1763374) (← links)
- Difficult configurations -- on the complexity of LTrL (Q1774566) (← links)
- Regular sets of infinite message sequence charts (Q1887140) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- From local to global temporal logics over Mazurkiewicz traces. (Q2490814) (← links)
- A theory of regular MSC languages (Q2573333) (← links)
- Testing Distributed Systems Through Symbolic Model Checking (Q3612360) (← links)
- (Q5009419) (← links)
- Step traces (Q5963403) (← links)
