SCOPUS 정보 검색 플랫폼

Computer Networks and ISDN Systems

Volumn 25, Issue 7, 1993, Pages 761-778

An action-based framework for veryfying logical and behavioural properties of concurrent systems

(4) De Nicola, R a,b Fantechi, A b Gnesi, S b Ristori, G c

a SAPIENZA UNIVERSITY OF ROME (Italy)

b IEI CNR Pisa (Italy)

c UNIVERSITY OF PISA (Italy)

Author keywords

behavioural equivalences; formal description techniques; process algebras; temporal logic; verification environments

Indexed keywords

AUTOMATA THEORY; BOOLEAN ALGEBRA; COMPUTATION THEORY; COMPUTER NETWORKS; EQUIVALENCE CLASSES; FORMAL LOGIC;

BEHAVIOURAL EQUIVALENCES; FORMAL DESCRIPTION TECHNIQUES; LABELLED TRANSITION SYSTEMS; PROCESS ALGEBRAS; TEMPORAL LOGIC; VERIFICATION ENVIRONMENTS;

COMPUTER SYSTEMS;

EID: 0027542040 PISSN: 01697552 EISSN: None Source Type: Journal
DOI: 10.1016/0169-7552(93)90047-8 Document Type: Article

Times cited : (53)

References (35)

1
- 0021410739
- Algèbre de processus et synchronization
- (1984) Theoret. Comput. Sci. , vol.30 , Issue.1 , pp. 91-131
- Austry¹ Boudol²

2
- 84918744087
- Requirement analysis for communication protocols
- J. Sifakis, Grenoble, June 1989, Lecture Notes in Computer Science, Springer, Berlin
- (1990) Automatic Verification Methods for Finite State Systems, Proc. International Workshop on Automatic Verification Methods for Finite State Systems , vol.407 , pp. 286-293
- Azéma¹ Lloret² Vernadat³

3
- 0004080346
- Cambridge University Press, Cambridge, UK
- (1990) Process Algebra
- Baeten¹ Weijland²

4
- 0023544236
- Introduction to the ISO specification language LOTOS
- (1987) Comput. Networks ISDN Systems , vol.14 , pp. 25-59
- Bolognesi¹ Brinksma²

5
- 0003464858
- also reprinted in, North-Holland, Amsterdam
- (1989) The Formal Description Techniques LOTOS
- van Eijk¹ Vissers² Diaz³

6
- 0038948424
- Squiggles: a tool for the analysis of LOTOS specifications
- K.J. Turner, Stirling, Scotland, 6–9 September 1988, Formal Description Techniques, North-Holland, Amsterdam
- (1989) Proc. 1st International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols—FORTE 88 , pp. 201-216
- Bolognesi¹ Caneve²

7
- 25444436847
- A logic for the description of behaviours and properties of concurrent systems
- J. de Bakker, P. de Roever, G. Rozenberg, Lecture Notes in Computer Science, Springer, Berlin
- (1989) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , vol.354 , pp. 398-410
- Boujani¹ Graf² Sifakis³

8
- 0342321402
- Verifying temporal properties of processes
- J.C.P. Baeten, J.W. Klop, Lecture Notes in Computer Science, Springer, Berlin
- (1990) Concur 90 , vol.458 , pp. 115-125
- Bradfield¹ Stirling²

9
- 0024035719
- Characterizing finite Kripke structures in propositional temporal logic
- (1988) Theoret. Comput. Sci. , vol.59 , Issue.1-2 , pp. 115-131
- Browne¹ Clarke² Grümberg³

10
- 0001973006
- 20 states and beyond
- Carnegie Mellon University
- (1989) Technical Report
- Burch¹ Clarke² McMillan³ Dill⁴ Hwang⁵

11
- 0022706656
- Automatic verification of finite state concurrent systems using temporal logic specifications
- (1986) ACM Toplas , vol.8 , Issue.2 , pp. 244-263
- Clarke¹ Emerson² Sistla³

12
- 85028891603
- The concurrency workbench
- J. Sifakis, Grenoble, June 1989, Lecture Notes in Computer Science, Springer, Berlin
- (1990) Automatic Verification Methods for Finite State Systems, Proc. International Workshop on Automatic Verification Methods for Finite State Systems , vol.407 , pp. 24-37
- Cleveland¹ Parrow² Steffen³

13
- 84918709929
- Transition systems and testing preorders: an alternative to Petri nets for system specifications
- H.J. Kugler, Dublin, Ireland, 1–5 September 1986, Information Processing '86, North-Holland, Amsterdam
- (1986) Proc. IFIP 10th World Computer Congress , pp. 833-836
- De Nicola¹

14
- 0025682709
- Three logics for branching bisimulations (extended abstract)
- Philadelphia, USA, June 1990, IEEE Comput. Soc. Press, Los Alamitos, CA
- (1990) LICS'90 , pp. 118-129
- De Nicola¹ Vaandrager²

