Basic process algebra with deadlocking states

Theoretical Computer Science

Volumn 266, Issue 1-2, 2001, Pages 605-630

  Wu, Ying ^a   El Fakhry, Youssef ^a   Sereno, Denis ^a   Tamar, Samira ^a   Papadopoulou, Barbara ^a  

^a LAVAL UNIVERSITY   (Canada)

Author keywords

Bisimulation; BPA; Deadlocks; Process algebra; Regularity

Indexed keywords

ALGEBRA; COMPUTER SYSTEM RECOVERY; CONTEXT FREE GRAMMARS; GRAPH THEORY;

DEADLOCKING STATES;

COMPUTER SCIENCE;

EID: 0035817844     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00290-5     Document Type: Article

References (25)

1. Decidability of bisimulation equivalence for processes generating context-free languages
2. Decidability of bisimulation equivalence for processes generating context-free languages
3. On formal properties of simple phrase structure grammmars
4. Algebra of communicating processes with abstraction
5. An elementary decision procedure for arbitrary context-free processes
6. Bisimulation collapse and the process taxonomy
7. Bisimulation equivalence is decidable for all context-free processes
8. Bisimulation equivalence is decidable for all context-free processes
9. A short proof of the decidability of bisimulation for normed BPA processes
10. Undecidable equivalences for basic process algebra
11. Decidability results in automata and process theory
12. Actions speak louder than words: Proving bisimilarity for context-free processes
13. P
14. Undecidability of bisimilarity for Petri nets and some related problems
15. Bisimulation equivalence is decidable for One-counter processes
16. Deciding finiteness of Petri nets up to bisimilarity
17. Regularity is decidable for normed PA processes in polynomial time
18. Infinite results
19. Concurrency and automata on infinite sequences
20. The Linear Time - Branching time spectrum