Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP-Reference-Cited by-同舟云学术

Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP

Published:2005 Issue: Volume: Page:263-277
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Fröschle Sibylle,Lasota Sławomir

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11539452_22

Reference20 articles.

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Co, Reading (1974)

2. Bednarczyk, M.: Hereditary history preserving bisimulation or what is the power of the future perfect in program logics. Technical report, Polish Academy of Sciences, Gdansk (1991)

3. Christensen, S.: Decidability and Decomposition in process algebras. PhD thesis, Dept. of Computer Science, University of Edinburgh, UK (1993)

4. Lecture Notes in Computer Science;J. Esparza,1995

5. Fröschle, S.: Decidability of plain and hereditary history-preserving bisimulation for BPP. In: Proc. EXPRESS 1999. ENTCS, vol. 27 (1999)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Characterising spectra of equivalences for event structures, logically;Information and Computation;2022-05

2. A study on team bisimulation and H-team bisimulation for BPP nets;Theoretical Computer Science;2022-01

3. Team bisimilarity, and its associated modal logic, for BPP nets;Acta Informatica;2020-03-13

4. Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems;Lecture Notes in Computer Science;2015

5. Event Identifier Logic;Mathematical Structures in Computer Science;2013-09-27