{"id":"https://openalex.org/W2075423323","doi":"https://doi.org/10.1145/1772630.1772635","title":"Symbolic calculation of k-shortest paths and related measures with the stochastic process algebra tool CASPA","display_name":"Symbolic calculation of k-shortest paths and related measures with the stochastic process algebra tool CASPA","publication_year":2010,"publication_date":"2010-04-27","ids":{"openalex":"https://openalex.org/W2075423323","doi":"https://doi.org/10.1145/1772630.1772635","mag":"2075423323"},"language":"en","primary_location":{"id":"doi:10.1145/1772630.1772635","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1772630.1772635","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the First Workshop on DYnamic Aspects in DEpendability Models for Fault-Tolerant Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053195307","display_name":"Michael G\u00fcnther","orcid":"https://orcid.org/0000-0002-8158-935X"},"institutions":[{"id":"https://openalex.org/I40527276","display_name":"Universit\u00e4t der Bundeswehr M\u00fcnchen","ror":"https://ror.org/05kkv3f82","country_code":"DE","type":"education","lineage":["https://openalex.org/I1315109972","https://openalex.org/I40527276","https://openalex.org/I4387152969"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michael G\u00fcnther","raw_affiliation_strings":["Universit\u00e4t der Bundeswehr, M\u00fcnchen"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t der Bundeswehr, M\u00fcnchen","institution_ids":["https://openalex.org/I40527276"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086985679","display_name":"Johann Schuster","orcid":null},"institutions":[{"id":"https://openalex.org/I40527276","display_name":"Universit\u00e4t der Bundeswehr M\u00fcnchen","ror":"https://ror.org/05kkv3f82","country_code":"DE","type":"education","lineage":["https://openalex.org/I1315109972","https://openalex.org/I40527276","https://openalex.org/I4387152969"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Johann Schuster","raw_affiliation_strings":["Universit\u00e4t der Bundeswehr, M\u00fcnchen"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t der Bundeswehr, M\u00fcnchen","institution_ids":["https://openalex.org/I40527276"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048017742","display_name":"Markus Siegle","orcid":"https://orcid.org/0000-0001-7639-2280"},"institutions":[{"id":"https://openalex.org/I40527276","display_name":"Universit\u00e4t der Bundeswehr M\u00fcnchen","ror":"https://ror.org/05kkv3f82","country_code":"DE","type":"education","lineage":["https://openalex.org/I1315109972","https://openalex.org/I40527276","https://openalex.org/I4387152969"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Siegle","raw_affiliation_strings":["Universit\u00e4t der Bundeswehr, M\u00fcnchen"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t der Bundeswehr, M\u00fcnchen","institution_ids":["https://openalex.org/I40527276"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5053195307"],"corresponding_institution_ids":["https://openalex.org/I40527276"],"apc_list":null,"apc_paid":null,"fwci":2.0072,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.86490671,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"13","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13295","display_name":"Safety Systems Engineering in Autonomy","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6514228582382202},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6284029483795166},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.616208016872406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6160647869110107},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5295965075492859},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4852037727832794},{"id":"https://openalex.org/keywords/dependability","display_name":"Dependability","score":0.47169211506843567},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4699654281139374},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4693863093852997},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4392854869365692},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.42686212062835693},{"id":"https://openalex.org/keywords/symbolic-data-analysis","display_name":"Symbolic data analysis","score":0.41283366084098816},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.412043958902359},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3373600244522095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2798146903514862},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12598058581352234},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1025155782699585},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09968236088752747}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6514228582382202},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6284029483795166},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.616208016872406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6160647869110107},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5295965075492859},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4852037727832794},{"id":"https://openalex.org/C77019957","wikidata":"https://www.wikidata.org/wiki/Q2689057","display_name":"Dependability","level":2,"score":0.47169211506843567},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4699654281139374},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4693863093852997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4392854869365692},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.42686212062835693},{"id":"https://openalex.org/C65620979","wikidata":"https://www.wikidata.org/wiki/Q7661176","display_name":"Symbolic data analysis","level":2,"score":0.41283366084098816},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.412043958902359},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3373600244522095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2798146903514862},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12598058581352234},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1025155782699585},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09968236088752747},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1772630.1772635","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1772630.1772635","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the First Workshop on DYnamic Aspects in DEpendability Models for Fault-Tolerant Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7200000286102295,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1497788657","https://openalex.org/W1864539514","https://openalex.org/W2021179335","https://openalex.org/W2062054804","https://openalex.org/W7008245828"],"related_works":["https://openalex.org/W4252527915","https://openalex.org/W2409287660","https://openalex.org/W2233357156","https://openalex.org/W1976489385","https://openalex.org/W2119145045","https://openalex.org/W2034498767","https://openalex.org/W2040761469","https://openalex.org/W2162943184","https://openalex.org/W2145180661","https://openalex.org/W2108681270"],"abstract_inverted_index":{"CASPA":[0],"is":[1,16],"a":[2,55,69],"stochastic":[3],"process":[4],"algebra":[5],"tool":[6,32],"for":[7,50],"performance":[8],"and":[9,13],"dependability":[10],"modelling,":[11],"analysis":[12],"verification.":[14],"It":[15],"based":[17],"entirely":[18],"on":[19],"the":[20,31,59,82],"symbolic":[21,56,70],"data":[22],"structure":[23],"MTBDD":[24],"(multi-terminal":[25],"binary":[26],"decision":[27],"diagram)":[28],"which":[29,64],"enables":[30],"to":[33],"handle":[34],"models":[35],"with":[36,68],"very":[37],"large":[38],"state":[39],"space.":[40],"This":[41],"paper":[42],"describes":[43],"an":[44],"extension":[45],"of":[46,58,62,72,84,87],"CASPA's":[47],"solving":[48],"engine":[49],"path-based":[51,88],"analysis.":[52,89],"We":[53],"present":[54],"variant":[57,71],"k-shortest-path":[60],"algorithm":[61],"Azevedo,":[63],"works":[65],"in":[66],"conjunction":[67],"Dijkstra's":[73],"shortest":[74],"path":[75],"algorithm.":[76],"A":[77],"non-trivial":[78],"case":[79],"study":[80],"illustrates":[81],"use":[83],"this":[85],"kind":[86]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
