{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:27:50Z","timestamp":1761596870474},"reference-count":17,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":4076,"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":[[2002,6]]},"DOI":"10.1016\/s1571-0661(04)80470-5","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T19:29:25Z","timestamp":1096399765000},"page":"68-85","source":"Crossref","is-referenced-by-count":2,"title":["TPAP"],"prefix":"10.1016","volume":"65","author":[{"given":"J\u00e9r\u00f4me","family":"Ermont","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Boniol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80470-5_NEWBIB1","unstructured":"http:\/\/www.uppaal.com."},{"key":"10.1016\/S1571-0661(04)80470-5_NEWBIB2","doi-asserted-by":"crossref","unstructured":"Rajeev Alur, Costas Courcoubetis, and David Dill. Model-checking for real-time systems. In Proceedings of the 5th annual IEEE Symposium on Logic in Computer Science, Philadelphia, Pensylvania, 1990. IEEE Computer Society Press.","DOI":"10.1109\/LICS.1990.113766"},{"issue":"2","key":"10.1016\/S1571-0661(04)80470-5_NEWBIB3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","article-title":"A theory of timed automata","volume":"126","author":"Rajeev","year":"1994","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/S1571-0661(04)80470-5_NEWBIB4","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BF01898401","article-title":"Real Time Process Algebra","volume":"3","author":"Baeten","year":"1991","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S1571-0661(04)80470-5_NEWBIB5","first-page":"72","article-title":"Preemption in concurrent systems","author":"Gerard","year":"1993","journal-title":"Foundations of Software Technology and Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80470-5_NEWBIB6","unstructured":"F. Boniol, G. Bel, and J. Ermont. Mod\u00e9lisation et v\u00e9rification de propri\u00e9t\u00e9s temps r\u00e9el dans une architecture informatique distribu\u00e9e asynchrone: \u00e9tude de cas et approche comparative. In 9\u00e9me conf\u00e9rence internationale sur les syst\u00e8mes temps r\u00e9els RTS2001, mars 2001."},{"key":"10.1016\/S1571-0661(04)80470-5_NEWBIB7","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(96)00229-0","article-title":"A process algebra of communicating shared resources with dense time and priorities","volume":"189","author":"Br\u00e9mond-Gr\u00e9goire","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80470-5_NEWBIB8","unstructured":"M. Buchholtz, J. Andersen, and H.H. Lovengreen. Towards a process algebra for shared resources. In 2nd International Workshop on Models for Time-Critical Systems, Aalborg, Danemark, August 2001."},{"key":"10.1016\/S1571-0661(04)80470-5_NEWBIB9","unstructured":"P. D'Argenio. Algebras and Automata for Timed and Stochastic Systems. PhD thesis, Department of Computer Science, University of Twente, 1999."},{"issue":"3","key":"10.1016\/S1571-0661(04)80470-5_NEWBIB10","first-page":"346","article-title":"A real-time process algebra with open intervals and maximal progress","volume":"8","author":"Harald","year":"2001","journal-title":"Nordic Journal of Computing"},{"key":"10.1016\/S1571-0661(04)80470-5_NEWBIB11","first-page":"302","article-title":"Real-time calculi and expansion theorems","volume":"volume 652","author":"Godskesen","year":"1992"},{"issue":"1\u20132","key":"10.1016\/S1571-0661(04)80470-5_NEWBIB12","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/s100090050010","article-title":"UPPAAL in a nutshell","volume":"1","author":"Guldstrand Larsen","year":"1997","journal-title":"International Journal on Software Tools for Technology Transfer"},{"issue":"2","key":"10.1016\/S1571-0661(04)80470-5_NEWBIB13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1006\/inco.1997.2623","article-title":"Time-abstracted bisimulation: Implicit specifications and decidability","volume":"134","author":"Guldstrand Larsen","year":"1997","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80470-5_NEWBIB14","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S1571-0661(04)80470-5_NEWBIB15","doi-asserted-by":"crossref","unstructured":"C. Tofts F. Moller. A temporal calculus of communicating systems. In Proceedings of Concur'90, Lecture Notes in Computer Science, volume 458, pages 401\u2013415. Springer-Verlag, 1990.","DOI":"10.1007\/BFb0039073"},{"key":"10.1016\/S1571-0661(04)80470-5_NEWBIB16","series-title":"3rd. Computer-Aided Verification","first-page":"376","article-title":"An overview and synthesis on timed process algebras","author":"Nicollin","year":"1991"},{"issue":"1","key":"10.1016\/S1571-0661(04)80470-5_NEWBIB17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/inco.1994.1083","article-title":"The algebra of timed processes ATP: Theory and application","volume":"114","author":"Nicollin","year":"1994","journal-title":"Information and Computation"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804705?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804705?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T06:52:13Z","timestamp":1585896733000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104804705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S1571066104804705"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80470-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}