{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:56:26Z","timestamp":1761486986920},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10059,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1986]]},"DOI":"10.1016\/0304-3975(86)90177-5","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"213-238","source":"Crossref","is-referenced-by-count":34,"special_numbering":"C","title":["Concurrent and maximally concurrent evolution of nonsequential systems"],"prefix":"10.1016","volume":"43","author":[{"given":"Ryszard","family":"Janicki","sequence":"first","affiliation":[]},{"given":"Peter E.","family":"Lauer","sequence":"additional","affiliation":[]},{"given":"Maciej","family":"Koutny","sequence":"additional","affiliation":[]},{"given":"Raymond","family":"Devillers","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90177-5_bib1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(82)90020-2","article-title":"Adequacy properties of path programs","volume":"18","author":"Best","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90177-5_bib2","article-title":"Le Grafcet, pour une repr\u00e9sentation normalis\u00e9e du cahier des charges d'un automatisme logique","volume":"41\u201342","author":"Blanchard","year":"1977","journal-title":"Automatique et Informatique Industrielle"},{"volume":"84","year":"1980","series-title":"Applications and Theory of Petri Nets","key":"10.1016\/0304-3975(86)90177-5_bib3"},{"key":"10.1016\/0304-3975(86)90177-5_bib4","first-page":"3","article-title":"How to play the token game or difficulties in interpreting Place\/Transition nets","volume":"16","author":"Brauer","year":"1984","journal-title":"Petri Nets and Related System Models, Newsletter"},{"issue":"2, 3","key":"10.1016\/0304-3975(86)90177-5_bib5","first-page":"71","article-title":"Ordered firing in Petri nets","volume":"17","author":"Burkhard","year":"1981","journal-title":"Elektron. Informationsverarb. Kybernet."},{"key":"10.1016\/0304-3975(86)90177-5_bib6","series-title":"Rept. ASM\/106","article-title":"On the maximally concurrent evolution of a COSY system","author":"Devillers","year":"1983"},{"key":"10.1016\/0304-3975(86)90177-5_bib7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BFb0030308","article-title":"Many-sorted temporal logic for multiprocesses systems","volume":"176","author":"Enjalbert","year":"1984","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0304-3975(86)90177-5_bib8","series-title":"Proc. of the 11th Ann. Conf. of the Association of Simula Users","article-title":"A computer based environment for the design and analysis of concurrent systems: SIMULA implementation of the COSY notation","author":"Hamshare","year":"1983"},{"key":"10.1016\/0304-3975(86)90177-5_bib9","series-title":"On the Construction of Programs","first-page":"229","article-title":"Communicating Sequential Processes","author":"Hoare","year":"1980"},{"issue":"6","key":"10.1016\/0304-3975(86)90177-5_bib10","first-page":"283","article-title":"An equivalence notion for path expression systems","volume":"21","author":"Janicki","year":"1985","journal-title":"Elektron. Informationsverarb. Kybernet."},{"key":"10.1016\/0304-3975(86)90177-5_bib11","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(85)90029-5","article-title":"Transforming sequential systems into concurrent systems","volume":"36","author":"Janicki","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90177-5_bib12","series-title":"Proc. 4th European Workshop on Applications and Theory of Petri Nets","first-page":"188","article-title":"Maximally concurrent evolution of non-sequential systems","author":"Janicki","year":"1983"},{"article-title":"Rept. DAIMI MD-46","year":"1983","author":"Jensen","key":"10.1016\/0304-3975(86)90177-5_bib13"},{"key":"10.1016\/0304-3975(86)90177-5_bib14","series-title":"Proc. 1st European Conf. on Parallel and Distributed Processing","first-page":"51","article-title":"Petri nets and trace languages","author":"Knuth","year":"1979"},{"key":"10.1016\/0304-3975(86)90177-5_bib15","series-title":"Distributed Computing Systems: Synchronisation, Control and Communication","first-page":"109","article-title":"Computer system dossiers","author":"Lauer","year":"1983"},{"key":"10.1016\/0304-3975(86)90177-5_bib16","series-title":"Rept. ASM\/107","article-title":"User's introduction to BCS","author":"Lauer","year":"1983"},{"key":"10.1016\/0304-3975(86)90177-5_bib17","series-title":"Rept. ASM\/96","article-title":"The role of maximally concurrent simulation in the computer based analysis of distributed systems","author":"Lauer","year":"1982"},{"key":"10.1016\/0304-3975(86)90177-5_bib18","series-title":"Tech. Rept. TR-143","article-title":"Formal theory of the basic COSY notation","author":"Lauer","year":"1979"},{"key":"10.1016\/0304-3975(86)90177-5_bib19","first-page":"115","article-title":"Formal behavioural specifications of concurrent systems without globality assumptions","volume":"107","author":"Lauer","year":"1981"},{"key":"10.1016\/0304-3975(86)90177-5_bib20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF00266047","article-title":"COSY: A system specification language based on path expressions","volume":"12","author":"Lauer","year":"1979","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(86)90177-5_bib21","series-title":"Rept. DAIMI PB-78","article-title":"Concurrent Program Schemes and Their Interpretations","author":"Mazurkiewicz","year":"1977"},{"key":"10.1016\/0304-3975(86)90177-5_bib22","first-page":"115","article-title":"Traces, histories, graphs: Instances of a process monoid","volume":"176","author":"Mazurkiewicz","year":"1984"},{"key":"10.1016\/0304-3975(86)90177-5_bib23","article-title":"A Calculus for Communicating Systems","volume":"92","author":"Milner","year":"1980"},{"key":"10.1016\/0304-3975(86)90177-5_bib24","series-title":"Proc. 4th European Workshop on Application and Theory of Petri Nets","first-page":"229","article-title":"OVIDE, a software package for the validation of systems represented by Petri Net based models","author":"Montel","year":"1983"},{"issue":"3","key":"10.1016\/0304-3975(86)90177-5_bib25","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/356698.356702","article-title":"Petri nets","volume":"9","author":"Peterson","year":"1977","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0304-3975(86)90177-5_bib26","first-page":"250","article-title":"Subset languages of Petri nets","volume":"66","author":"Rozenberg","year":"1983"},{"key":"10.1016\/0304-3975(86)90177-5_bib27","first-page":"169","article-title":"On algorithmic properties of concurrent programs","volume":"125","author":"Salwicki","year":"1981"},{"key":"10.1016\/0304-3975(86)90177-5_bib28","first-page":"249","article-title":"Adequate path expressions","volume":"70","author":"Shields","year":"1979"},{"key":"10.1016\/0304-3975(86)90177-5_bib29_1","series-title":"Internal Rept. CSR-120-82","article-title":"Non-sequential behaviour 1","author":"Shields","year":"1982"},{"key":"10.1016\/0304-3975(86)90177-5_bib29_2","first-page":"229","volume":"167","author":"Shields","year":"1984"},{"key":"10.1016\/0304-3975(86)90177-5_bib30","series-title":"Internal Rept. CSR-92-81","article-title":"On the non-sequential behaviour of systems possessing a generalised free-choice property","author":"Shields","year":"1981"},{"key":"10.1016\/0304-3975(86)90177-5_bib31","doi-asserted-by":"crossref","first-page":"386","DOI":"10.4064\/fm-16-1-386-389","article-title":"Sur l'extension de l'ordre partial","volume":"16","author":"Szpilrajn","year":"1930","journal-title":"Fund. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901775?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901775?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:53:04Z","timestamp":1553172784000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586901775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":32,"alternative-id":["0304397586901775"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90177-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1986]]}}}