{"headerData":{"lastRefreshDate":"06 Jul 2026"},"publicationOverview":{"publication":{"id":"4A85802A-E001-4205-9D93-267A20FD2ECE","resourceUrl":"http://gtr.ukri.org/api/publication/overview?outcomeid=5536325c36fdc1.48805037&projectref=#grantRef#","outcomeId":"5536325c36fdc1.48805037","title":"Foundations of Software Science and Computational Structures","parentPublicationTitle":null,"authors":[{"id":"631d976e6f957e3d6cc7f113f92a1cb4","resourceUrl":"http://gtr.ukri.org/api/person/631d976e6f957e3d6cc7f113f92a1cb4","firstName":null,"otherNames":"Kiefer S","surname":null,"email":null,"orcidId":null,"displayName":"Kiefer S","fullName":"Kiefer S"}],"date":1325376000000,"digitalPublicationUrl":"http://dx.doi.org/10.1007/978-3-642-28729-9_31","pubMedId":null,"pubMedUrl":null,"isbn":"978-3-642-28728-2","issn":null,"publicationUrl":"http://dx.doi.org/10.1007/978-3-642-28729-9_31","abstractText":null,"volume":null,"issue":null,"totalPages":null,"edition":null,"chapterNumber":null,"chapterTitle":"On the Complexity of the Equivalence Problem for Probabilistic Automata","pageRef":"467-481","series":null,"type":"Book Chapter","firstAuthorName":"Kiefer S","grantRef":null},"projects":[{"id":"0E151403-ECDC-4A1A-ABCF-F253630A4CFC","resourceUrl":"http://gtr.ukri.org/projects?ref=EP/G069158/1","title":"Automated Verification of Probabilistic Programs","status":null,"grantReference":"EP/G069158/1","grantCategory":"Research Grant","abstractText":null,"potentialImpactText":null,"fund":{"valuePounds":290345,"start":null,"end":null,"funder":{"id":"798CB33D-C79E-4578-83F2-72606407192C","resourceUrl":"http://gtr.ukri.org/api/organisation/798CB33D-C79E-4578-83F2-72606407192C","name":"EPSRC"},"type":"INCOME_ACTUAL"},"output":null,"publications":null,"identifiers":null,"technicalSummary":null,"projectHierarchy":null,"studentshipHierarchy":null,"healthCategories":[],"researchActivities":[],"researchSubjects":[],"researchTopics":[],"rcukProgrammes":[],"hasClassifications":false}],"abstractSnippet":null}}