guest ::
| 001 | 1005879 | ||
| 005 | 20260224145421.0 | ||
| 024 | 7 | _ | |2 ISBN |a 978-3-95977-339-3 |
| 024 | 7 | _ | |2 SCOPUS |a SCOPUS:2-s2.0-85203497328 |
| 024 | 7 | _ | |2 WOS |a WOS:001556847400037 |
| 024 | 7 | _ | |2 datacite_doi |a 10.18154/RWTH-2025-02073 |
| 024 | 7 | _ | |2 doi |a 10.4230/LIPICS.CONCUR.2024.37 |
| 037 | _ | _ | |a RWTH-2025-02073 |
| 041 | _ | _ | |a English |
| 100 | 1 | _ | |0 0009-0008-4461-0667 |a Spork, Timm |b 0 |e Corresponding author |
| 111 | 2 | _ | |a 35. International Conference on Concurrency Theory |c Calgary |d 2024-09-09 - 2024-09-13 |g CONCUR 2024 |w Canada |
| 245 | _ | _ | |a A Spectrum of Approximate Probabilistic Bisimulations |h online |
| 260 | _ | _ | |a Wadern |b Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH |c 2024 |
| 295 | 1 | 0 | |a 35th International Conference on Concurrency Theory : CONCUR 2024, September 9-13, 2024, Calgary, Canada / edited by Rupak Majumdar, Alexandra Silva |
| 300 | _ | _ | |a 37:1-37:19 |
| 336 | 7 | _ | |0 33 |2 EndNote |a Conference Paper |
| 336 | 7 | _ | |0 PUB:(DE-HGF)7 |2 PUB:(DE-HGF) |a Contribution to a book |
| 336 | 7 | _ | |0 PUB:(DE-HGF)8 |2 PUB:(DE-HGF) |a Contribution to a conference proceedings |b contrib |m contrib |
| 336 | 7 | _ | |2 BibTeX |a INPROCEEDINGS |
| 336 | 7 | _ | |2 DRIVER |a conferenceObject |
| 336 | 7 | _ | |2 DataCite |a Output Types/Conference Paper |
| 336 | 7 | _ | |2 ORCID |a CONFERENCE_PAPER |
| 490 | 0 | _ | |a Leibniz international proceedings in informatics |v 311 |
| 536 | _ | _ | |0 G:(MKW NRW)005-2401-0001 |a MKW NRW 005-2401-0001 - VerifAIPO : Verifying Al Systems under Partial Observability (005-2401-0001) |c 005-2401-0001 |x 0 |
| 588 | _ | _ | |a Dataset connected to DataCite |
| 591 | _ | _ | |a Germany |
| 650 | _ | 7 | |2 Other |a Abstraction |
| 650 | _ | 7 | |2 Other |a Approximate bisimulation |
| 650 | _ | 7 | |2 Other |a Markov chains |
| 650 | _ | 7 | |2 Other |a Model checking |
| 650 | _ | 7 | |2 Other |a Theory of computation → Logic and verification |
| 650 | _ | 7 | |2 Other |a Theory of computation → Random walks and Markov chains |
| 700 | 1 | _ | |0 0000-0002-5321-9343 |a Baier, Christel |b 1 |e Corresponding author |
| 700 | 1 | _ | |0 P:(DE-82)IDM00048 |a Katoen, Joost-Pieter |b 2 |e Corresponding author |u rwth |
| 700 | 1 | _ | |0 0000-0003-4829-0476 |a Piribauer, Jakob |b 3 |e Corresponding author |
| 700 | 1 | _ | |0 P:(DE-82)IDM01389 |a Quatmann, Tim |b 4 |e Corresponding author |u rwth |
| 856 | 4 | _ | |u https://publications.rwth-aachen.de/record/1005879/files/1005879.pdf |y OpenAccess |
| 909 | C | O | |o oai:publications.rwth-aachen.de:1005879 |p VDB |p dnbdelivery |p driver |p open_access |p openaire |
| 910 | 1 | _ | |0 I:(DE-588b)36225-6 |6 P:(DE-82)IDM00048 |a RWTH Aachen |b 2 |k RWTH |
| 910 | 1 | _ | |0 I:(DE-588b)36225-6 |6 P:(DE-82)IDM01389 |a RWTH Aachen |b 4 |k RWTH |
| 914 | 1 | _ | |y 2024 |
| 915 | 1 | _ | |0 StatID:(DE-HGF)0031 |2 StatID |a Peer reviewed article |x 0 |
| 915 | _ | _ | |0 LIC:(DE-HGF)CCBY4 |2 HGFVOC |a Creative Commons Attribution CC BY 4.0 |
| 915 | _ | _ | |0 StatID:(DE-HGF)0510 |2 StatID |a OpenAccess |
| 920 | 1 | _ | |0 I:(DE-82)121310_20140620 |k 121310 |l Lehrstuhl für Softwaremodellierung und Verifikation (Informatik 2) |x 0 |
| 920 | 1 | _ | |0 I:(DE-82)080017_20140620 |k 080017 |l Profilbereich Information & Communication Technology (ICT) |x 1 |
| 920 | 1 | _ | |0 I:(DE-82)120000_20140620 |k 120000 |l Fachgruppe Informatik |x 2 |
| 980 | 1 | _ | |a FullTexts |
| 980 | _ | _ | |a I:(DE-82)080017_20140620 |
| 980 | _ | _ | |a I:(DE-82)120000_20140620 |
| 980 | _ | _ | |a I:(DE-82)121310_20140620 |
| 980 | _ | _ | |a UNRESTRICTED |
| 980 | _ | _ | |a VDB |
| 980 | _ | _ | |a contb |
| 980 | _ | _ | |a contrib |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|