Abstract
Finally we discuss on going works. We are now updating a graphical tool for labeled transition systems and more intelligent equivalence checker for infinite processes. Where equivalence between two processes in different calculi are uniformly treated.
A process verifier and a process synthesizer are now implementing as well. The verifier verifies process w.r.t. formulae in Hennessy-Milner logic or μ-calculus, kinds of modal logic. The synthesizer generates the intended processes from their concrete properties expressed as formulae in the logic.
A part of this study is supported by Grants from the Asahi Glass Foundation and Science Grant from Min. of Education
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aceto, L., Bloom, B., Vaandrager, F., Turing SOS Rules in to Equations, Information and Computation, vol.111, pp.1–52, 1994.
Bergstra, J.A., Klop, J.W.: Algebra of communicating process, CWI Monographs, North-Holland (1986).
Bloon, B., Istrail, S., Meyer, A.R., Bisimulation can't be traced: Preliminary Report, in /POPL, pp.229–239, 1988
Boudol, G., Towards a lambda-calculus for concurrent and communicating systems, Lecture Notes in Computer Science, Vol.351, pp.149–161, 1989.
Brinksma, E.: A Tutorial on LOTOS, Proc. IFIP Workshop on Protocol Specification, Testing and Verification V, North-Holland (1986) pp.73–84.
Fokkink, W. J.: The Tyft/Tyxt Format Reduces to Tree Rules, Proc. of the 2nd International Symposium on Theoretical Aspects of Computer Software, Lecture Notes in Computer Science 789, Springer-Verlag (1994) pp.440–453.
Groote, J.F., Vaandrager, F.: Structured Operational Semantics and Bisimulation as a Congruence, Information and Computation 100 2 (1992) pp.202–260.
Hoare, C.A.R.: Communicating Sequential Process, Prentice Hall (1985).
Meseguer, J., Rewriting as a Unified Model of Concurrency, in Concur'90, 1990.
Milner, R., Parrow, J., Walker, D., A calculus of mobile processes, Part I and II, Reports ECS-LFCS-89-85 and-86, Laboratory for Foundations of Computer Science, University of Edinburgh, 1989.
Milner, R.: Communication and Concurrency, Prentice-Hall (1989).
Plotkin, G.D.: A Structural Approach to Operational Semantics, Computer Science Department, Aarhus University, DAIMI FN-19 (1981).
Thomsen, B., A calculus of higher order communicating systems, Principle of Programming Languagepp. 143–154, 1989.
Sen Yoshida, Atushi Togashi and Norio Shiratori: “Integrated Support Environment for Concurrent Process Calculi”, Proceeding of the ACM 13th Ann. Symposium on Principles of Distributed Computing, pp.395–395, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Togashi, A., Yoshida, S., Kimura, S., Shiratori, N. (1995). ProCSuS: A meta system for concurrent process calculi based on SOS. In: Ito, T., Yonezawa, A. (eds) Theory and Practice of Parallel Programming. TPPP 1994. Lecture Notes in Computer Science, vol 907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026572
Download citation
DOI: https://doi.org/10.1007/BFb0026572
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59172-6
Online ISBN: 978-3-540-49218-4
eBook Packages: Springer Book Archive