h1

001005879 001__ 1005879
001005879 005__ 20250602153018.0
001005879 0247_ $$2ISBN$$a978-3-95977-339-3
001005879 0247_ $$2SCOPUS$$aSCOPUS:2-s2.0-85203497328
001005879 0247_ $$2doi$$a10.4230/LIPICS.CONCUR.2024.37
001005879 0247_ $$2datacite_doi$$a10.18154/RWTH-2025-02073
001005879 037__ $$aRWTH-2025-02073
001005879 041__ $$aEnglish
001005879 1001_ $$00009-0008-4461-0667$$aSpork, Timm$$b0$$eCorresponding author
001005879 1112_ $$a35. International Conference on Concurrency Theory$$cCalgary$$d2024-09-09 - 2024-09-13$$gCONCUR 2024$$wCanada
001005879 245__ $$aA Spectrum of Approximate Probabilistic Bisimulations$$honline
001005879 260__ $$aWadern$$bSchloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH$$c2024
001005879 29510 $$a35th International Conference on Concurrency Theory : CONCUR 2024, September 9-13, 2024, Calgary, Canada / edited by Rupak Majumdar, Alexandra Silva
001005879 300__ $$a37:1-37:19
001005879 3367_ $$033$$2EndNote$$aConference Paper
001005879 3367_ $$0PUB:(DE-HGF)7$$2PUB:(DE-HGF)$$aContribution to a book
001005879 3367_ $$0PUB:(DE-HGF)8$$2PUB:(DE-HGF)$$aContribution to a conference proceedings$$bcontrib$$mcontrib
001005879 3367_ $$2BibTeX$$aINPROCEEDINGS
001005879 3367_ $$2DRIVER$$aconferenceObject
001005879 3367_ $$2DataCite$$aOutput Types/Conference Paper
001005879 3367_ $$2ORCID$$aCONFERENCE_PAPER
001005879 4900_ $$aLeibniz international proceedings in informatics$$v311
001005879 588__ $$aDataset connected to DataCite
001005879 591__ $$aGermany
001005879 650_7 $$2Other$$aAbstraction
001005879 650_7 $$2Other$$aApproximate bisimulation
001005879 650_7 $$2Other$$aMarkov chains
001005879 650_7 $$2Other$$aModel checking
001005879 650_7 $$2Other$$aTheory of computation → Logic and verification
001005879 650_7 $$2Other$$aTheory of computation → Random walks and Markov chains
001005879 7001_ $$00000-0002-5321-9343$$aBaier, Christel$$b1$$eCorresponding author
001005879 7001_ $$0P:(DE-82)IDM00048$$aKatoen, Joost-Pieter$$b2$$eCorresponding author$$urwth
001005879 7001_ $$00000-0003-4829-0476$$aPiribauer, Jakob$$b3$$eCorresponding author
001005879 7001_ $$0P:(DE-82)IDM01389$$aQuatmann, Tim$$b4$$eCorresponding author$$urwth
001005879 8564_ $$uhttps://publications.rwth-aachen.de/record/1005879/files/1005879.pdf$$yOpenAccess
001005879 909CO $$ooai:publications.rwth-aachen.de:1005879$$pdnbdelivery$$pdriver$$pVDB$$popen_access$$popenaire
001005879 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM00048$$aRWTH Aachen$$b2$$kRWTH
001005879 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM01389$$aRWTH Aachen$$b4$$kRWTH
001005879 9141_ $$y2024
001005879 9151_ $$0StatID:(DE-HGF)0031$$2StatID$$aPeer reviewed article$$x0
001005879 915__ $$0StatID:(DE-HGF)0510$$2StatID$$aOpenAccess
001005879 915__ $$0LIC:(DE-HGF)CCBY4$$2HGFVOC$$aCreative Commons Attribution CC BY 4.0
001005879 9201_ $$0I:(DE-82)121310_20140620$$k121310$$lLehrstuhl für Softwaremodellierung und Verifikation (Informatik 2)$$x0
001005879 9201_ $$0I:(DE-82)080017_20140620$$k080017$$lProfilbereich Information & Communication Technology (ICT)$$x1
001005879 9201_ $$0I:(DE-82)120000_20140620$$k120000$$lFachgruppe Informatik$$x2
001005879 961__ $$c2025-03-07T14:31:06.899242$$x2025-03-07T14:31:06.899242$$z2025-03-10
001005879 9801_ $$aFullTexts
001005879 980__ $$aI:(DE-82)080017_20140620
001005879 980__ $$aI:(DE-82)120000_20140620
001005879 980__ $$aI:(DE-82)121310_20140620
001005879 980__ $$aUNRESTRICTED
001005879 980__ $$aVDB
001005879 980__ $$acontb
001005879 980__ $$acontrib