L. Ya. Rosenblum and A.V. Yakovlev.
\nSignal graphs: from self-timed to timed ones,
\nProc. of the Int. Workshop on Timed Petri Nets,
\nTorino, Italy, July 1985, IEEE Computer Society Press, NY, 1985, pp. 199-207.<\/p>\n
https:\/\/www.staff.ncl.ac.uk\/alex.yakovlev\/home.formal\/LR-AY-TPN85.pdf<\/a><\/p>\n A paper establishing interesting relationship between the interleaving and true causality semantics https:\/\/www.staff.ncl.ac.uk\/alex.yakovlev\/home.formal\/lattices-Bul-EATCS-37-Feb-1989.pdf<\/a><\/p>\n Paper about the so called symbolic STGs, in which signals can have multiple values (which is often convenient for specifications of control at a more abstract level than dealing with binary signals) and hence in order to implement them in logic gates one needs to solve the problem of binary expansion or encoding, as well as resolve all the state coding issues on the way of synthesis of circuit implementation.<\/p>\n https:\/\/www.staff.ncl.ac.uk\/alex.yakovlev\/home.formal\/async-des-methods-Manchester-1993-SymbSTG-yakovlev.pdf<\/a><\/p>\n Paper about analysing concurrency semantics using relation-based approach. Similar techniques are now being developed in the domain of business process modelling and work-flow analysis: L.Ya. Rosenblum and A.V. Yakovlev. Analysing semantics of concurrent hardware specifications. Proc. Int. Conf. on Parallel Processing (ICPP89), Pennstate University Press, University Park, PA, July 1989, pp. 211-218, Vol.3<\/p>\n https:\/\/www.staff.ncl.ac.uk\/alex.yakovlev\/home.formal\/LR-AY-ICPP89.pdf<\/a><\/p>\n \u041c\u043e\u0434\u0435\u043b\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435 \u043f\u0430\u0440\u0430\u043b\u043b\u0435\u043b\u044c\u043d\u044b\u0445 \u043f\u0440\u043e\u0446\u0435\u0441\u0441\u043e\u0432. \u0421\u0435\u0442\u0438 \u041f\u0435\u0442\u0440\u0438 [\u0422\u0435\u043a\u0441\u0442] : \u043a\u0443\u0440\u0441 \u0434\u043b\u044f \u0441\u0438\u0441\u0442\u0435\u043c\u043d\u044b\u0445 \u0430\u0440\u0445\u0438\u0442\u0435\u043a\u0442\u043e\u0440\u043e\u0432, \u043f\u0440\u043e\u0433\u0440\u0430\u043c\u043c\u0438\u0441\u0442\u043e\u0432, \u0441\u0438\u0441\u0442\u0435\u043c\u043d\u044b\u0445 \u0430\u043d\u0430\u043b\u0438\u0442\u0438\u043a\u043e\u0432, \u043f\u0440\u043e\u0435\u043a\u0442\u0438\u0440\u043e\u0432\u0449\u0438\u043a\u043e\u0432 \u0441\u043b\u043e\u0436\u043d\u044b\u0445 \u0441\u0438\u0441\u0442\u0435\u043c \u0443\u043f\u0440\u0430\u0432\u043b\u0435\u043d\u0438\u044f \/ \u041c\u0430\u0440\u0430\u0445\u043e\u0432\u0441\u043a\u0438\u0439 \u0412. \u0411., \u0420\u043e\u0437\u0435\u043d\u0431\u043b\u044e\u043c \u041b. \u042f., \u042f\u043a\u043e\u0432\u043b\u0435\u0432 \u0410. \u0412. – \u0421\u0430\u043d\u043a\u0442-\u041f\u0435\u0442\u0435\u0440\u0431\u0443\u0440\u0433 : \u041f\u0440\u043e\u0444\u0435\u0441\u0441\u0438\u043e\u043d\u0430\u043b\u044c\u043d\u0430\u044f \u043b\u0438\u0442\u0435\u0440\u0430\u0442\u0443\u0440\u0430, 2014. – 398 \u0441. : \u0438\u043b., \u0442\u0430\u0431\u043b.; 24 \u0441\u043c. – (\u0421\u0435\u0440\u0438\u044f “\u0418\u0437\u0431\u0440\u0430\u043d\u043d\u043e\u0435 Computer Science”).; ISBN 978-5-9905552-0-4 https:\/\/www.researchgate.net\/…\/Simulation-of-Concurrent-Processes-Petri-Nets.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":" L. Ya. Rosenblum and A.V. Yakovlev. Signal graphs: from self-timed to timed ones, Proc. of the Int. Workshop on Timed Petri Nets, Torino, Italy, July 1985, IEEE Computer Society Press, NY, 1985, pp. 199-207. https:\/\/www.staff.ncl.ac.uk\/alex.yakovlev\/home.formal\/LR-AY-TPN85.pdf A paper establishing interesting relationship … Continue reading
\nusing algebraic lattices. It also identifies an connection between the classes of lattices and the property
\nof generalisability of concurrency relations (from arity N to arity N+1),
\ni.e. the conditions for answering the question such as,
\nif three actions A, B and C are all pairwise concurrent, i.e. ||(A,B), ||(A,C), and ||(B,C), are they concurrent “in three”, i.e. ||(A,B,C)?
\nL. Rosenblum, A. Yakovlev, and V. Yakovlev.
\nA look at concurrency semantics through “lattice glasses”.
\nIn Bulletin of the EATCS (European Association for Theoretical Computer Science), volume 37, pages 175-180, 1989.<\/p>\n
\n(\u0421\u0435\u0440\u0438\u044f “\u0418\u0437\u0431\u0440\u0430\u043d\u043d\u043e\u0435 Computer Science”)<\/p>\n