{"id":"https://openalex.org/W2126053898","doi":"https://doi.org/10.1007/978-3-540-78929-1_13","title":"Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems","display_name":"Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems","publication_year":2008,"publication_date":"2008-07-17","ids":{"openalex":"https://openalex.org/W2126053898","doi":"https://doi.org/10.1007/978-3-540-78929-1_13","mag":"2126053898"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-78929-1_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-78929-1_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5089746112","display_name":"Martin Fr\u00e4nzle","orcid":"https://orcid.org/0000-0002-9138-8340"},"institutions":[{"id":"https://openalex.org/I129877168","display_name":"Carl von Ossietzky Universit\u00e4t Oldenburg","ror":"https://ror.org/033n9gh91","country_code":"DE","type":"education","lineage":["https://openalex.org/I129877168"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Fr\u00e4nzle","raw_affiliation_strings":["Carl von Ossietzky Universit\u00e4t, Oldenburg, Germany","Carl von Ossietzky Universit\u00e4t Oldenburg , Germany"],"affiliations":[{"raw_affiliation_string":"Carl von Ossietzky Universit\u00e4t, Oldenburg, Germany","institution_ids":["https://openalex.org/I129877168"]},{"raw_affiliation_string":"Carl von Ossietzky Universit\u00e4t Oldenburg , Germany","institution_ids":["https://openalex.org/I129877168"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028747794","display_name":"Holger Hermanns","orcid":"https://orcid.org/0000-0002-2766-9615"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Holger Hermanns","raw_affiliation_strings":["Saarland University, Saarbr\u00fccken, Germany","Saarland Univ., Saarbr\u00fccken, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"Saarland Univ., Saarbr\u00fccken, Germany#TAB#","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002477196","display_name":"Tino Teige","orcid":null},"institutions":[{"id":"https://openalex.org/I129877168","display_name":"Carl von Ossietzky Universit\u00e4t Oldenburg","ror":"https://ror.org/033n9gh91","country_code":"DE","type":"education","lineage":["https://openalex.org/I129877168"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tino Teige","raw_affiliation_strings":["Carl von Ossietzky Universit\u00e4t, Oldenburg, Germany","Carl von Ossietzky Universit\u00e4t Oldenburg , Germany"],"affiliations":[{"raw_affiliation_string":"Carl von Ossietzky Universit\u00e4t, Oldenburg, Germany","institution_ids":["https://openalex.org/I129877168"]},{"raw_affiliation_string":"Carl von Ossietzky Universit\u00e4t Oldenburg , Germany","institution_ids":["https://openalex.org/I129877168"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089746112"],"corresponding_institution_ids":["https://openalex.org/I129877168"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":6.9027,"has_fulltext":false,"cited_by_count":79,"citation_normalized_percentile":{"value":0.97459436,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"172","last_page":"186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9952999949455261,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7566617727279663},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.7119876146316528},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6838468313217163},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6810116171836853},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6463810801506042},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6155979633331299},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.6023745536804199},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.5961872339248657},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5749863386154175},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5636615753173828},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5356905460357666},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.5088741779327393},{"id":"https://openalex.org/keywords/hybrid-system","display_name":"Hybrid system","score":0.5067048668861389},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.48624387383461},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4663744568824768},{"id":"https://openalex.org/keywords/hybrid-automaton","display_name":"Hybrid automaton","score":0.42855942249298096},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.42410823702812195},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4004132151603699},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.38827481865882874},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3264356255531311},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25177523493766785},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13701224327087402}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7566617727279663},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7119876146316528},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6838468313217163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6810116171836853},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6463810801506042},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6155979633331299},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.6023745536804199},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5961872339248657},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5749863386154175},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5636615753173828},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5356905460357666},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.5088741779327393},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.5067048668861389},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.48624387383461},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4663744568824768},{"id":"https://openalex.org/C2776028153","wikidata":"https://www.wikidata.org/wiki/Q5953179","display_name":"Hybrid automaton","level":3,"score":0.42855942249298096},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.42410823702812195},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4004132151603699},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.38827481865882874},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3264356255531311},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25177523493766785},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13701224327087402},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-540-78929-1_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-78929-1_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.330.3435","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.3435","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hs.informatik.uni-oldenburg.de/tino/papers/FraeHerTei_HSCC08.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.379.8189","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.379.8189","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.avacs.org/fileadmin/Publikationen/Open/fraenzle.qapl08.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1495732641","https://openalex.org/W1508592466","https://openalex.org/W1522448884","https://openalex.org/W1533325063","https://openalex.org/W1598511836","https://openalex.org/W1787074469","https://openalex.org/W1882576690","https://openalex.org/W2019851160","https://openalex.org/W2022846948","https://openalex.org/W2057361103","https://openalex.org/W2062251861","https://openalex.org/W2086163366","https://openalex.org/W2094530979","https://openalex.org/W2125636741","https://openalex.org/W2125967324","https://openalex.org/W2127305744","https://openalex.org/W2136192377","https://openalex.org/W2141803002","https://openalex.org/W2143706916","https://openalex.org/W2163850966","https://openalex.org/W2799664482","https://openalex.org/W4247619688"],"related_works":["https://openalex.org/W2139519154","https://openalex.org/W2950563206","https://openalex.org/W2143754769","https://openalex.org/W1550824632","https://openalex.org/W4300232377","https://openalex.org/W1979390054","https://openalex.org/W2010706856","https://openalex.org/W86814122","https://openalex.org/W2013080869","https://openalex.org/W1767123124"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}