{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:48:11Z","timestamp":1762458491555},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,6,27]],"date-time":"2006-06-27T00:00:00Z","timestamp":1151366400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2006,8]]},"DOI":"10.1007\/s00236-006-0011-2","type":"journal-article","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T11:01:55Z","timestamp":1151319715000},"page":"73-130","source":"Crossref","is-referenced-by-count":8,"title":["Fairness of Actions in System Computations"],"prefix":"10.1007","volume":"43","author":[{"given":"F.","family":"Corradini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. R. Di","family":"Berardini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Vogler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,27]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Bihler E., Vogler W. Efficiency of token-passing MUTEX-solutions\u2014 some experiments. In: Desel, J. et al. (eds.) Applications and Theory of Petri Nets 1998, Lect. Notes Comp. Sci. 1420, pp. 185\u2013204, Springer, Berlin Heidelberg New York (1998)","DOI":"10.1007\/3-540-69108-1_11"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Brookes, S. Traces, pomsets, fairness and full abstractions for communicating processes. In: Concur\u201902, Lect. Notes Comp. Sci. 2421, pp 466-482. Springer, Berlin Heidelberg New York (2002)","DOI":"10.1007\/3-540-45694-5_31"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Corradini, F., Di Berardini, M.R., Vogler, W. PAFAS at work: comparing the worst-case efficiency of three buffer implementations. In: Proceedings of 2nd Asia-Pacific Conference on Quality Software, APAQS 2001, pp. 231\u2013240, IEEE, Los Alamitos (2001)","DOI":"10.1109\/APAQS.2001.990024"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Corradini, F., Di BerardiniM, M.R., Vogler, W. Relating fairness and timing in process algebras. In: Concur\u201903, Lect. Notes Comp. Sci. 2761, pp. 446\u2013460. Springer, Berlin Heidelberg New York (2003)","DOI":"10.1007\/978-3-540-45187-7_29"},{"key":"11_CR5","unstructured":"Corradini, F., Di Berardini, M.R.., Vogler, W. Fairness of components in system computations. In: Proceedins of 11th International Workshop on Expressiveness in Concurrency, Express\u201904, London, August 2004. A full version of this paper with the same title appeared as Technical Report 2005-3, at http:\/\/www.informatik.uni-augsburg.de\/skripts\/techreports"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1007\/s00236-002-0094-3","volume":"38","author":"F. Corradini","year":"2002","unstructured":"Corradini F., Vogler W., Jenner L. (2002) Comparing the worst-case efficiency of asynchronous systems with PAFAS. Acta Inf. 38, 735\u2013792","journal-title":"Acta Inf."},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/BF00271640","volume":"21","author":"G. Costa","year":"1984","unstructured":"Costa G., Stirling C. (1984) A fair calculus of communicating systems. Acta Inf. 21, 417\u2013441","journal-title":"Acta Inf."},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0890-5401(87)90013-7","volume":"73","author":"G. Costa","year":"1987","unstructured":"Costa G., Stirling C. (1987) Weak and strong fairness in CCS. Inf. Comput. 73, 207\u2013244","journal-title":"Inf. Comput."},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"De Nicola R., Hennessy M.C.B. (1984) Testing equivalence for processes. Theoret. Comput. Sci. 34, 83\u2013133","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR10","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare C.A.R. (1985) Communicating Sequential Processes. Prentice Hall, Englewood Cliffs"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Jenner, L., Vogler, W. Comparing the efficiency of asynchronous systems. In: Proceedings of AMAST Workshop on Real-Time and Probabilistic Systems, LNCS 1601, pp 172\u2013191 (1999). Modified full version as [6]","DOI":"10.1007\/3-540-48778-6_11"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0304-3975(99)00304-7","volume":"254","author":"L. Jenner","year":"2001","unstructured":"Jenner L., Vogler W. (2001) Fast asynchronous systems in dense time. Theoret. Comput. Sci. 254, 379\u2013422","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR13","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch N. (1996) Distributed Algorithms. Morgan Kaufmann, San Francisco"},{"key":"11_CR14","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner R. (1989) Communication and Concurrency. Prentice Hall, Englewood Cliffs"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Vogler, W. Efficiency of asynchronous systems and read arcs in petri nets. In: Icalp\u201997, Lect. Notes Comp. Sci. 1256, pp. 538\u2013548, Springer, Berlin Heidelberg New York (1997)","DOI":"10.1007\/3-540-63165-8_209"},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/S0304-3975(01)00300-0","volume":"275","author":"W. Vogler","year":"2002","unstructured":"Vogler W. (2002) Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. Theoret. Comput. Sci. 275, 589\u2013631","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Vogler, W. Modular construction and partial order semantics of petri nets. Lect. Notes Comp. Sci. 625, Springer, Berlin Heidelberg New York (1992)","DOI":"10.1007\/3-540-55767-9"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-006-0011-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-006-0011-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-006-0011-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:53Z","timestamp":1558705313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-006-0011-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,27]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,8]]}},"alternative-id":["11"],"URL":"https:\/\/doi.org\/10.1007\/s00236-006-0011-2","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,27]]}}}