Synthesizing Distributed Finite-State Systems from MSCs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Synthesizing Distributed Finite-State Systems from MSCs

Source

Lecture Notes In Computer Science; Vol. 1877 archive
Proceedings of the 11th International Conference on Concurrency Theory table of contents

Pages: 521 - 535

Year of Publication: 2000

ISBN:3-540-67897-2

Authors

Publisher

Springer-Verlag London, UK

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 8

Additional Information:

cited by collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

CITED BY 8

	Dietrich Kuske, Regular sets of infinite message sequence charts, Information and Computation, v.187 n.1, p.80-109, November 25, 2003
	Markus Lohrey , Anca Muscholl, Bounded MSC communication, Information and Computation, v.189 n.2, p.160-181, March 15, 2004
	Rajeev Alur , Kousha Etessami , Mihalis Yannakakis, Inference of Message Sequence Charts, IEEE Transactions on Software Engineering, v.29 n.7, p.623-633, July 2003
	Markus Lohrey, Realizability of high-level message sequence charts: closing the gaps, Theoretical Computer Science, v.309 n.1, p.529-554, 2 December 2003
	Benoit Caillaud , Philippe Darondeau , Loïc Hélouët , Gilles Lesventes, HMSCs as partial specifications ... with PNs as completions, Modeling and verification of parallel processes, Springer-Verlag New York, Inc., New York, NY, 2001
	Jesper G. Henriksen , Madhavan Mukund , K. Narayan Kumar , Milind Sohoni , P. S. Thiagarajan, A theory of regular MSC languages, Information and Computation, v.202 n.1, p.1-38, October 10, 2005
	Blaise Genest , Anca Muscholl , Helmut Seidl , Marc Zeitoun, Infinite-state high-level MSCs: model-checking and realizability, Journal of Computer and System Sciences, v.72 n.4, p.617-647, June 2006
	Benedikt Bollig , Martin Leucker, Message-passing automata are expressively equivalent to EMSO logic, Theoretical Computer Science, v.358 n.2, p.150-172, 7 August 2006

Madhavan Mukund: colleagues

K. Narayan Kumar: colleagues

Milind A. Sohoni: colleagues