Comparing transition systems with independence and asynchronous transition systems

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

Volumn 1119, Issue , 1996, Pages 84-97

  Hildebrandt, Thomas T ^a   Sassone, Vladimiro ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ASYNCHRONOUS TRANSITION SYSTEM; TRANSITION SYSTEM;

ARTIFICIAL INTELLIGENCE;

EID: 84955610740     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61604-7_49     Document Type: Conference Paper

References (21)

1. M.A. BEDNARCZYK. Categories of asynchronous systems PhD thesis in Computer Science, University of Sussex (1988), report no. 1/88.
2. J.M.C. BAETEN and W.P. WEIJLAND. Process Algebra Cambridge Tracts in Theoretical Computer Science, 18 (1990), Cambridge University Press.
3. G-L. CATTANI and V. SASSONE. Higher Dimensional Transition Systems, To appear in Proceedings of LICS 96 (1996), IEEE Computer Society Press.
4. R. VAN GLABBEEK. Bisimulations for higher dimensional automata, email message sent to the Concurrency mailing list on July 7, 1991. Available at http://theory.stanford.edu/people/rvg/hda.
5. R. VAN GLABBEEK and G. PLOTKIN. Configuration Structures. In Proceedings of LICE'95, D. Kozen (Ed.), IEEE Computer Society Press (1995), 99-109.
6. E. GOUHAULT. Domains of Higher-Dimensional Automata. In Proceedings ot CONCUR'93, E. Best (Ed.), LNCS 715 (1993), Springer-Verlag, 293-307.
7. E. GOUBAULT and T. JENSEN. Homology of Higher-Dimensional Automata. In Proceedings os CONCUR'92, W.R. Cleaveland (Ed.), LNCS 630 (1992), Springer-Verlag, 254-268.
8. P. GODEFROID and P. WOLPER. Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties, In Proceedings os CAV'91, K.G. Larsen et al. (Eds.), LNCS 575 (1991), Springer-Verlag, 332-342.
9. M. HENNESSY. Algebraic Theory of Processes. Series in the Foundations of Computing (1988), The MIT Press.
10. C.A.R. HOARE. Communicating Sequential Processes. Series in Computer Science (1985), Prentice-Hall.
11. R. MILNER. Communication and Concurrency. Series in Computer Science (1989), Prentice Hall.
12. R. MILNER. The polyadic π-calcalns: a tutorial. In Logic and Algebra os Specification, F.L. Bauer et al. (Eds.), Springer-Verlag, (1993).
13. M. MUKUND. Petri Nets and Step Transition Systems. International Journal os Foundations of Computer Science, vol. 3, n. 4 (1992), 443-478.
14. M. MUKUND and M. NIELSEN. CCS, Locations and Asynchronous Transition Systems In Proceedings os & TCS'92, R. Shyamasundar (Ed.), LNCS n. 652 (1992), Springex-Verlag, 328-341.
15. M. NIELSEN, V. SASSONE and G. WINSKEL. Relationships between Models of Concurrency, In Proceedings of REX'93. A Decade of Concurrency: Reflections and Perspectives, LNCS n. 803, (1994), J.W. de Bakker et al. (Eds.), Springer-Verlag, 425-476.
16. D. PELED. All from One, One for All: On Model Checking Using Representafives, In Proceedings os CAV'93, C. Courcoubetis (Ed.), LNCS n. 697 (1993), Springer-Verlag, 409-423.
17. V. PRATT. Modelling Concurrency with Geometry. In Proceedings of 18th ACM Symposium on Principles of Programming Languages, ACM Press, (1991), 311-322.
18. V. SASSONE, M. NIELSEN, and G. WINSKEL. Models for Concurrency: Towards a Classification. To appear in Theoretical Computer Science. An extended abstract appears as 'A Classification of Models for Concurrency' in Proceedings of CONCUR'93, E. Best (Ed.), LNCS 715 (1993), Springer-Verlag, 82-96.
19. M.W. SHIELDS. Concurrent machines Theoretical Computer Science n.28 (1985), 449-465.
20. A. VALMARI. A Stubborn attack on state explosion, In Proceedings of CAV'90, DIMACS Series n. 3 (1991), 25-42.
21. G. WINSKEL and U. NIELSEN. Models for Concurrency In Handbook of Logic and the Foundations of Computer Science, vol. 4, S. Abramsky et al. (Eds.), Oxford University Press, 1995.