{"id":"https://openalex.org/W1638591980","doi":"https://doi.org/10.1007/11590156_22","title":"When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?","display_name":"When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1638591980","doi":"https://doi.org/10.1007/11590156_22","mag":"1638591980"},"language":"en","primary_location":{"id":"doi:10.1007/11590156_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11590156_22","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":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00363024","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008504744","display_name":"B\u00e9atrice B\u00e9rard","orcid":"https://orcid.org/0000-0002-3314-1956"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Beatrice B\u00e9rard","raw_affiliation_strings":["LAMSADE, Paris, France"],"affiliations":[{"raw_affiliation_string":"LAMSADE, Paris, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000548831","display_name":"Franck Cassez","orcid":"https://orcid.org/0000-0002-4317-5025"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Franck Cassez","raw_affiliation_strings":["IRCCyN, Nantes, France"],"affiliations":[{"raw_affiliation_string":"IRCCyN, Nantes, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006881035","display_name":"Serge Haddad","orcid":"https://orcid.org/0000-0002-1759-1201"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Serge Haddad","raw_affiliation_strings":["LAMSADE, Paris, France"],"affiliations":[{"raw_affiliation_string":"LAMSADE, Paris, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045071943","display_name":"Didier Lime","orcid":"https://orcid.org/0000-0001-9429-7586"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Didier Lime","raw_affiliation_strings":["CISS, Aalbork, Denmark"],"affiliations":[{"raw_affiliation_string":"CISS, Aalbork, Denmark","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012250079","display_name":"Olivier Roux","orcid":"https://orcid.org/0000-0003-1665-0481"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Olivier H. Roux","raw_affiliation_strings":["IRCCyN, Nantes, France"],"affiliations":[{"raw_affiliation_string":"IRCCyN, Nantes, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5008504744"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9425,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.86622222,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"273","last_page":"284"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9994000196456909,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9739999771118164,"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/reachability","display_name":"Reachability","score":0.8928396701812744},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.8305034041404724},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.7370674014091492},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.7364583611488342},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6810646653175354},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.6700226068496704},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5916181802749634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5273807048797607},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5260063409805298},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5097522139549255},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4774754047393799},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.46902337670326233},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4272254407405853},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4183439016342163},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.41217565536499023},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3751552700996399},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3596630096435547},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25949323177337646},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2541201412677765},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2404438555240631},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1316063106060028}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8928396701812744},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.8305034041404724},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.7370674014091492},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.7364583611488342},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6810646653175354},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.6700226068496704},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5916181802749634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5273807048797607},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5260063409805298},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5097522139549255},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4774754047393799},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.46902337670326233},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4272254407405853},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4183439016342163},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.41217565536499023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3751552700996399},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3596630096435547},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25949323177337646},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2541201412677765},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2404438555240631},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1316063106060028},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1007/11590156_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11590156_22","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.217.8174","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.8174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHLR-tcs08.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.232.6724","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.6724","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.inria.fr/docs/00/36/30/24/PDF/BCHLR-tcs08.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.361.3466","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.3466","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.irccyn.fr/franck/bib/ps-pdf-files/petri-nets-fsttcs05.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.82.1179","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.82.1179","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lamsade.dauphine.fr/~haddad/articles/A05-FSTTCS/A05-FSTTCS.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.98.8967","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.8967","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lamsade.dauphine.fr/~berard/PDF/bchlr-fsttcs05.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00363024v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00363024","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical Computer Science, 2008, 403 (2--3), pp.202--220","raw_type":"Journal articles"},{"id":"pmh:oai:HAL:inria-00368578v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00368578","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"25th Int. Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05), Dec 2005, Chennai, India. pp.276--284","raw_type":"Conference papers"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/5576","is_oa":true,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/5576","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00363024v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00363024","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical Computer Science, 2008, 403 (2--3), pp.202--220","raw_type":"Journal articles"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1482233117","https://openalex.org/W1484772198","https://openalex.org/W1529059198","https://openalex.org/W1589336320","https://openalex.org/W1593414957","https://openalex.org/W1825536659","https://openalex.org/W1841167015","https://openalex.org/W1977308797","https://openalex.org/W2023499821","https://openalex.org/W2033839526","https://openalex.org/W2057980886","https://openalex.org/W2099924351","https://openalex.org/W2101508170","https://openalex.org/W2104910381","https://openalex.org/W2124211751","https://openalex.org/W2130773092","https://openalex.org/W2135235051","https://openalex.org/W2142830749","https://openalex.org/W2144938038","https://openalex.org/W2151612633","https://openalex.org/W2151720555","https://openalex.org/W2158100094","https://openalex.org/W2169601056","https://openalex.org/W2561675875","https://openalex.org/W2618022080","https://openalex.org/W2655945019"],"related_works":["https://openalex.org/W2107608134","https://openalex.org/W2136485937","https://openalex.org/W1598641851","https://openalex.org/W1601172863","https://openalex.org/W1965551437","https://openalex.org/W2154625854","https://openalex.org/W2133856837","https://openalex.org/W2765111002","https://openalex.org/W2952380278","https://openalex.org/W2046095317"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}