Pages that link to "Item:Q4275182"
From MaRDI portal
The following pages link to TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION (Q4275182):
Displaying 18 items.
- Efficient model checking for LTL with partial order snapshots (Q732005) (← links)
- Application of the trace assertion method to the specification, design, and verification of automaton programs (Q840086) (← links)
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces (Q859824) (← links)
- On undecidability of propositional temporal logics on trace systems (Q1199555) (← links)
- Proving partial order properties (Q1322161) (← links)
- Automated theorem proving in temporal logic: \(T\)-resolution (Q1322389) (← links)
- Petri nets, traces, and local model checking (Q1391100) (← links)
- LTL is expressively complete for Mazurkiewicz traces (Q1608324) (← links)
- Model checking properties on reduced trace systems (Q1736621) (← links)
- Local temporal logic is expressively complete for cograph dependence alphabets (Q1763374) (← links)
- From local to global temporal logics over Mazurkiewicz traces. (Q2490814) (← links)
- Using temporal logics of knowledge for specification and verification -- a case study (Q2494726) (← links)
- (Q3145302) (← links)
- Automated deduction in a graphical temporal logic (Q4868233) (← links)
- Petri nets, traces, and local model checking (Q5096394) (← links)
- Distributed Computing - IWDC 2004 (Q5465889) (← links)
- Adding partial orders to linear temporal logic (Q6044113) (← links)
- Towards automata for branching time and partial order (Q6162108) (← links)