{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:56:30Z","timestamp":1762458990899,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540156703"},{"type":"electronic","value":"9783540395935"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15670-4_11","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:23:11Z","timestamp":1330194191000},"page":"221-245","source":"Crossref","is-referenced-by-count":10,"title":["Concurrent behaviour: Sequences, processes and axioms"],"prefix":"10.1007","author":[{"given":"Eike","family":"Best","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.3233\/FI-1980-3107","volume":"1","author":"E. Best","year":"1980","unstructured":"E. Best: A Theorem on the Characteristics of Non-sequential Processes. Fundamenta Informaticae III.1 (1980), 77\u201394.","journal-title":"Fundamenta Informaticae III"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"E.Best: The Relative Strength of K-density. In: [8], 261\u2013276.","DOI":"10.1007\/3-540-10001-6_27"},{"key":"11_CR3","unstructured":"E.Best: Relational Semantics of Concurrent Programs (with some Applications). Formal Description of Programming Concepts II (ed.D.Bj\u00f8rner) (1983), 431\u2013452."},{"key":"11_CR4","first-page":"73","volume":"145","author":"E. Best","year":"1982","unstructured":"E. Best and A. Merceron: Discreteness, K-density and D-continuity in Occurrence Nets. LNCS 145 (1982), 73\u201383.","journal-title":"LNCS"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"E.Best and A.Merceron: Frozen Tokens and D-continuity: A Study in Relating System Properties to Process Properties. \u00c5rhus Workshop on Petri Nets (1984), to appear in: Advances in Net Theory (ed.G.Rozenberg).","DOI":"10.1007\/3-540-15204-0_4"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF00289593","volume":"16","author":"E. Best","year":"1981","unstructured":"E. Best and B. Randell: A Formal Model of Atomicity in Asynchronous Systems. Acta Informatica 16 (1981), 93\u2013124.","journal-title":"Acta Informatica"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF00289141","volume":"21","author":"E. Best","year":"1984","unstructured":"E. Best and K. Voss: Free Choice Systems have Home States. Acta Informatica 21 (1984), 89\u2013100.","journal-title":"Acta Informatica"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"W.Brauer (ed.): Net Theory and Applications. LNCS 84 (1980).","DOI":"10.1007\/3-540-100016"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(83)90070-1","volume":"28","author":"C. Fern\u00e1ndez","year":"1984","unstructured":"C. Fern\u00e1ndez and P.S. Thiagarajan: D-Continuous Causal Nets: A Model of Non-sequential Processes. TCS 28 (1984), 171\u2013196.","journal-title":"TCS"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"C.Fern\u00e1ndez, M.Nielsen and P.S.Thiagarajan: A Note on Observable Occurrence Nets. \u00c5rhus Workshop on Petri nets (1984), to appear in: Advances in Net Theory (ed. G.Rozenberg).","DOI":"10.1007\/3-540-15204-0_8"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"H.J.Genrich, K.Lautenbach and P.S.Thiagarajan: Elements of General Net Theory. In: [8], 21\u2013163.","DOI":"10.1007\/3-540-10001-6_22"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"H.J.Genrich and E.Stankiewicz-Wiechno: A Dictionary of some Basic Notions of Net Theory. In: [8], 519\u2013535.","DOI":"10.1007\/3-540-10001-6_39"},{"key":"11_CR13","first-page":"196","volume":"172","author":"U. Goltz","year":"1984","unstructured":"U. Goltz and A. Mycroft: On the Relationship of CCS and Petri Nets. LNCS 172 (1984) 196\u2013208.","journal-title":"LNCS"},{"key":"11_CR14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(83)80040-0","volume":"57","author":"U. Goltz","year":"1983","unstructured":"U. Goltz and W. Reisig: The Non-sequential Behaviour of Petri Nets. Information and Control 57 (1983), 125\u2013147.","journal-title":"Information and Control"},{"key":"11_CR15","first-page":"108","volume":"74","author":"M. Hennessy","year":"1979","unstructured":"M. Hennessy and G. Plotkin: Full Abstraction for a Simple Programming Language. LNCS 74 (1979), 108\u2013120.","journal-title":"LNCS"},{"issue":"8","key":"11_CR16","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C. A. R. R. Hoare","year":"1978","unstructured":"C.A.R. Hoare: Communicating Sequential Processes. CACM 21(8) (1978), 666\u2013677.","journal-title":"CACM"},{"key":"11_CR17","unstructured":"A.Holt: Final Report on the Project on Information Systems Theory, Applied Data Research ADR6606 (1968)."},{"key":"11_CR18","unstructured":"L.Lamport: What Good is Temporal Logic? Inf. Proc. 83, North Holland (1983), 657\u2013667."},{"issue":"9","key":"11_CR19","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/954312.954317","volume":"16","author":"P. E. Lauer","year":"1981","unstructured":"P.E. Lauer: Synchronisation of Concurrent Processes without Globality Assumptions. ACM SIGPLAN Notices 16(9) (1981), 66\u201380.","journal-title":"ACM SIGPLAN Notices"},{"key":"11_CR20","unstructured":"P.E.Lauer, M.W.Shields and E.Best: Formal Theory of the Basic COSY Notation. Computing Laboratory, Univ. of Newcastle upon Tyne, TR143 (1979)."},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"A.Mazurkiewicz: Concurrent Program Schemes and their Interpretation. \u00c5rhus Univ. Computer Science Dep. Report DAIMI PB-78 (1977).","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"R.Milner: A Calculus of Communicating Systems. LNCS 92 (1980).","DOI":"10.1007\/3-540-10235-3"},{"key":"11_CR23","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"M. Nielsen, G. Plotkin and G. Winskel: Petri Nets, Event Structures and Domains I. TCS 13 (1981), 85\u2013108.","journal-title":"TCS"},{"key":"11_CR24","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"S. Owicki and D. Gries: An Axiomatic Proof Technique for Parallel Programs I. Acta Informatica 6 (1976), 319\u2013340.","journal-title":"Acta Informatica"},{"key":"11_CR25","unstructured":"C.A.Petri: Non-Sequential Processes. GMD-ISF Report 77.05 (1977)."},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"C.A.Petri: Concurrency. In: [8], 251\u2013260.","DOI":"10.1007\/3-540-10001-6_26"},{"key":"11_CR27","unstructured":"G.Plotkin: In a private discussion, G.Plotkin suggested b-discreteness as an axiom to be satisfied by non-sequential processes. (1979)"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"G.Plotkin: An Operational Semantics for CSP. Formal Description of Programming Concepts II (ed.D.Bj\u00f8rner) (1983), 199\u2013223.","DOI":"10.1007\/3-540-11981-7_17"},{"key":"11_CR29","unstructured":"H.Pl\u00fcnnecke: Schnitte in Halbordnungen. GMD-ISF Report 81.09 (1981). Abridged English version to appear in: Advances in Net Theory (ed. G.Rozenberg)."},{"key":"11_CR30","first-page":"403","volume":"172","author":"W. Reisig","year":"1984","unstructured":"W. Reisig: Partial Order Semantics versus Interleaving Semantics for CSP-Like Languages and its Impact on Fairness. LNCS 172 (1984), 403\u2013413.","journal-title":"LNCS"},{"key":"11_CR31","unstructured":"W.Reisig: On the Semantics of Petri Nets. Bericht No.100, FB Informatik, University of Hamburg (1984)."},{"key":"11_CR32","first-page":"249","volume":"70","author":"M. W. Shields","year":"1979","unstructured":"M.W. Shields: Adequate Path Expressions. LNCS 70 (1979), 249\u2013265.","journal-title":"LNCS"},{"key":"11_CR33","unstructured":"G.Winskel: Events in Computation. PhD Thesis, Computer Science Department, Edinburgh University (1980)."}],"container-title":["Lecture Notes in Computer Science","Seminar on Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15670-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:22:35Z","timestamp":1742588555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15670-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540156703","9783540395935"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-15670-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}