{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:25Z","timestamp":1761611065641,"version":"build-2065373602"},"reference-count":58,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1998,5,19]],"date-time":"1998-05-19T00:00:00Z","timestamp":895536000000},"content-version":"vor","delay-in-days":169,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1016\/s0304-3975(96)00229-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"179-219","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":34,"title":["A process algebra of communicating shared resources with dense time and priorities"],"prefix":"10.1016","volume":"189","author":[{"given":"Patrice","family":"Br\u00e9mond-Gr\u00e9goire","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Insup","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00229-0_BIB1","series-title":"Proc. REX Workshop on Real Time: Theory and Practice","article-title":"An old-fashioned recepi for real time","volume":"Vol. 600","author":"Abadi","year":"1991"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB2","doi-asserted-by":"crossref","DOI":"10.1109\/LICS.1992.185526","article-title":"Turning SOS rules into equations","author":"Aceto","year":"1992"},{"article-title":"Techniques for automatic verification of real-time systems","year":"1991","author":"Alur","key":"10.1016\/S0304-3975(96)00229-0_BIB3"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB4","series-title":"Proc. 17th ICALP","first-page":"322","article-title":"Automata for modeling real-time systems","volume":"Vol. 443","author":"Alur","year":"1990"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB5","series-title":"Proc. 30th IEEE FOCS","article-title":"A really temporal logic","author":"Alur","year":"1989"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB6","series-title":"Proc. IEEE Symp. on Logic in Computer Science","article-title":"Real-time logics: complexity and expressiveness","author":"Alur","year":"1990"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB7","first-page":"127","article-title":"Syntax and defining equations for an interrupt mechanism in process algebra","volume":"IX","author":"Baeten","year":"1986","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(96)00229-0_BIB8","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1093\/comjnl\/30.6.498","article-title":"Ready-trace semantics for concrete process algebra with a priority operator","volume":"30","author":"Baeten","year":"1987","journal-title":"Comput. J."},{"article-title":"Real time process algebra","year":"1990","author":"Baeten","key":"10.1016\/S0304-3975(96)00229-0_BIB9"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB10","series-title":"Proc. IEEE Real-Time Systems Symp.","article-title":"A graphical language with formal semantics for the specification and analysis of real-time systems","author":"Ben-Abdallah","year":"1995"},{"article-title":"Algebra of communicating processes","year":"1984","author":"Bergstra","key":"10.1016\/S0304-3975(96)00229-0_BIB11"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","article-title":"Algebra of communicating processes with abstraction","volume":"37","author":"Bergstra","year":"1985","journal-title":"J. Theoret. Comput. Sci."},{"article-title":"Ready, set, go: Structural operational semantics for linear-time process algebras","year":"1993","author":"Bloom","key":"10.1016\/S0304-3975(96)00229-0_BIB13"},{"article-title":"Structural operational semantics for weak bisimulation","year":"1993","author":"Bloom","key":"10.1016\/S0304-3975(96)00229-0_BIB14"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB15","series-title":"Protocol Specification, Testing and Verification","article-title":"Fundamental results for the verification of observational equivalence","author":"Bolognesi","year":"1987"},{"article-title":"An algebra of communicating shared resources with dense time and priorities","year":"1994","author":"Br\u00e9mond-Gr\u00e9goire","key":"10.1016\/S0304-3975(96)00229-0_BIB16"},{"article-title":"The soundness and completeness of ACSR (algebra of communicating shared resources)","year":"1993","author":"Br\u00e9mond-Gr\u00e9goire","key":"10.1016\/S0304-3975(96)00229-0_BIB17"},{"year":"1992","series-title":"Specification and verification of real-time systems","author":"Chen","key":"10.1016\/S0304-3975(96)00229-0_BIB18"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB19","first-page":"185","article-title":"VERSA: a tool for the specification and analysis of resource-bound real-time systems","volume":"3","author":"Clarke","year":"1995","journal-title":"J. Comput. Software Eng."},{"key":"10.1016\/S0304-3975(96)00229-0_BIB20","series-title":"Proc. IEEE Symp. on Logic in Computer Science","article-title":"Priorities in process algebras","author":"Cleaveland","year":"1988"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB21","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/0890-5401(90)90059-Q","article-title":"Priorities in process algebras","volume":"87","author":"Cleaveland","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(96)00229-0_BIB22","series-title":"Proc. IEEE Real-Time Systems Symp.","first-page":"112","article-title":"A transformational method for verifying safety properties in real-time systems","author":"Franklin","year":"1989"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB23","doi-asserted-by":"crossref","DOI":"10.1109\/REAL.1993.393489","article-title":"RTSL: a formal language for real-time schedulability analysis","author":"Fredette","year":"1993"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB24","series-title":"Proc. IEEE Real-Time Systems Symp.","article-title":"State-based specification of complex real-time systems","author":"Gabrielian","year":"1988"},{"article-title":"Communicating shared resources: a model for distributed real-time systems","year":"1991","author":"Gerber","key":"10.1016\/S0304-3975(96)00229-0_BIB25"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB26","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1006\/inco.1994.1066","article-title":"A resource-based prioritized bisimulation for real-time systems","volume":"113","author":"Gerber","year":"1994","journal-title":"Inform. Comput."},{"article-title":"A timed failure semantics for extended communicating processes","year":"1987","author":"Gerth","key":"10.1016\/S0304-3975(96)00229-0_BIB27"},{"article-title":"A process algebra for timed systems","year":"1991","author":"Hennessy","key":"10.1016\/S0304-3975(96)00229-0_BIB28"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB29","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Comm. ACM"},{"year":"1985","series-title":"Communicating Sequential Processes","author":"Hoare","key":"10.1016\/S0304-3975(96)00229-0_BIB30"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB31","series-title":"Proc. 21st Hawaii Internat. Conf. on System Sciences","article-title":"Semantics of modechart in real time logic","author":"Jahanian","year":"1988"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB32","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1109\/TSE.1986.6313045","article-title":"Safety analysis of timing properties in real-time systems","volume":"SE-12","author":"Jahanian","year":"1986","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0304-3975(96)00229-0_BIB33","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1109\/TC.1987.5009519","article-title":"A graph-theoretic approach for timing analysis and its implementation","volume":"C-36","author":"Jahanian","year":"1987","journal-title":"IEEE Trans. Comput."},{"article-title":"Formal specification of real-time system","year":"1988","author":"Jahanian","key":"10.1016\/S0304-3975(96)00229-0_BIB34"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB35","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01995674","article-title":"Specifying real-time properties with metric temporal logic","volume":"2","author":"Koymans","year":"1990","journal-title":"Real-Time Systems"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB36","series-title":"The Analysis of Concurrent systems","first-page":"231","article-title":"Examples of real-time temporal specification","volume":"Vol. 207","author":"Koymans","year":"1985"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB37","series-title":"2nd ACM Symp. on Principles of Distributed Computing ACM Press","first-page":"187","article-title":"Real-time programming and asynchronous message passing","author":"Koymans","year":"1983"},{"article-title":"The temporal logics of actions","year":"1991","author":"Lamport","key":"10.1016\/S0304-3975(96)00229-0_BIB38"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB39","series-title":"Proc. IEEE","article-title":"A process algebra approach to the specification and analysis of resource-based real-time systems","author":"Lee","year":"1994"},{"article-title":"An introduction to input\/output automata","year":"1988","author":"Lynch","key":"10.1016\/S0304-3975(96)00229-0_BIB40"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB41","series-title":"Proc. REX Workshop \u201cReal-Time: Theory in Practice\u201d","article-title":"Forward and Backward Simulations for Timing Based Systems","volume":"Vol. 600","author":"Lynch","year":"1991"},{"article-title":"A study of the recoverability of communication protocols","year":"1974","author":"Merlin","key":"10.1016\/S0304-3975(96)00229-0_BIB42"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB43","article-title":"A Calculus for Communicating Systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB44","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00229-0_BIB45","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90070-9","article-title":"A complete axiomatisation for observational congruence of finite-state behaviors","volume":"81","author":"Milner","year":"1989","journal-title":"Inform. Comput."},{"year":"1989","series-title":"Communication and Concurrency","author":"Milner","key":"10.1016\/S0304-3975(96)00229-0_BIB46"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB47","series-title":"Proc. CONCUR '90","first-page":"401","article-title":"A temporal calculus of communicating systems","volume":"Vol. 458","author":"Moller","year":"1990"},{"article-title":"The algebra of timed processes ATP: theory and application","year":"1991","author":"Nicollin","key":"10.1016\/S0304-3975(96)00229-0_BIB48"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB49","series-title":"Proc. 5th G1 Conf.","article-title":"Concurrency and automata on infinite sequences","volume":"Vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB50","series-title":"Proc. of Foundations of Computer Science","first-page":"46","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977"},{"article-title":"Analysis of asynchronous concurrent systems by Petri nets","year":"1974","author":"Ramchandani","key":"10.1016\/S0304-3975(96)00229-0_BIB51"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB52","series-title":"Proc. Internat. Conf. on Automata, Languages and Programming","article-title":"A timed model for communicating sequential processes","volume":"Vol. 226","author":"Reed","year":"1986"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB53","series-title":"Net Theory and Applications","first-page":"307","article-title":"Performance evaluation of systems using nets","volume":"Vol. 84","author":"Sifakis","year":"1980"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB54","series-title":"Proc. CONCUR '92, Internat. Conf. on Concurrency Theory","article-title":"Action transducers and timed automata","volume":"Vol. 630","author":"Vaandrager","year":"1992"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB55","series-title":"Proc. Internat. Conf. on Automata, Languages and Programming","article-title":"CCS + time = an interleaving model for real time systems","author":"Wang","year":"1991"},{"key":"10.1016\/S0304-3975(96)00229-0_BIB56","series-title":"Proc. Formal Techniques in Real-Time and Fault-Tolerant Systems","first-page":"21","article-title":"Duration specification for shared processors","volume":"Vol. 571","author":"Zhou","year":"1992"},{"article-title":"Timed acceptance: an algebra of time dependent computing","year":"1988","author":"Zwarico","key":"10.1016\/S0304-3975(96)00229-0_BIB57"},{"article-title":"A complete axiomatization of real-time processes","year":"1988","author":"Zwarico","key":"10.1016\/S0304-3975(96)00229-0_BIB58"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002290?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002290?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:25Z","timestamp":1759625485000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":58,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0304397596002290"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00229-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1997,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A process algebra of communicating shared resources with dense time and priorities","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(96)00229-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}