Abstract
We introduce the WIre CalCulus Application (WiCcA), a tool for generating and operating on labelled transition systems (LTS) that result from wire-calculus specifications. The theory behind WiCcA is explained and its uses demonstrated.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, PODC 1983, pp. 228–240. ACM, New York (1983)
Metamata. Javacc, http://javacc.java.net/
Sun Microsystems. Java, http://www.java.com/en/
AT&T research and the open source community. Graphviz, http://www.graphviz.org/
Sobociński, P.: A non-interleaving process calculus for multi-party synchronisation. In: ICE 2009 (2009)
Sobociński, P.: Representations of Petri net interactions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 554–568. Springer, Heidelberg (2010)
Sokolsky, O., Cleaveland, R.: Equivalence and preorder checking for finite-state systems (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lantair, J., Sobociński, P. (2011). WiCcA : LTS Generation Tool for Wire Calculus. In: Corradini, A., Klin, B., Cîrstea, C. (eds) Algebra and Coalgebra in Computer Science. CALCO 2011. Lecture Notes in Computer Science, vol 6859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22944-2_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-22944-2_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22943-5
Online ISBN: 978-3-642-22944-2
eBook Packages: Computer ScienceComputer Science (R0)