Decidability of plain and hereditary history-preserving bisimilarity for BPP

Electronic Notes in Theoretical Computer Science

Volumn 27, Issue , 1999, Pages 85-106

  Fröschle, Sibylle ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CONCURRENT ENGINEERING; FINITE AUTOMATA; PROBLEM SOLVING; SEMANTICS; THEOREM PROVING;

BASIC PARALLEL PROCESSES (BPP); BISIMULATIONS; HISTORY-PRESERVING BISIMILARITY (HPB); INFINITE-STATE SYSTEMS;

PARALLEL PROCESSING SYSTEMS;

EID: 13844294742     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80297-X     Document Type: Conference Paper

References (30)

1. Aceto L. History preserving, causal and mixed-ordering equivalence over stable event structures. Fund. Inform. 17:1992;319-331
2. Aceto L. Relating distributed, temporal and causal observations of simple processes. Fundamenta Informaticae. 17:1992;369-397
3. 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
4. Best E., Devillers R., Kiehn A., Pomello L. Concurrent bisimulations in Petri nets. Acta Inform. 28:1991;231-264
5. Castellani I. "Bisimulations for Concurrency," Ph.D. thesis, University of Edinburgh. 1988
6. Castellani I., Hennessy M. Distributed bisimulations. Journal of the ACM. 36:1989;887-911
7. Christensen S. Distributed bisimularity is decidable for a class of infinite state-space systems. CONCUR' 92 (Stony Brook, NY, 1992). 1992;148-161 Springer, Berlin
8. Christensen S. "Decidability and Decomposition in Process Algebras," Ph.D. thesis, University of Edinburgh. 1993
9. Christensen S., Hirshfeld Y., Moller F. Bisimulation equivalence is decidable for basic parallel processes. CONCUR '93 (Hildesheim 1993). 1993;143-157 Springer, Berlin
10. Degano P., De Nicola R., Montanari U. Partial orderings descriptions and observations of nondeterministic concurrent processes. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS. 354:1989;438-466
11. Engelfriet J. Branching processes of Petri nets. Acta Inform. 28:1991;575-591
12. Esparza J. Petri nets, commutative context-free grammars, and basic parallel processes. Fund. Inform. 31:1997;13-25
13. Esparza, J. and A. Kiehn, On the model checking problem for branching time logics and basic parallel processesin: Proceedings of Computer Aided Verification (CAV '95), 7th International Conference, Springer, Berlin, 1995 pp. 353-366.
14. Fröschle S. On the decidability problem of strong history-preserving bisimulation, progress Report. 1998
15. Fröschle S., Hildebrandt T. On plain and hereditary history-preserving bisimulation, to appear at MFCS'99. 1999
16. Gorrieri R., Montanari U. SCONE: a simple calculus ofnets. CONCUR' 90 (Amsterdam, 1990). 1990;2-30 Springer, Berlin
17. Jategaonkar L., Meyer A.R. Deciding true concurrency equivalences on safe, finite nets. Theoret. Comput. Sci. 154:1996;107-143
18. Joyal A., Nielsen M., Winskel G. Bisimulation from open maps. Inform. and Comput. 127:1996;164-185
19. Jurdziński M., Nielsen M. Hereditary history preserving bisimilarity is undecidable. Research Series RS-99-19, BRICS, Department of Computer Science, University of Aarhus. 1999;., 18 pp.
20. Jurdziński M., Nielsen M. Hereditary history preserving simulation is undecidable. Research Series RS-99-1, BRICS, Department of Computer Science, University of Aarhus. 1999;., 15 pp.
21. Kiehn A. A note on distributed bisimulations. 1999
22. Kiehn A., Hennessy M. On the decidability of non-interleaving process equivalences. in: CONCUR '94: concurrency theory (Uppsala, 1994). 1994;18-33 Springer, Berlin
23. Moller F. Infinite results. CONCUR '96: concurrency theory (Pisa). 1996;195-216 Springer, Berlin
24. Montanari U., Pistore M. Minimal transition systems for history-preserving bisimulation. STACS 97 (Lübeck). 1997;413-425 Springer, Berlin
25. Nielsen M., Plotkin G., Winskel G. Petri nets, event structures and domains. I. Theoret. Comput. Sci. 13:1981;85-108
26. Rabinovich A., Trakhtenbrot B.A. Behavior structures and nets. Fund. Inform. 11:1988;357-403. concurrency
27. Sunesen K., Nielsen M. Behavioural equivalence for infinite systems - partially decidable. in: Application and theory of Petri nets 1996 (Osaka, 1996). 1996;460-479 Springer, Berlin
28. van Glabbeek R., Goltz U. Equivalence notions for concurrent systems and refinement of actions (extended abstract). Mathematical foundations of computer science 1989 (Porpolhk abka-Kozubnik, 1989), Lecture Notes in Comput. Sci. 379:1989;237-248 Springer, Berlin
29. Vogler W. Deciding history preserving bisimilarity. Automata, languages and programming (Madrid, 1991), Lecture Notes in Comput. Sci. 510:1991;495-505 Springer, Berlin
30. Vogler W. Generalized OM-bisimulation. Inform. and Comput. 118:1995;38-47