{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T08:28:00Z","timestamp":1652689680874},"reference-count":20,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3742,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s1571-0661(04)80521-8","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"85-100","source":"Crossref","is-referenced-by-count":3,"title":["Petri nets with causal time for system verification"],"prefix":"10.1016","volume":"68","author":[{"given":"C.","family":"Bui Thanh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Klaudel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Pommereau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80521-8_bib1","article-title":"A theory of timed automata","volume":"126(2)","author":"Alur","year":"1994"},{"key":"10.1016\/S1571-0661(04)80521-8_bib2","article-title":"M-nets: an algebra of high level Petri nets, with an application to the semantics of concurrent programming languages.","volume":"35","author":"Best","year":"1998"},{"key":"10.1016\/S1571-0661(04)80521-8_bib3","series-title":"CONCUR'99, 1664","article-title":"Model Checking and timed Petri nets based on partial order semantics","author":"Bieber","year":"1999"},{"key":"10.1016\/S1571-0661(04)80521-8_bib4","article-title":"Time-based expressivity of time Petri nets for system specification","volume":"216","author":"Cerone","year":"1999"},{"key":"10.1016\/S1571-0661(04)80521-8_bib5","article-title":"Causality, time, and deadlines","volume":"6","author":"Durchholz","year":"1991"},{"key":"10.1016\/S1571-0661(04)80521-8_bib6","article-title":"Model checking using net unfoldings","volume":"23","author":"Esparza","year":"1994"},{"key":"10.1016\/S1571-0661(04)80521-8_bib7","series-title":"Net Theory and Applications, Advanced Course on General Net Theory of Processes and Systems, LNCS 84","article-title":"Elements of General Net Theory","author":"Genrich","year":"1980"},{"key":"10.1016\/S1571-0661(04)80521-8_bib8","series-title":"Computer Aided Verification, LNCS 1254","article-title":"The PEP Tool","author":"Grahlmann","year":"1997"},{"key":"10.1016\/S1571-0661(04)80521-8_bib9","series-title":"LICS'92","article-title":"Symbolic model checking for real-time systems","author":"Henzinger","year":"1992"},{"key":"10.1016\/S1571-0661(04)80521-8_bib10","series-title":"Volume 1 of EATCS Monographs on TCS","article-title":"Coloured Petri nets. Basic Concepts, Analysis Methods and Practical Use","author":"Jensen","year":"1992"},{"key":"10.1016\/S1571-0661(04)80521-8_bib11","series-title":"CAV'02, LNCS","article-title":"Canonical prefixes of Petri net unfoldings","author":"Khomenko","year":"2002"},{"key":"10.1016\/S1571-0661(04)80521-8_bib12","series-title":"ASIAN'99, LNCS 1742","article-title":"Asynchronous links in the PBC and M-nets","author":"Klaudel","year":"1999"},{"key":"10.1016\/S1571-0661(04)80521-8_bib13","article-title":"a nutshell","volume":"1(-2)","author":"Larsen","year":"1997"},{"key":"10.1016\/S1571-0661(04)80521-8_bib14","article-title":"A technique of state space search based on unfoldings","volume":"6","author":"MacMillan","year":"1995"},{"key":"10.1016\/S1571-0661(04)80521-8_bib15","author":"M\"akel\"a"},{"key":"10.1016\/S1571-0661(04)80521-8_bib16","article-title":"Calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1983"},{"key":"10.1016\/S1571-0661(04)80521-8_bib17","unstructured":"F. Pommereau. Mod\u00e8les composables et conurrents pour le temps-r\u00e9el. Ph.D. Thesis. University Paris 12, 2002."},{"key":"10.1016\/S1571-0661(04)80521-8_bib18","unstructured":"G. Richter. Counting interfaces for discrete time modeling. Technical report 26, GMD. Sept. 1998."},{"key":"10.1016\/S1571-0661(04)80521-8_bib19","unstructured":"P. Synder. tmpfs: a virtual memory file system. White Papers, Sun Microsystems Inc."},{"key":"10.1016\/S1571-0661(04)80521-8_bib20","article-title":"Kronos: A verification tool for real-time systems","volume":"1(1\/2)","author":"Yovine","year":"1997"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805218?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805218?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:54:38Z","timestamp":1549191278000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S1571066104805218"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80521-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}