Work

From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata

Year: 2017

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/978-3-662-54577-5_25

Authors: Javier Esparza, Jan Křetínský, Jean-François Raskin, Salomon Sickert

Institutions: Technical University of Munich, Université Libre de Bruxelles

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2949283240

FWCI: 3.732

Cites: 18

Cited by: 33

Related to: