SCOPUS 정보 검색 플랫폼

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 321-330

Uniform distributed synthesis

(2) Finkbeiner, Bernd a Schewe, Sven a

a SAARLAND UNIVERSITY (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE-STATE DISTRIBUTED SYSTEMS; FINITE-STATE PROGRAMS; INFORMATION FORKS; TEMPORAL SPECIFICATIONS;

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTER ARCHITECTURE; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER PROGRAMMING; GRAPH THEORY; PROBLEM SOLVING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 26844538113 PISSN: 10436871 EISSN: None Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper

Times cited : (159)

References (11)

1
- 85037030721
- Design and synthesis of synchronization skeletons using branching time temporal logic
- Proc. IBM Workshop on Logics of Programs, Springer-Verlag
- E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. IBM Workshop on Logics of Programs, volume 131 of LNCS, pages 52-71. Springer-Verlag, 1981.
- (1981) LNCS , vol.131 , pp. 52-71
- Clarke, E.M.¹ Emerson, E.A.²

2
- 0001840420
- Automata, trees and games
- Y. Gurevich and L. Harrington. Automata, trees and games. In Proc. STOC'82, pages 60-65, 1982.
- (1982) Proc. STOC'82 , pp. 60-65
- Gurevich, Y.¹ Harrington, L.²

3
- 84944078394
- Small progress measures for solving parity games
- Proc. STACS'00, Springer-Verlag
- M. Jurdziński. Small progress measures for solving parity games. In Proc. STACS'00, volume 1770 of LNCS, pages 290-301. Springer-Verlag, 2000.
- (2000) LNCS , vol.1770 , pp. 290-301
- Jurdziński, M.¹

4
- 0037581263
- Synthesis with incomplete information
- O. Kupferman and M. Y. Vardi. Synthesis with incomplete information. In Proc. ICTL'97, 1997.
- (1997) Proc. ICTL'97
- Kupferman, O.¹ Vardi, M.Y.²

5
- 0033468411
- Church's problem revisited
- June
- O. Kupferman and M. Y. Vardi. Church's problem revisited. The bulletin of Symbolic Logic, 5(2):245-263, June 1999.
- (1999) The Bulletin of Symbolic Logic , vol.5 , Issue.2 , pp. 245-263
- Kupferman, O.¹ Vardi, M.Y.²

6
- 84959193557
- μ-calculus synthesis
- Proc. MFCS'00, Springer-Verlag
- O. Kupferman and M. Y. Vardi. μ-calculus synthesis. In Proc. MFCS'00, volume 1893 of LNCS, pages 497-507. Springer-Verlag, 2000.
- (2000) LNCS , vol.1893 , pp. 497-507
- Kupferman, O.¹ Vardi, M.Y.²

7
- 0034873871
- Synthesizing distributed systems
- July
- O. Kupferman and M. Y. Vardi. Synthesizing distributed systems. In Proc. LICS'01, July 2001.
- (2001) Proc. LICS'01
- Kupferman, O.¹ Vardi, M.Y.²

8
- 85034432427
- Alternating automata on infinite objects, determinancy and Rabin's theorem
- Automata on Infinite Words, Springer-Verlag
- D. E. Muller and P. Schupp. Alternating automata on infinite objects, determinancy and Rabin's theorem. In Automata on Infinite Words, volume 192 of LNCS, pages 100-107. Springer-Verlag, 1985.
- (1985) LNCS , vol.192 , pp. 100-107
- Muller, D.E.¹ Schupp, P.²

9
- 0025564928
- Distributed reactive systems are hard to synthesize
- A. Pnueli and R. Rosner. Distributed reactive systems are hard to synthesize. In Proc. FOCS'90, pages 746-757, 1990.
- (1990) Proc. FOCS'90 , pp. 746-757
- Pnueli, A.¹ Rosner, R.²

10
- 35248828072
- Distributed games
- Proc. FSTTCS'03
- I. Walukiewicz and S. Mohalik. Distributed games. In Proc. FSTTCS'03, volume 2914 of LNCS, pages 338-351, 2003.
- (2003) LNCS , vol.2914 , pp. 338-351
- Walukiewicz, I.¹ Mohalik, S.²

11
- 0003544023
- PhD thesis, Stanford University
- P. Wolper. Synthesis of Communicating Processes from Temporal-Logic Specifications. PhD thesis, Stanford University, 1982.
- (1982) Synthesis of Communicating Processes from Temporal-logic Specifications
- Wolper, P.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.