Abstract
We present a system (ECHIDNA) used to manipulate models of concurrent processes based on explicit choice higher dimensional automata. Such models are more suited to the full software engineering process than the older non-deterministic automata and higher dimensional automata, but manipulating them does require computer assistance. The conference presentation will include a detailed introduction to explicit choice higher dimensional automata as well as a description and demonstration of the system ECHIDNA.
The authors gratefully acknowledge the Australian Research Council (ARC) and the Microsoft Research Institute (MRI).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Buckland, Choice as a first class citizen. In Intensional Programming I, eds Orgun and Ashcroft, World Scientific, to appear
E. Goubault, Schedulers as abstract interpretations of HDA. ACM Proc. (1995) to appear
M. Johnson, The combinatorics of n-categorical pasting. Jour. Pure and Appl. Alg. 63 (1989) 211–225
V. Pratt, Modeling concurrency with geometry. in ACM Proc. POPL (1991) 311–322
R. Street, Parity complexes. Cahiers de Topol. et Geom. Categorique 32 (1991) 315–343
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buckland, R., Johnson, M. (1996). ECHIDNA: A system for manipulating explicit choice higher dimensional automata. In: Wirsing, M., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1996. Lecture Notes in Computer Science, vol 1101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014348
Download citation
DOI: https://doi.org/10.1007/BFb0014348
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61463-0
Online ISBN: 978-3-540-68595-1
eBook Packages: Springer Book Archive