{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:36Z","timestamp":1760202576797,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540958901"},{"type":"electronic","value":"9783540958918"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-95891-8_20","type":"book-chapter","created":{"date-parts":[[2009,1,22]],"date-time":"2009-01-22T06:19:21Z","timestamp":1232605161000},"page":"193-204","source":"Crossref","is-referenced-by-count":7,"title":["Time and Fairness in a Process Algebra with Non-blocking Reading"],"prefix":"10.1007","author":[{"given":"Flavio","family":"Corradini","sequence":"first","affiliation":[]},{"given":"Maria Rita","family":"Di Berardini","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Vogler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/11787006_36","volume-title":"Automata, Languages and Programming","author":"P. Bouyer","year":"2006","unstructured":"Bouyer, P., Haddad, S., Reynier, P.A.: Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 420\u2013431. Springer, Heidelberg (2006)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-56863-8_47","volume-title":"Application and Theory of Petri Nets 1993","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hansen, N.D.: Coloured Petri nets extended with place capacities, test arcs, and inhibitor arcs. In: Ajmone Marsan, M. (ed.) ICATPN 1993. LNCS, vol.\u00a0691, pp. 186\u2013205. Springer, Heidelberg (1993)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11817949_10","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"F. Corradini","year":"2006","unstructured":"Corradini, F., Di Berardini, M.R., Vogler, W.: Checking a Mutex Algorithm in a Process Algebra with Fairness. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 142\u2013157. Springer, Heidelberg (2006)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00236-006-0011-2","volume":"43","author":"F. Corradini","year":"2006","unstructured":"Corradini, F., Di Berardini, M.R., Vogler, W.: Fairness of Actions in System Computations. Acta Informatica\u00a043, 73\u2013130 (2006)","journal-title":"Acta Informatica"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Corradini, F., Di Berardini, M.R., Vogler, W.: Time and Fairness in a Process Algebra with Non-Blocking Reading. Technical Report 2008-13, Institute of Computer Science, University of Augsburg (2008)","DOI":"10.1007\/978-3-540-95891-8_20"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.tcs.2004.01.039","volume":"335","author":"F. Corradini","year":"2005","unstructured":"Corradini, F., Vogler, W.: Measuring the Performance of Asynchronous Systems with PAFAS. Theoretical Computer Science\u00a0335, 187\u2013213 (2005)","journal-title":"Theoretical Computer Science"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s00236-002-0094-3","volume":"38","author":"F. Corradini","year":"2002","unstructured":"Corradini, F., Vogler, W., Jenner, L.: Comparing the Worst-Case Efficiency of Asynchronous Systems with PAFAS. Acta Informatica\u00a038, 735\u2013792 (2002)","journal-title":"Acta Informatica"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0890-5401(87)90013-7","volume":"73","author":"G. Costa","year":"1987","unstructured":"Costa, G., Stirling, C.: Weak and Strong Fairness in CCS. Information and Computation\u00a073, 207\u2013244 (1987)","journal-title":"Information and Computation"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Crazzolara, F., Winskel, G.: Events in security protocols. In: Proc. of 8th ACM conference on Computer and Communication Security, CCS 2001, pp. 96\u2013105 (2001)","DOI":"10.1145\/501983.501998"},{"key":"20_CR10","unstructured":"Milner, R.: Communication and Concurrency. International series in computer science, Prentice Hall International (1989)"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/BF01178907","volume":"32","author":"U. Montanari","year":"1995","unstructured":"Montanari, U., Rossi, F.: Contextual net. Acta Informatica\u00a032, 545\u2013596 (1995)","journal-title":"Acta Informatica"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-57787-4_18","volume-title":"Graph Transformations in Computer Science","author":"U. Montanari","year":"1994","unstructured":"Montanari, U., Rossi, F.: Contextual occurrence nets and concurrent constraints programming. In: Ehrig, H., Schneider, H.-J. (eds.) Dagstuhl Seminar 1993. LNCS, vol.\u00a0776, pp. 280\u2013295. Springer, Heidelberg (1994)"},{"key":"20_CR13","unstructured":"Raynal, M.: Algorithms for Mutual Exclusion. North Oxford Academic (1986)"},{"key":"20_CR14","unstructured":"Ristori, G.: Modelling Systems with Shared Resources via Petri Nets. PhD thesis, Department of Computer Science, University of Pisa (1994)"},{"issue":"1-2","key":"20_CR15","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/S0304-3975(01)00300-0","volume":"275","author":"W. Vogler","year":"2002","unstructured":"Vogler, W.: Efficiency of Asynchronous Systems, Read Arcs and the MUTEX-problem. Theoretical Computer Science\u00a0275(1-2), 589\u2013631 (2002)","journal-title":"Theoretical Computer Science"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF01887209","volume":"1","author":"D.J. Walker","year":"1989","unstructured":"Walker, D.J.: Automated Analysis of Mutual Exclusion algorithms using CCS. Formal Aspects of Computing\u00a01, 273\u2013292 (1989)","journal-title":"Formal Aspects of Computing"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2009: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95891-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T17:56:48Z","timestamp":1684864608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95891-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540958901","9783540958918"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95891-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}