{"headerData":{"lastRefreshDate":"06 Jul 2026"},"publicationOverview":{"publication":{"id":"1E4C5FB2-3B0E-42F7-8DE3-42FB08C5CDBE","resourceUrl":"http://gtr.ukri.org/api/publication/overview?outcomeid=644ab395d85e23.65108632&projectref=#grantRef#","outcomeId":"644ab395d85e23.65108632","title":"Foundations of Software Science and Computational Structures","parentPublicationTitle":null,"authors":[{"id":"67f5a327b32b09bfd8e6633aa43d323a","resourceUrl":"http://gtr.ukri.org/api/person/67f5a327b32b09bfd8e6633aa43d323a","firstName":null,"otherNames":"Antonik A","surname":null,"email":null,"orcidId":null,"displayName":"Antonik A","fullName":"Antonik A"}],"date":1199145600000,"digitalPublicationUrl":"http://dx.doi.org/10.1007/978-3-540-78499-9_9","pubMedId":null,"pubMedUrl":null,"isbn":null,"issn":null,"publicationUrl":"https://api.elsevier.com/content/abstract/scopus_id/47249092424","abstractText":null,"volume":null,"issue":null,"totalPages":null,"edition":null,"chapterNumber":null,"chapterTitle":"Complexity of Decision Problems for Mixed and Modal Specifications","pageRef":"112-126","series":null,"type":"Book Chapter","firstAuthorName":"Antonik A","grantRef":null},"projects":[{"id":"A1E8BEEB-129A-4AE3-8245-0673B0068452","resourceUrl":"http://gtr.ukri.org/projects?ref=EP/E028985/1","title":"Complete and Efficient Checks for Branching-Time Abstractions","status":null,"grantReference":"EP/E028985/1","grantCategory":"Research Grant","abstractText":null,"potentialImpactText":null,"fund":{"valuePounds":409486,"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}}