Standard

Configuration- and residual-based transition systems for event structures with asymmetric conflict. / Best, Eike; Gribovskaya, Nataliya; Virbitskaite, Irina.

SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. ред. / B Steffen; C Baier; M VanDenBrand; J Eder; M Hinchey; T Margaria. Springer-Verlag GmbH and Co. KG, 2017. стр. 132-146 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10139 LNCS).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференцийстатья в сборнике материалов конференциинаучнаяРецензирование

Harvard

Best, E, Gribovskaya, N & Virbitskaite, I 2017, Configuration- and residual-based transition systems for event structures with asymmetric conflict. в B Steffen, C Baier, M VanDenBrand, J Eder, M Hinchey & T Margaria (ред.), SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 10139 LNCS, Springer-Verlag GmbH and Co. KG, стр. 132-146, 43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017, Limerick, Ирландия, 16.01.2017. https://doi.org/10.1007/978-3-319-51963-0_11

APA

Best, E., Gribovskaya, N., & Virbitskaite, I. (2017). Configuration- and residual-based transition systems for event structures with asymmetric conflict. в B. Steffen, C. Baier, M. VanDenBrand, J. Eder, M. Hinchey, & T. Margaria (Ред.), SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings (стр. 132-146). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10139 LNCS). Springer-Verlag GmbH and Co. KG. https://doi.org/10.1007/978-3-319-51963-0_11

Vancouver

Best E, Gribovskaya N, Virbitskaite I. Configuration- and residual-based transition systems for event structures with asymmetric conflict. в Steffen B, Baier C, VanDenBrand M, Eder J, Hinchey M, Margaria T, Редакторы, SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Springer-Verlag GmbH and Co. KG. 2017. стр. 132-146. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-51963-0_11

Author

Best, Eike ; Gribovskaya, Nataliya ; Virbitskaite, Irina. / Configuration- and residual-based transition systems for event structures with asymmetric conflict. SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Редактор / B Steffen ; C Baier ; M VanDenBrand ; J Eder ; M Hinchey ; T Margaria. Springer-Verlag GmbH and Co. KG, 2017. стр. 132-146 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{e51d422dd5654afd9aaa6d912e2a227c,
title = "Configuration- and residual-based transition systems for event structures with asymmetric conflict",
abstract = "In order to associate a transition system with an event structure, it is customary to use configurations, constructing a transition system by repeatedly adding executable events. It is also possible to use residuals, constructing a transition system by repeatedly deleting nonexecutable events. The present paper proposes a systematic investigation of how the two methods are interrelated. The focus will be on asymmetric versions of prime, bundle, and dual event structures. For each of them, configuration-based and residual-based transition system semantics will be defined. The pairwise bisimilarity of the resulting transition systems will be proved, considering interleaving, multiset, and pomset semantics.",
keywords = "Bisimilarity, Event structures with asymmetric conflict, Interleaving/Multiset/Pomset semantics, Labelled transition systems, PETRI NETS, CONCURRENCY",
author = "Eike Best and Nataliya Gribovskaya and Irina Virbitskaite",
year = "2017",
month = jan,
day = "1",
doi = "10.1007/978-3-319-51963-0_11",
language = "English",
isbn = "9783319519623",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "132--146",
editor = "B Steffen and C Baier and M VanDenBrand and J Eder and M Hinchey and T Margaria",
booktitle = "SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE",
address = "Germany",
note = "43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017 ; Conference date: 16-01-2017 Through 20-01-2017",

}

RIS

TY - GEN

T1 - Configuration- and residual-based transition systems for event structures with asymmetric conflict

AU - Best, Eike

AU - Gribovskaya, Nataliya

AU - Virbitskaite, Irina

PY - 2017/1/1

Y1 - 2017/1/1

N2 - In order to associate a transition system with an event structure, it is customary to use configurations, constructing a transition system by repeatedly adding executable events. It is also possible to use residuals, constructing a transition system by repeatedly deleting nonexecutable events. The present paper proposes a systematic investigation of how the two methods are interrelated. The focus will be on asymmetric versions of prime, bundle, and dual event structures. For each of them, configuration-based and residual-based transition system semantics will be defined. The pairwise bisimilarity of the resulting transition systems will be proved, considering interleaving, multiset, and pomset semantics.

AB - In order to associate a transition system with an event structure, it is customary to use configurations, constructing a transition system by repeatedly adding executable events. It is also possible to use residuals, constructing a transition system by repeatedly deleting nonexecutable events. The present paper proposes a systematic investigation of how the two methods are interrelated. The focus will be on asymmetric versions of prime, bundle, and dual event structures. For each of them, configuration-based and residual-based transition system semantics will be defined. The pairwise bisimilarity of the resulting transition systems will be proved, considering interleaving, multiset, and pomset semantics.

KW - Bisimilarity

KW - Event structures with asymmetric conflict

KW - Interleaving/Multiset/Pomset semantics

KW - Labelled transition systems

KW - PETRI NETS

KW - CONCURRENCY

UR - http://www.scopus.com/inward/record.url?scp=85010644395&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-51963-0_11

DO - 10.1007/978-3-319-51963-0_11

M3 - Conference contribution

AN - SCOPUS:85010644395

SN - 9783319519623

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 132

EP - 146

BT - SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE

A2 - Steffen, B

A2 - Baier, C

A2 - VanDenBrand, M

A2 - Eder, J

A2 - Hinchey, M

A2 - Margaria, T

PB - Springer-Verlag GmbH and Co. KG

T2 - 43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017

Y2 - 16 January 2017 through 20 January 2017

ER -

ID: 10314121