The MSO theory of connectedly communicating processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3821 LNCS, Issue , 2005, Pages 201-212

  Madhusudan, P ^a   Thiagarajan, P S ^b   Yang, Shaofa ^b  

^a University of Illinois ^*  (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTEDLY COMMUNICATING PROCESSES (CCP); MONADIC SECOND ORDER (MSO) THEORY; PARTIALLY ORDERED EXECUTION; SEQUENTIAL PROCESSES;

COMPUTER SCIENCE; INFORMATION DISSEMINATION; LINEARIZATION; PROBLEM SOLVING; SPECIFICATIONS; TELECOMMUNICATION SYSTEMS;

COMPUTATION THEORY;

EID: 33744923192     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11590156_16     Document Type: Conference Paper

References (15)

1. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
2. P. Gastin, B. Lerman, and M. Zeitoun. Distributed games with causal memory are decidable for series-parallel systems. In FSTTCS '04, LNCS 3328, pages 275-286. Springer, 2004.
3. D. Kuske. Regular sets of infinite message sequence charts. Information and Computation, 187:80-109, 2003.
4. P. Madhusudan. Reasoning about sequential and branching behaviours of message sequence graphs. In ICALP '00, LNCS 2076, pages 396-4071 Springer, 2000.
5. P. Madhusudan. Model-checking trace event structures. In LICS '03, pages 371-380. IEEE Press, 2003.
6. P. Madhusudan and P.S. Thiagarajan. Controllers for discrete event systems via morphisms. In CONCUR '98, LNCS 1466, pages 18-33. Springer, 1998.
7. P. Madhusudan and P.S. Thiagarajan. Distributed control and synthesis for local specifications. In ICALP '01, LNCS 2076, pages 396-407. Springer, 2001.
8. P. Madhusudan and P.S. Thiagarajan. A decidable class of asynchronous distributed controllers. In CONCUR '02, LNCS 2421, pages 145-160. Springer, 2002.
9. W. Penczek. Model-checking for a subclass of event structures. In TACAS '97, LNCS 1217, pages 146-164. Springer, 1997.
10. A. Pnueli and R. Rosner. Distributed reactive systems are hard to synthesize. In FOCS '90, pages 746-757. IEEE Press, 1990.
11. M. Rabin. Decidability of second order theories and automata on infinite trees. Trans. of AMS, 141:1-35, 1969.
12. W. Thomas. Automata on infinite objects. In Handbook of Theoretical Comp. Sci., Vol. B. Elsevier, 1990.
13. S. Tripakis. Decentralized control of discrete event systems with bounded or unbounded delay communication. IEEE Trans. on Automatic Control, 49:1489-1501, 2004.
14. I. Walukiewicz and S. Mohalik. Distributed games. In FSTTCS '03, LNCS 2914, pages 338-351. Springer, 2003.
15. G. Winskel and M. Nielsen. Models for concurrency. In Handbook of Logic in Comp. Sci., Vol. 3. Oxford University Press, 1994.