15
- 84992284122
- Action versus state based logics for transition systems
- I. Guessarian, Lecture Notes in Computer Science, Springer, Berlin
- (1990) Proc. Ecole de Printemps on Semantics of Concurrency , vol.469 , pp. 407-419
- De Nicola¹ Vaandrager²

16
- 84918757855
- Aboard AUTO, INRIA
- (1990) Technical Report 111
- de Simone¹ Vergamini²

17
- 0022514018
- “Sometimes” and “not never” revisited: on branching time versus linear time temporal logic
- (1986) J. ACM , vol.33 , Issue.1 , pp. 151-178
- Emerson¹ Halpern²

18
- 0022956502
- Efficient model checking in fragments of the propositional mu-calculus
- Cambridge, MA, IEEE Comput. Soc. Press, Los Alamitos, CA
- (1986) LICS'86 , pp. 267-276
- Emerson¹ Lei²

19
- 84976763701
- Branching time temporal logic
- J. de Bakker, P. de Roever, G. Rozenberg, Lecture Notes in Computer Science, Springer, Berlin
- (1989) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , vol.354 , pp. 123-172
- Emerson¹ Srinivasan²

20
- 0011467465
- Compilation and verification of LOTOS specifications
- L. Logrippo, R.L. Probert, H. Ural, Ottawa, Ont., Canada, 12–15 June 1990, Protocol Specification, Testing, and Verification, X, North-Holland, Amsterdam
- (1990) Proc. IFIP WG6.1 10th International Symposium , pp. 379-394
- Garavel¹ Sifakis²

21
- 84918748402
- Aalborg University Center, Denmark
- (1989) TAV Users Manual, Internal Report
- Godskesen¹ Larsen² Zeeberg³

22
- 0004189966
- MIT Press, Cambridge, MA
- (1988) An Algebraic Theory of Processes
- Hennessy¹

23
- 0021974161
- Algebraic laws for nondeterminism and concurrency
- (1985) J. ACM , vol.32 , Issue.1 , pp. 137-161
- Hennessy¹ Milner²

24
- 0003843704
- Prentice-Hall, Englewood Cliffs, NJ
- (1985) Communicating Sequential Processes
- Hoare¹

25
- 84915390413
- LOTOS—A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour
- (1988) ISO/TC97/SC21
- ISO IS 8807¹

26
- 84976831733
- Implenting a model checking algorithm by adapting existing automated tools
- J. Sifakis, Grenoble, June 1989, Lecture Notes in Computer Science, Springer, Berlin
- (1990) Proc. International Workshop on Automatic Verification Methods for Finite State Systems , vol.407 , pp. 179-188
- Jonsson¹ Kahn² Parrow³

27
- 49049126479
- Results on the propositional μ-calculus
- (1983) Theoret. Comput. Sci. , vol.27 , Issue.2 , pp. 333-354
- Kozen¹

28
- 0025430468
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- (1990) Theoret. Comput. Sci. , vol.72 , Issue.2 , pp. 265-288
- Larsen¹

29
- 2442485763
- AUTO: a verification tool for distributed systems using reduction of finite automata networks
- S.T. Vuong, Vancouver, B.C., Canada, 5–8 December 1989, Formal Description Techniques, II, North-Holland, Amsterdam
- (1990) Proc. IFIP TC6 2nd International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols—FORTE 89 , pp. 61-66
- Madeleine¹ Vergamini²

30
- 85034845659
- The anchored version of the temporal framework
- J. de Bakker, P. de Roever, G. Rozenberg, Lecture Notes in Computer Science, Springer, Berlin
- (1989) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , vol.354 , pp. 201-284
- Manna¹ Pnueli²

31
- 0003954103
- Prentice-Hall, Englewood Cliffs, NJ
- (1989) Communication and Concurrency
- Milner¹

32
- 0040571903
- Verification in XESAR of the sliding window protocol
- H. Rudin, C.H. West, Zurich, Switzerland, 5–8 May 1987, Protocol Specification, Testing, and Verification, VII, North-Holland, Amsterdam
- (1987) Proc. IFIP WG6.1 7th International Symposium , pp. 235-250
- Richier¹ Rodriguez² Sifakis³ Voiron⁴

33
- 85034842834
- Temporal logics for CCS
- J. de Bakker, P. de Roever, G. Rozenberg, Lecture Notes in Computer Science, Springer, Berlin
- (1989) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , vol.354 , pp. 660-672
- Stirling¹

34
- 0347732635
- The lotosphere integrated tool environment LITE
- K.R. Parker, G.A. Rose, Sydney, Australia, 19–22 November 1991, Formal Description Techniques, IV, North-Holland, Amsterdam
- (1992) Proc. IFIP TC6/WG6.1 4th International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols—FORTE 91 , pp. 473-476
- van Eijk¹

35
- 84918756284
- Branching time and abstraction in bisimulation semantics (extended abstract)
- G.X. Ritter, Information Processing 89
- (1992) Proc. IFIP 11th World Computer Congress
- van Glabbeek¹ Weijland²

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