Pages that link to "Item:Q1088653"
From MaRDI portal
The following pages link to The complementation problem for Büchi automata with applications to temporal logic (Q1088653):
Displayed 29 items.
- A theory of ultimately periodic languages and automata with an application to time granularity (Q731330) (← links)
- Specification and verification of data-driven Web applications (Q878758) (← links)
- Simple interpretations among complicated theories (Q923068) (← links)
- Tool support for learning Büchi automata and linear temporal logic (Q1019031) (← links)
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems (Q1179180) (← links)
- Event-clock automata: a determinizable class of timed automata (Q1274452) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- On deciding trace equivalences for processes (Q1310916) (← links)
- A theory of timed automata (Q1322162) (← links)
- Progress measures, immediate determinacy, and a subset construction for tree automata (Q1337694) (← links)
- Fair Petri nets and structural induction for rings of processes (Q1346633) (← links)
- Using automata theory for characterizing the semantics of terminological cycles (Q1380409) (← links)
- Program schemata vs. automata for decidability of program logics (Q1392141) (← links)
- Unambiguous Büchi automata. (Q1401292) (← links)
- Systolic tree \(\omega\)-languages: The operational and the logical view (Q1575949) (← links)
- Decidability of infinite-state timed CCP processes and first-order LTL (Q1763732) (← links)
- Using partial orders for the efficient verification of deadlock freedom and safety properties (Q1801499) (← links)
- Fair simulation (Q1854506) (← links)
- On the complexity of verifying concurrent transition systems (Q1854510) (← links)
- Verification of concurrent programs: The automata-theoretic framework (Q2277249) (← links)
- From complementation to certification (Q2575735) (← links)
- Complexity of Topological Properties of Regular ω-Languages (Q3533038) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Büchi Complementation and Size-Change Termination (Q3617751) (← links)
- A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time (Q3643267) (← links)
- Serializable histories in quantified propositional temporal logic (Q4652741) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- Automata-Theoretic Model Checking Revisited (Q5452603) (← links)
- BÜCHI COMPLEMENTATION MADE TIGHTER (Q5484906) (← links)