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):
Displaying 50 items.
- Invariant-free clausal temporal resolution (Q352974) (← links)
- Bounded model checking of ETL cooperating with finite and looping automata connectives (Q364388) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Refinement modal logic (Q476194) (← links)
- A compositional automata-based semantics and preserving transformation rules for testing property patterns (Q493531) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- Fragments of first-order logic over infinite words (Q537914) (← links)
- Dynamic logic assigned to automata (Q682633) (← links)
- A theory of ultimately periodic languages and automata with an application to time granularity (Q731330) (← links)
- Verification of multi-agent systems with public actions against strategy logic (Q785241) (← links)
- Prognosis of \(\omega\)-languages for the diagnosis of *-languages: a topological perspective (Q843994) (← 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)
- From liveness to promptness (Q1039845) (← 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)
- Imperfect information in reactive modules games (Q1641035) (← 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)
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games (Q2211871) (← links)
- Multi-player games with LDL goals over finite traces (Q2225596) (← links)
- Verification of concurrent programs: The automata-theoretic framework (Q2277249) (← links)
- An automatic method for the dynamic construction of abstractions of states of a formal model (Q2452756) (← links)
- From complementation to certification (Q2575735) (← links)
- The refinement calculus of reactive systems (Q2672236) (← links)
- On the Expressiveness of Temporal Equilibrium Logic (Q2835869) (← links)
- Effective Synthesis of Asynchronous Systems from GR(1) Specifications (Q2891421) (← links)
- Reasoning About Strategies (Q2946746) (← links)
- Reasoning About Substructures and Games (Q2957764) (← links)
- Büchi Store: An Open Repository of Büchi Automata (Q3000654) (← links)
- Partially Ordered Two-Way Büchi Automata (Q3073637) (← links)
- State of Büchi Complementation (Q3073645) (← links)
- Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- Functional Specification of Hardware via Temporal Logic (Q3176382) (← links)
- PARTIALLY ORDERED TWO-WAY BÜCHI AUTOMATA (Q3224953) (← links)
- Complexity of Topological Properties of Regular ω-Languages (Q3533038) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)