Pages that link to "Item:Q5941100"
From MaRDI portal
The following pages link to Decidability of model checking with the temporal logic EF (Q5941100):
Displaying 10 items.
- Characteristic invariants in Hennessy-Milner logic (Q2182678) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- PDL with intersection and converse: satisfiability and infinite-state model checking (Q3616354) (← links)
- Model Checking FO(R) over One-Counter Processes and beyond (Q3644768) (← links)
- An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems (Q4917080) (← links)
- Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5892174) (← links)
- Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5894255) (← links)
- Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)
