{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:35:51Z","timestamp":1725550551884},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304920"},{"type":"electronic","value":"9783540322405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11589976_19","type":"book-chapter","created":{"date-parts":[[2005,10,26]],"date-time":"2005-10-26T13:38:16Z","timestamp":1130333896000},"page":"327-346","source":"Crossref","is-referenced-by-count":2,"title":["A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions"],"prefix":"10.1007","author":[{"given":"H\u00e9ctor Ru\u00edz","family":"Barradas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Didier","family":"Bert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624162","volume-title":"The B-Book, Assigning Programs to Meanings","author":"J.-R. Abrial","year":"1996","unstructured":"Abrial, J.-R.: The B-Book, Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BFb0053357","volume-title":"B\u201998: Recent Advances in the Development and Use of the B Method","author":"J.-R. Abrial","year":"1998","unstructured":"Abrial, J.-R., Mussat, L.: Introducing Dynamic Constraints in B. In: Bert, D. (ed.) B 1998. LNCS, vol.\u00a01393, pp. 83\u2013128. Springer, Heidelberg (1998)"},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1145\/44501.44504","volume":"10","author":"K.R. Apt","year":"1988","unstructured":"Apt, K.R., Olderog, E.-R.: Fairness in parallel programs, the transformational approach. ACM Transactions on Programming Languages and Systems\u00a010(3), 420\u2013455 (1988)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"19_CR4","series-title":"Graduate texts in computer science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2714-2","volume-title":"Verification of Sequential and Concurrent Programs","author":"K.R. Apt","year":"1997","unstructured":"Apt, K.R., Olderog, E.-R.: Verification of Sequential and Concurrent Programs, 2nd edn. Graduate texts in computer science. Springer, Heidelberg (1997)","edition":"2"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Back, R.-J., Kurki-Suonio, R.: Decentralization of Process Nets with Centralized Control. In: 2nd ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, pp. 131\u2013143 (1983)","DOI":"10.1145\/800221.806716"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s002360050116","volume":"35","author":"R.-J. Back","year":"1998","unstructured":"Back, R.-J., Xu, Q.: Refinement of Fair Action Systems. Acta Informatica\u00a035, 131\u2013165 (1998)","journal-title":"Acta Informatica"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1145\/177492.177727","volume":"16","author":"M. Broy","year":"1994","unstructured":"Broy, M., Nelson, G.: Adding Fair Choice to Dijkstra\u2019s Calculus. ACM Transactions on Programming Languages and Systems\u00a016(3), 924\u2013938 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"19_CR8","volume-title":"Parallel Program Design. A Foundation","author":"K.M. Chandy","year":"1988","unstructured":"Chandy, K.M., Misra, J.: Parallel Program Design. A Foundation. Addison-Wesley, Reading (1988)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0167-6423(94)00033-B","volume":"24","author":"K.M. Chandy","year":"1995","unstructured":"Chandy, K.M., Sanders, B.A.: Predicate transformers for reasoning about concurrent computation. Science of Computer Programming\u00a024, 129\u2013148 (1995)","journal-title":"Science of Computer Programming"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-44880-2_13","volume-title":"ZB 2003: Formal Specification and Development in Z and B","author":"S. Dunne","year":"2003","unstructured":"Dunne, S.: Introducing Backward Refinement into B. In: Bert, D., Bowen, J.P., King, S. (eds.) ZB 2003. LNCS, vol.\u00a02651, pp. 178\u2013196. Springer, Heidelberg (2003)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","first-page":"481","volume-title":"ZB 2002: Formal Specification and Development in Z and B","author":"S. Chouali","year":"2002","unstructured":"Chouali, S., Bellegarde, F., Julliand, J.: Verification of Dynamic Constraints for B Event Systems under Fairness Assumptions. In: Bert, D., Bowen, J.P., Henson, M.C., Robinson, K. (eds.) B 2002 and ZB 2002. LNCS, vol.\u00a02272, pp. 481\u2013500. Springer, Heidelberg (2002)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF00289091","volume":"11","author":"E.C.R. Hehner","year":"1979","unstructured":"Hehner, E.C.R.: do Considere od: A Contribution to the Programming Calculus. Acta Informatica\u00a011, 287\u2013304 (1979)","journal-title":"Acta Informatica"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Jutla, C.S., Knapp, E., Rao, J.R.: A predicate transformer approach to the semantics of parallel programs. In: Proceedings of the Eight Annual ACM Symposium on the Principles of Distributed Computing, pp. 249\u2013263 (1989)","DOI":"10.1145\/72981.72999"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01211296","volume":"9","author":"C.S. Jutla","year":"1997","unstructured":"Jutla, C.S., Rao, J.R.: A Methodology for Designing Proof Rules for Fair Parallel Programs. Formal Aspects of Computing\u00a09, 359\u2013378 (1997)","journal-title":"Formal Aspects of Computing"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0020-0190(90)90218-M","volume":"33","author":"E. Knapp","year":"1989","unstructured":"Knapp, E.: A predicate transformer for progress. Information Processing Letters\u00a033, 323\u2013330 (1989)","journal-title":"Information Processing Letters"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1145\/177492.177726","volume":"16","author":"L. Lamport","year":"1994","unstructured":"Lamport, L.: The Temporal Logic of Actions. ACM Trans. Program. Lang. Syst.\u00a016(3), 872\u2013923 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(91)90041-Y","volume":"83","author":"Z. Manna","year":"1991","unstructured":"Manna, Z., Pnueli, A.: Completing the temporal picture. Theoretical Computer Science\u00a083(1), 97\u2013130 (1991)","journal-title":"Theoretical Computer Science"},{"key":"19_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The Temporal logic of reactive and concurrent systems : specification","author":"Z. Manna","year":"1992","unstructured":"Manna, Z., Pnueli, A.: The Temporal logic of reactive and concurrent systems: specification. Springer, Heidelberg (1992)"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/S0304-3975(98)00233-3","volume":"243","author":"D. Meier","year":"2000","unstructured":"Meier, D., Sanders, B.A.: Composing leads-to properties. Theoretical Computer Science\u00a0243, 339\u2013361 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"19_CR20","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/69558.69559","volume":"11","author":"G. Nelson","year":"1989","unstructured":"Nelson, G.: A Generalization of Dijkstra\u2019s Calculus. ACM Transactions on Programming Languages and Systems\u00a011(4), 517\u2013561 (1989)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"Owicki, S., Gries, D.: An axiomatic proof technique for parallel programs. Acta Informatica\u00a06, 319\u2013340 (1976)","journal-title":"Acta Informatica"},{"key":"19_CR22","first-page":"257","volume-title":"Proceedings of the 6th IBM Symposium on Mathematical Foundations in Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: A predicate transformer for weak fair iteration. In: Proceedings of the 6th IBM Symposium on Mathematical Foundations in Computer Science, pp. 257\u2013275. IBM, Hakone, Japan (1981)"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-47884-1_20","volume-title":"Integrated Formal Methods","author":"H. Ru\u00edz-Barradas","year":"2002","unstructured":"Ru\u00edz-Barradas, H., Bert, D.: Specification and Proof of Liveness Properties under Fairness Assumptions in B Event Systems. In: Butler, M., Petre, L., Sere, K. (eds.) IFM 2002. LNCS, vol.\u00a02335, pp. 360\u2013379. Springer, Heidelberg (2002)"},{"key":"19_CR24","unstructured":"Ru\u00edz-Barradas, H., Bert, D.: Propri\u00e9t\u00e9s dynamiques avec hypoth\u00e8ses d\u2019\u00e9quit\u00e9 en B \u00e9v\u00e9nementiel. In: AFADL 2004, LIFC, Besan\u00e7on, France, pp. 299\u2013313 (2004)"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Ru\u00edz-Barradas, H., Bert, D.: A Fixpoint Semantics of Event Systems with and without Fairness Assumptions. Technical report, LSR-IMAG, Grenoble (2005)","DOI":"10.1007\/11589976_19"},{"key":"19_CR26","unstructured":"Ru\u00edz-Barradas, H., Bert, D.: Proof Obligations for Specification and Refinement of Liveness Properties under Weak Fairness. Technical Report 1071-I LSR 20, LSR-IMAG, Grenoble (2005)"},{"key":"19_CR27","first-page":"189","volume":"3","author":"B.A. Sanders","year":"1991","unstructured":"Sanders, B.A.: Eliminating the Substitution Axiom from UNITY Logic. Acta Informatica\u00a03, 189\u2013205 (1991)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11589976_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T14:05:38Z","timestamp":1586527538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11589976_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304920","9783540322405"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11589976_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}