On the expressiveness of higher dimensional automata: (Extended abstract)

Electronic Notes in Theoretical Computer Science

Volumn 128, Issue 2, 2005, Pages 5-34

  Van Glabbeek, R J ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Causality; Concurrency; Event structures; Expressiveness; Higher dimensional automata; History preserving bisimulation; Petri nets; ST bisimulation

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE; COMPUTER SIMULATION; MATHEMATICAL MODELS; PETRI NETS; SEMANTICS;

CASUALITY; CONCURRENCY EXPRESSIVENESS; EVENT STRUCTURES; HIGHER DIMENSIONAL AUTOMATA; HISTORY PRESERVING BISIMULATION; ST-BISIMULATION;

AUTOMATA THEORY;

EID: 15844396380     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.11.026     Document Type: Conference Paper

References (66)

1. J.C.M. Baeten, and W.P. Weijland Process Algebra Cambridge Tracts in Theoretical Computer Science 18 1990 Cambridge University Press
2. Bednarczyk, M., "Categories of asynchronous systems," Ph.D. thesis, Computer Science, University of Sussex, Brighton (1987)
3. Available at ftp://ftp.ipipan.gda.pl/marek/phd.ps.gz
4. 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)
5. Available at ftp://ftp.ipipan.gda.pl/marek/historie.ps.gz
6. E. Best, R. Devillers, A. Kiehn, and L. Pomello Concurrent bisimulations in Petri nets Acta Informatica 28 1991 231 264
7. G. Boudol Flow event structures and flow nets I. Guessarian Semantics of Systems of Concurrent Processes, Proceedings LITP Spring School on Theoretical Computer Science, La Roche Posay, France LNCS 469 1990 62 95
8. R.J. van Glabbeek An operational non-interleaved process graph semantics of CCSP (abstract) E.-R. Olderog U. Goltz R.J. van Glabbeek Combining Compositionality and Concurrency, Summary of a GMD-Workshop, Königswinter, March 1988 Arbeitspapiere der GMD 320 1988 18 19
9. Glabbeek, R.J. van, The refinement theorem for ST-bisimulation semantics, in: M. Broy and C.B. Jones, editors, Proceedings IFIP TC2 Working Conference on Programming Concepts and Methods, Sea of Gallilee, Israel (1990), pp. 27-52, available at http://kilby.stanford.edu/~rvg/pub/STbisimulation.pdf
10. R.J. van Glabbeek Bisimulations for higher dimensional automata email message (July 7, 1991), available at http://theory.stanford.edu/~rvg/hda
11. R.J. van Glabbeek History preserving process graphs draft, available at http://kilby.stanford.edu/~rvg/pub/history.draft.dvi 1996
12. R.J. van Glabbeek, and U. Goltz Refinement of actions and equivalence notions for concurrent systems Acta Informatica 37 2001 229 327 available at http://boole.stanford.edu/pub/refinement.ps.gz
13. th Annual IEEE Symposium on Logic in Computer Science, LICS'95, San Diego, USA 1995 199 209 available at http://boole.stanford.edu/pub/conf.ps.gz
14. th International Symposium on Mathematical Foundations of Computer Science, MFCS 2004, Prague, Czech Republic, LNCS (August 2004), available at http://boole.stanford.edu/pub/resolv.ps.gz
15. R.J. van Glabbeek, and F.W. Vaandrager Petri net models for algebraic theories of concurrency (extended abstract) J.W. de Bakker A.J. Nijman P.C. Treleaven Proceedings PARLE, Parallel Architectures and Languages Europe, Eindhoven, The Netherlands, June 1987, Vol. II: Parallel Languages LNCS 259 1987 224 242 available at http://kilby.stanford.edu/~rvg/pub/petri.pdf
16. R.J. van Glabbeek, and F.W. Vaandrager The difference between splitting in n and n + 1 Information and Computation 136 1997 109 142 available at http://boole.stanford.edu/pub/split.pdf
17. th International Conference on Concurrency Theory Marseille, France, September 2003 LNCS 2761 2003 57 71 available at http://boole.stanford.edu/pub/bundle.ps.gz
18. Langerak, R., "Transformations and Semantics for LOTOS," Ph.D. thesis, Department of Computer Science, University of Twente (1992)
19. J. Meseguer, U. Montanari, and V. Sassone On the semantics of Petri nets W. Cleaveland Proceedings CONCUR '92, Second International Conference on Concurrency Theory Stony Brook, NY, USA LNCS 630 1992 286 301
20. R. Milner A Calculus of Communicating Systems LNCS 92 1980 Springer
21. M. Nielsen, G.D. Plotkin, and G. Winskel Petri nets, event structures and domains, part I Theoretical Computer Science 13 1981 85 108
22. M. Nielsen, and G. Winskel Petri nets and bisimulation Theoretical Computer Science 153 1996 211 244
23. C. Papadimitriou The Theory of Database Concurrency Control 1986 Computer Science Press
24. Pratt, V.R., Modeling concurrency with geometry, in: Proc. 18th Ann. ACM Symposium on Principles of Programming Languages (1991), pp. 311-322, available at http://boole.stanford.edu/pub/cg.ps.gz
25. V.R. Pratt Chu spaces a summary and large collection of papers available at http://chu.stanford.edu/ 1993-2002
26. A. Rabinovich, and B.A. Trakhtenbrot Behavior structures and nets Fundamenta Informaticae 11 1988 357 404
27. Serre, J., Homology singulière des espaces fibrés. application, Ph.D. thesis, École Normale Supérieure (1951)
28. M.W. Shields Concurrent machines The Computer Journal 28 1985 449 465
29. E.W. Stark Concurrent transition systems Theoretical Computer Science 64 1989 221 269
30. G. Winskel Event structures W. Brauer W. Reisig G. Rozenberg Petri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, Part II; Proceedings of an Advanced Course, Bad Honnef, September 1986 LNCS 255 1987 325 392
31. G. Winskel An introduction to event structures J.W. de Bakker W.P.d. Roever G. Rozenberg REX School and Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, The Netherlands, May/June 1988 LNCS 354 1989 364 397
32. G. Winskel, and M. Nielsen Models for concurrency Handbook of Logic in Computer Science 1995 Oxford University Press 1 148
33. Buckland, R., Choice as a first class citizen, in: M. Orgun and E. Ashcroft, editors, Proceedings Intensional Programming I (1996), pp. 249-259
34. R. Buckland, M. Johnson, and D. Verity On the specification of higher dimensional automata Electronic Notes in Theoretical Computer Science 68 1 2002 1 11
35. G.L. Cattani, and V. Sassone Higher dimensional transition systems Proceedings LICS '96, Eleventh Annual IEEE Symposium on Logic in Computer Science New Brunswick, USA 1996 55 62 Available at ftp://ftp.cl.cam.ac.uk/users/ glc25/hdts.dvi.gz
36. R. Cridlig Semantic analysis of shared-memory concurrent languages using abstract model-checking Proceedings PEPM 1995, ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation La Jolla, USA, June 1995 1995 214 225 Available at http://portal.acm.org/citation.cfm?doid=215465.215577
37. R. Cridlig Implementing a static analyzer of concurrent programs: Problems and perspectives M. Dam Selected Papers of Analysis and Verification of Multiple-Agent Languages, 5th LOMAPS Workshop, Stockholm, Sweden, June 1996 LNCS 1192 1997 244 259
38. R. Cridlig, and E. Goubault Semantics and analysis of Linda-based languages Proceedings WSA '93, 3rd International Workshop on Static Analysis Padova, Italy, September 1993 LNCS 724 1993 72 86 Available from http://www.di.ens.fr/~goubault/GOUBAULTpapers.html
39. L. Fajstrup Loops, ditopology and deadlocks Mathematical Structures in Computer Science 10 4 2000 459 480
40. L. Fajstrup, E. Goubault, and M. Raussen Detecting deadlocks in concurrent systems D. Sangiorgi R. de Simone Proceedings CONCUR '98, 9th International Conference on Concurrency Theory Nice, France, September 1998 LNCS 1466 1998 332 347 Available from http://www.di.ens.fr/~goubault/GOUBAULTpapers. html
41. P. Gaucher From concurrency to algebraic topology Electronic Notes in Theoretical Computer Science 39 2 2000 Available at http://www.pps.jussieu.fr/ ~gaucher/expose.ps.gz
42. P. Gaucher Homotopy invariants of higher dimensional categories and concurrency in computer science Mathematical Structures in Computer Science 10 4 2000 481 524 Available at http://www.pps.jussieu.fr/~gaucher/homotopie_cat.ps. gz
43. P. Gaucher Combinatorics of branchings in higher dimensional automata Theory and Applications of Categories 8 12 2001 324 376 Available at http://www.pps.jussieu.fr/~gaucher/coin.ps.gz
44. P. Gaucher About the globular homology of higher dimensional automata Cahiers de Topologie et Géométrie Différentielle Catégoriques XLIII 2 2002 107 156 At http://www.pps.jussieu.fr/~gaucher/ sglob.ps.gz
45. P. Gaucher Investigating the algebraic structure of dihomotopy types Electronic Notes in Theoretical Computer Science 52 2 2002 Available at http://www.pps.jussieu.fr/~gaucher/dihomotopy.ps.gz
46. P. Gaucher The branching nerve of HDA and the Kan condition Theory and Applications of Categories 11 3 2003 75 106 Available at http://www.pps.jussieu. fr/~gaucher/fibrantcoin.ps.gz
47. P. Gaucher A model category for the homotopy theory of concurrency Homology, Homotopy and Applications 5 1 2003 549 599 Available at http://www.pps.jussieu.fr/~gaucher/modelflow.ps.gz
48. P. Gaucher, and E. Goubault Topological deformation of higher dimensional automata Homology, Homotopy and Applications 5 2 2003 39 82 Available at http://www.pps.jussieu.fr/~gaucher/diCW.ps.gz
49. E. Goubault Domains of higher-dimensional automata E. Best Proceedings CONCUR '93, 4th International Conference on Concurrency Theory Hildesheim, Germany, August 1993 LNCS 715 1993 293 307 Available from http://www.di.ens.fr/ ~goubault/GOUBAULTpapers.html
50. Goubault, E., The geometry of concurrency, Ph.D. thesis, École Normale Supérieure (1995), http://www.di.ens.fr/~goubault/papers/these. ps.gz
51. E. Goubault Schedulers as abstract interpretations of higher-dimensional automata Proceedings PEPM 1995, ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation La Jolla, USA, June 1995 1995 134 145 Available from http://www.di.ens.fr/~goubault/GOUBAULTpapers.html
52. E. Goubault Durations for truly-concurrent actions H.R. Nielson Proceedings Programming Languages and Systems - ESOP'96, 6th European Symposium on Programming Linköping, Sweden, April 1996 LNCS 1058 1996 173 187 available as Transitions take time from http://www.di.ens.fr/~goubault/ GOUBAULTpapers.html
53. Goubault, E., A semantic view on distributed computability and complexity, in: Proceedings 3rd Theory and Formal Methods Workshop (1996). Available from http://www.di.ens.fr/~goubault/GOUBAULTpapers.html
54. E. Goubault Geometry and concurrency: a user's guide Mathematical Structures in Computer Science 10 4 2000 411 425 Available from http://www.di.ens.fr/~goubault/GOUBAULTpapers.html
55. E. Goubault Cubical sets are generalized transition systems (2002) available from http://www.di.ens.fr/~goubault/GOUBAULTpapers.html
56. E. Goubault, and T.P. Jensen Homology of higher dimensional automata R. Cleaveland Proceedings CONCUR '92, Third International Conference on Concurrency Theory Stony Brook, NY, USA, August 1992 LNCS 630 1992 254 268 Available from http://www.di.ens.fr/~goubault/GOUBAULTpapers.html
57. E. Goubault, and M. Raussen Dihomotopy as a tool in state space analysis Proceedings LATIN '02, 5th Latin American Symposium on Theoretical Informatics, Cancun, Mexico 2002 16 37 Available from http://www.di.ens.fr/~goubault/ GOUBAULTpapers.html
58. J. Gunawardena Homotopy and concurrency Bulletin of the EATCS 54 1994 184 193 also in G. Paun G. Rozenberg A. Salomaa Current trends in Theoretical Computer Science: Entering the 21st Century 2001 World Scientific Available at http://www.jeremy-gunawardena.com/papers/hac.pdf
59. Lanzmann, E., Automates d'ordre supérieur, Master's thesis, Université d'Orsay (1993)
60. V.R. Pratt Higher dimensional automata revisited Mathematical Structures in Computer Science 10 4 2000 525 548 Available at http://boole.stanford.edu/ pub/hda.ps.gz
61. V.R. Pratt Transition and cancellation in concurrency and branching time Mathematical Structures in Computer Science 13 4 2003 485 529 Available at http://boole.stanford.edu/pub/seqconc.ps.gz
62. M. Raussen On the classification of dipaths in geometric models for concurrency Mathematical Structures in Computer Science 10 4 2000 427 457
63. S. Sokolowski A case for po-manifolds: in chase after a good topological model for concurrency Electronic Notes in Theoretical Computer Science 81 2003 at ftp://ftp.ipipan.gda.pl/stefan/reports/73-pomanif.ps.gz
64. Takayama, Y., Parallelization of concurrent processes in higher dimensional automata, in: Proceedings RIMS Workshop on Term Rewriting Systems and its Applications, RIMS Kyoto University, 1995
65. Y. Takayama Extraction of concurrent processes from higher dimensional automata H. Kirchner Proceedings CAAP '96, 21st International Colloquium on Trees in Algebra and Programming Linköping, Sweden, April 1996 LNCS 1059 1996 72 86
66. Takayama, Y., Towards cycle filling as parallelization, in: Proceedings 4th International RIMS Workshop on Concurrency Theory and Applications, RIMS Kyoto University, 1996