SCOPUS 정보 검색 플랫폼

Computer Journal

Volumn 45, Issue 1, 2002, Pages 55-61

A modal logic for full LOTOS based on symbolic transition systems

(3) Calder, M a Maharaj, S b Shankland, C b

a UNIVERSITY OF GLASGOW (United Kingdom)

b UNIVERSITY OF STIRLING (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER ARCHITECTURE; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SIMULATION; DATA STRUCTURES; SEMANTICS; THEOREM PROVING;

BISIMULATION; MODAL LOGIC; STANDARD SEMANTICS; SYMBOLIC TRANSITION SYSTEMS; SYNTAX;

FORMAL LOGIC;

EID: 0036167982 PISSN: 00104620 EISSN: None Source Type: Journal
DOI: 10.1093/comjnl/45.1.55 Document Type: Article

Times cited : (17)

References (12)

1
- 0003783398
- ISO 8807; International Organisation for Standardization, New York
- (1989) Information Processing Systems-Open Systems Interconnection-LOTOS-a Formal Description Technique Based on the Temporal Ordering of Observational Behaviour

2
- 21844519121
- A modal logic for message passing processes
- (1995) Acta Informatica , vol.32 , pp. 347-374
- Hennessy, M.¹ Liu, X.²

3
- 84957379824
- CADP (CAESAR/ALDE-BARAN development package): A protocol validation and verification toolbox
- In Alur, R. and Henzinger, T. A. (eds); Springer
- (1996) Proc. CAV'96. Lecture Notes in Computer Science , vol.1102 , pp. 437-440
- Fernandez, J.-C.¹

4
- 0029256362
- Symbolic bisimulations
- (1995) Theor. Comp. Sci. , vol.138 , pp. 353-389
- Hennessy, M.¹ Lin, H.²

5
- 0008397431
- A symbolic semantics and bisimulation for full LOTOS
- Technical Report CSM-159, University of Stirling
- (2000)
- Calder, M.¹ Shankland, C.²

6
- 0008363701
- A symbolic semantics and bisimulation for full LOTOS
- In Kim, C. and Kang, L. (eds); Kluwer Academic Publishers, USA
- (2001) FORTE '01 , pp. 184-200
- Calder, M.¹ Shankland, C.²

7
- 84881153972
- An adequate logic for full LOTOS
- In Oliveira, J. N. and Zave, P. (eds); Lecture Notes in Computer Science; Springer-Verlag, Heidelberg, Germany
- (2001) Proc. of Formal Methods Europe 2001 , vol.2021 , pp. 384-395
- Calder, M.¹ Maharaj, S.² Shankland, C.³

8
- 0008354110
- Technical Report, Computer Science Laboratory, SRI International, Menlo Park, CA
- (1993) PVS Tutorial
- Shankar, N.¹ Owre, S.² Rushby, J.M.³

9
- 0026817619
- An introduction to LOTOS: Learning by examples
- (1992) Comp. Networks ISDN Syst. , vol.23 , pp. 325-342
- Logrippo, L.¹ Faci, M.² Haj-Hussein, M.³

10
- 0021974161
- Algebraic laws for nondeterminism and concurrency
- (1985) J. Assoc. Comp. Machinery , vol.32 , pp. 137-161
- Hennessy, M.¹ Milner, R.²

11
- 85034842834
- Temporal logics for CCS
- Springer
- (1989) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Lecture Notes in Computer Science , vol.354 , pp. 660-672
- Stirling, C.¹

12
- 0008323704
- A PVS theory of symbolic transition systems
- University of Edinburgh Division of Informatics Research Report, August
- (2001) Theorem Proving in Higher Order Logics
- Maharaj, S.¹

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