A process algebraic approach to software architecture design

A Process Algebraic Approach to Software Architecture Design

Volumn , Issue , 2010, Pages 1-304

  Aldini, Alessandro ^a   Bernardo, Marco ^a   Corradini, Flavio ^b  

^a UNIVERSITY OF URBINO   (Italy)

^b UNIVERSITY OF CAMERINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER ARCHITECTURE; SEMANTICS; SOFTWARE ARCHITECTURE; SOFTWARE DESIGN; STUDENTS; VERIFICATION;

ALGEBRAIC APPROACHES; ALGEBRAIC TECHNIQUES; ARCHITECTURAL DESCRIPTION LANGUAGES; BEHAVIORAL EQUIVALENCE; EARLY DESIGN STAGES; MODELING AND VERIFICATIONS; NON-FUNCTIONAL ASPECTS; SOFTWARE ARCHITECTURE DESIGN;

DESIGN;

EID: 84892318928     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-84800-223-4     Document Type: Book

References (201)

1. G. D. Abowd, R. Allen, and D. Garlan, Formalizing Style to Understand Descriptions of Software Architecture, ACM Transactions on Software Engineering and Methodology 4:319-364, 1995.
2. S. Abramsky, Observational Equivalence as a Testing Equivalence, Theoretical Computer Science 53:225-241, 1987.
3. L. Aceto and D. Murphy, Timing and Causality in Process Algebra, Acta Informatica 33:317-350, 1996.
4. A. Acquaviva, A. Aldini, M. Bernardo, A. Bogliolo, E. Bontà, and E. Lattanzi, A Methodology Based on Formal Methods for Predicting the Impact of Dynamic Power Management, in Formal Methods for Mobile Computing, Springer, LNCS 3465:155-189, Berlin (Germany), 2005.
5. M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis, Modelling with Generalized Stochastic Petri Nets, Wiley, New York (NY), 1995.
6. A. Aldini, Classification of Security Properties in a Linda-Like Process Algebra, Science of Computer Programming 63:16-38, 2006.
7. A. Aldini and M. Bernardo, On the Usability of Process Algebra: An Architectural View, Theoretical Computer Science 335:281-329, 2005.
8. A. Aldini and M. Bernardo, Mixing Logics and Rewards for the Component-Oriented Specification of Performance Measures, Theoretical Computer Science 382:3-23, 2007.
9. A. Aldini and M. Bernardo, A Formal Approach to the Integrated Analysis of Security and QoS, Reliability Engineering & System Safety 92:1503-1520, 2007.
10. A. Aldini and M. Bernardo, A General Framework for Nondeterministic, Probabilistic, and Stochastic Noninterference, in Proc. of the 1st Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security (ARSPA/WITS 2009), Springer, LNCS 5511:18-33, York (UK), 2009.
11. A. Aldini, M. Bravetti, and R. Gorrieri, A Process-Algebraic Approach for the Analysis of Probabilistic Noninterference, Journal of Computer Security 12:191-245, 2004.
12. A. Aldini and A. Di Pierro, Estimating the Maximum Information Leakage, Journal of Information Security 7:219-242, 2008.
13. A. Aldini and R. Gorrieri, Security Analysis of a Probabilistic Non-Repudiation Protocol, in Proc. of the 2nd Joint Int. Workshop on Process Algebra and Performance Modelling and Probabilistic Methods in Verification (PAPM/PROBMIV 2002), Springer, LNCS 2399:17-36, Copenhagen (Denmark), 2002.
14. A. Aldini and R. Gorrieri, A Study About Trade-Off Between Performance and Security in an Internet Audio Mechanism, in Global Computing: Programming Environments, Languages, Security and Analysis of Systems, Springer, LNCS 2874:203-228, Berlin (Germany), 2003.
15. A. Aldini, M. Roccetti, and R. Gorrieri, On Securing Real Time Speech Transmission over the Internet: An Experimental Study, EURASIP Journal on Applied Signal Processing 2003(10):1027-1042, 2003.
16. J. Aldrich, C. Chambers, and D. Notkin, ArchJava: Connecting Software Architecture to Implementation, in Proc. of the 24th Int. Conf. on Software Engineering (ICSE 2002), ACM Press, pp. 187-197, Orlando (FL), 2002.
17. R. Allen, R. Douence, and D. Garlan, Specifying and Analyzing Dynamic Software Architectures, in Proc. of the 1st Int. Conf. on Fundamental Approaches to Software Engineering (FASE 1998), Springer, LNCS 1382:21-37, Lisbon (Portugal), 1998.
18. R. Allen and D. Garlan, A Formal Basis for Architectural Connection, ACM Transactions on Software Engineering and Methodology 6:213-249, 1997.
19. F. Aquilani, S. Balsamo, and P. Inverardi, Performance Analysis at the Software Architectural Design Level, Performance Evaluation 45:205-221, 2001.
20. J. C. M. Baeten and J. A. Bergstra, Real Time Process Algebra, Formal Aspects of Computing 3:142-188, 1991.
21. J. C. M. Baeten, J. A. Bergstra, and J. W. Klop, Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator, Computer Journal 30:498-506, 1987.
22. J. C. M. Baeten and W. P. Weijland, Process Algebra, Cambridge University Press, Cambridge (UK), 1990.
23. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen, Automated Performance and Dependability Evaluation Using Model Checking, in Performance Evaluation of Complex Systems: Techniques and Tools, Springer, LNCS 2459:261-289, Berlin (Germany), 2002.
24. C. Baier, J.-P. Katoen, H. Hermanns, and V. Wolf, Comparative Branching-Time Semantics for Markov Chains, Information and Computation 200:149-214, 2005.
25. S. Balsamo, M. Bernardo, and M. Simeoni, Performance Evaluation at the Software Architecture Level, in Formal Methods for Software Architectures, Springer, LNCS 2804:207-258, Heidelberg (Germany), 2003.
26. C. Basile, Intrusion and Fault Tolerance: For Wireline and Wireless Networks, Ph. D. Thesis, University of Illinois at Urbana-Champaign (IL), 2005.
27. F. Baskett, K. M. Chandy, R. R. Muntz, and G. Palacios, Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM 22:248-260, 1975.
28. H. Bekic, Towards a Mathematical Theory of Processes, Technical Report TR 25.125, IBM Laboratory Vienna (Austria), 1971
29. (published in Programming Languages and Their Definition, Springer, LNCS 177:168-206, New York (NY), 1984).
30. L. Benini, A. Bogliolo, and G. De Micheli, A Survey of Design Techniques for System-Level Dynamic Power Management, IEEE Transactions on VLSI Systems 8:299-316, 2000.
31. J. A. Bergstra, A. Ponse, and S. A. Smolka (eds.), Handbook of Process Algebra, Elsevier, Amsterdam (The Netherlands), 2001.
32. M. Bernardo, Non-Bisimulation-Based Markovian Behavioral Equivalences, Journal of Logic and Algebraic Programming 72:3-49, 2007.
33. M. Bernardo, Towards State Space Reduction Based on T-Lumpability- Consistent Relations, in Proc. of the 5th European Performance Engineering Workshop (EPEW 2008), Springer, LNCS 5261:64-78, Palma de Mallorca (Spain), 2008.
34. M. Bernardo, Uniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes, in Proc. of the 7th Int. Workshop on Quantitative Aspects of Programming Languages (QAPL 2009), Elsevier, ENTCS, York (UK), 2009 in press.
35. M. Bernardo, Markovian Testing Equivalence and Exponentially Timed Internal Actions, in Proc. of the 1st Int. Workshop on Quantitative Formal Methods (QFM 2009), EPTCS, Eindhoven (The Netherlands), 2009 in press.
36. M. Bernardo and A. Aldini, Weak Markovian Bisimilarity: Abstracting from Prioritized/Weighted Internal Immediate Actions, in Proc. of the 10th Italian Conf. on Theoretical Computer Science (ICTCS 2007), World Scientific, pp. 39-56, Rome (Italy), 2007.
37. M. Bernardo and E. Bontà, Generating Well-Synchronized Multithreaded Programs from Software Architecture Descriptions, in Proc. of the 4th Working IEEE/IFIP Conf. on Software Architecture (WICSA 2004), IEEE-CS Press, pp. 167-176, Oslo (Norway), 2004.
38. M. Bernardo and E. Bontà, Preserving Architectural Properties in Multithreaded Code Generation, in Proc. of the 7th Int. Conf. on Coordination Models and Languages (COORDINA-TION 2005), Springer, LNCS 3454:188-203, Namur (Belgium), 2005.
39. M. Bernardo, E. Bontà, and A. Aldini, Handling Communications in Process Algebraic Architectural Description Languages: Modeling, Verification, and Implementation, Journal of Systems and Software, 2010 in press.
40. M. Bernardo and S. Botta, A Survey of Modal Logics Characterizing Behavioral Equivalences for Nondeterministic and Stochastic Systems, Mathematical Structures in Computer Science 18:29-55, 2008.
41. M. Bernardo and M. Bravetti, Performance Measure Sensitive Congruences for Markovian Process Algebras, Theoretical Computer Science 290:117-160, 2003.
42. M. Bernardo, P. Ciancarini, and L. Donatiello, Architecting Families of Software Systems with Process Algebras, ACM Transactions on Software Engineering and Methodology 11:386-426, 2002.
43. M. Bernardo and R. Cleaveland, A Theory of Testing for Markovian Processes, in Proc. of the 11th Int. Conf. on Concurrency Theory (CONCUR 2000), Springer, LNCS 1877:305-319, State College (PA), 2000.
44. M. Bernardo, L. Donatiello, and P. Ciancarini, Stochastic Process Algebra: From an Algebraic Formalism to an Architectural Description Language, in Performance Evaluation of Complex Systems: Techniques and Tools, Springer, LNCS 2459:236-260, Berlin (Germany), 2002.
45. M. Bernardo and R. Gorrieri, A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time, Theoretical Computer Science 202:1-54, 1998.
46. M. Bernardo and P. Inverardi (eds.), Formal Methods for Software Architectures, Springer, LNCS 2804, Heidelberg (Germany), 2003.
47. A. Bertolino, F. Corradini, P. Inverardi, and H. Muccini, Deriving Test Plans from Architectural Descriptions, in Proc. of the 22nd Int. Conf. on Software Engineering (ICSE 2000), ACM Press, pp. 220-229, Limerick (Ireland), 2000.
48. A. Bertolino, P. Inverardi, and H. Muccini, An Explorative Journey from Architectural Tests Definition downto Code Tests Execution, in Proc. of the 23rd Int. Conf. on Software Engineering (ICSE 2001), ACM Press, pp. 211-220, Toronto (Canada), 2001.
49. B. Bloom, S. Istrail, and A. R. Meyer, Bisimulation Can't Be Traced, Journal of the ACM 42:232-268, 1995.
50. T. Bolognesi and E. Brinksma, Introduction to the ISO Specification Language LOTOS, Computer Networks and ISDN Systems 14:25-59, 1987.
51. T. Bolognesi and F. Lucidi, LOTOS-Like Process Algebras with Urgent or Timed Interactions, in Proc. of the 4th Int. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE 1991), IFIP Trans. C-2:249-264, Sidney (Australia), 1991.
52. A. Bondavalli, I. Majzik, and A. Pataricza, Stochastic Dependability Analysis of System Architecture Based on UML Designs, in Architecting Dependable Systems, Springer, LNCS 2677:219-244, Berlin (Germany), 2003.
53. E. Bontà, M. Bernardo, J. Magee, and J. Kramer, Synthesizing Concurrency Control Components from Process Algebraic Specifications, in Proc. of the 8th Int. Conf. on Coordination Models and Languages (COORDINATION 2006), Springer, LNCS 4038:28-43, Bologna (Italy), 2006.
54. A. Bracciali, A. Brogi, and C. Canal, A Formal Approach to Component Adaptation, Journal of Systems and Software 74:45-54, 2005.
55. M. Bravetti, Specification and Analysis of Stochastic Real-Time Systems, Ph. D. Thesis, University of Bologna (Italy), 2002.
56. M. Bravetti and A. Aldini, Discrete Time Generative-Reactive Probabilistic Processes with Different Advancing Speeds, Theoretical Computer Science 290:355-406, 2003.
57. M. Bravetti, M. Bernardo, and R. Gorrieri, A Note on the Congruence Proof for Recursion in Markovian Bisimulation Equivalence, in Proc. of the 6th Int. Workshop on Process Algebra and Performance Modelling (PAPM 1998), pp. 153-164, Nice (France), 1998.
58. S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe, A Theory of Communicating Sequential Processes, Journal of the ACM 31:560-599, 1984.
59. P. Buchholz, Exact and Ordinary Lumpability in Finite Markov Chains, Journal of Applied Probability 31:59-75, 1994.
60. P. Buchholz, Markovian Process Algebra: Composition and Equivalence, in Proc. of the 2nd Int. Workshop on Process Algebra and Performance Modelling (PAPM 1994), Technical Report 27-4, pp. 11-30, Erlangen (Germany), 1994.
61. J. P. Buzen, Computational Algorithms for Closed Queueing Networks with Exponential Servers, Communications of the ACM 16:527-531, 1973.
62. C. Canal, E. Pimentel, and J. M. Troya, Specification and Refinement of Dynamic Software Architectures, in Proc. of the 1st Working IFIP Conf. on Software Architecture (WICSA 1999), Kluwer, pp. 107-126, San Antonio (TX), 1999.
63. C. Canal, E. Pimentel, and J. M. Troya, Compatibility and Inheritance in Software Architectures, Science of Computer Programming 41:105-138, 2001.
64. K. M. Chandy and C. H. Sauer, Computational Algorithms for Product Form Queueing Networks, Communications of the ACM 23:573-583, 1980.
65. I. Christoff, Testing Equivalences and Fully Abstract Models for Probabilistic Processes, in Proc. of the 1st Int. Conf. on Concurrency Theory (CONCUR 1990), Springer, LNCS 458:126-140, Amsterdam (The Netherlands), 1990.
66. G. Clark, S. Gilmore, and J. Hillston, Specifying Performance Measures for PEPA, in Proc. of the 5th AMAST Int. Workshop on Formal Methods for Real Time and Probabilistic Systems (ARTS 1999), Springer, LNCS 1601:211-227, Bamberg (Germany), 1999.
67. G. Clark, S. Gilmore, J. Hillston, and M. Ribaudo, Exploiting Modal Logic to Express Performance Measures, in Proc. of the 11th Int. Conf. on Modeling Techniques and Tools for Computer Performance Evaluation (PERFORMANCE TOOLS 2000), Springer, LNCS 1786:247-261, Schaumburg (IL), 2000.
68. E. M. Clarke, O. Grumberg, and D. A. Peled, Model Checking, MIT Press, Cambridge (MA), 1999.
69. R. Cleaveland, Z. Dayar, S. A. Smolka, and S. Yuen, Testing Preorders for Probabilistic Processes, Information and Computation 154:93-148, 1999.
70. R. Cleaveland and M. Hennessy, Testing Equivalence as a Bisimulation Equivalence, Formal Aspects of Computing 5:1-20, 1993.
71. R. Cleaveland, J. Parrow, and B. Steffen, The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems, ACM Transactions on Programming Languages and Systems 15:36-72, 1993.
72. R. Cleaveland and O. Sokolsky, Equivalence and Preorder Checking for Finite-State Systems, in Handbook of Process Algebra, Elsevier, pp. 391-424, Amsterdam (The Netherlands), 2001.
73. A. E. Conway and N. D. Georganas, RECAL - A New Efficient Algorithm for the Exact Analysis of Multiple-Chain Closed Queueing Networks, Journal of the ACM 33:786-791, 1986.
74. F. Corradini, On Performance Congruences for Process Algebras, Information and Computation 145:191-230, 1998.
75. F. Corradini, Absolute Versus Relative Time in Process Algebras, Information and Computation 156:122-172, 2000.
76. F. Corradini and D. Di Cola, The Expressive Power of Urgent, Lazy and Busy-Waiting Actions in Timed Processes, Mathematical Structures in Computer Science 13:619-656, 2003.
77. F. Corradini and M. Pistore, Specification and Verification of Timed Lazy Systems, in Proc. of the 21st Int. Symp. on Mathematical Foundations of Computer Science (MFCS 1996), Springer, LNCS 1113:279-290, Cracow (Poland), 1996.
78. F. Corradini and M. Pistore, 'Closed Interval Process Algebra Versus Interval Process Algebra, Acta Informatica 37:467-509, 2001.
79. F. Corradini, W. Vogler, and L. Jenner, Comparing the Worst-Case Efficiency of Asynchronous Systems with PAFAS, Acta Informatica 38:735-792, 2002.
80. T. M. Cover and J. A. Thomas, Elements of Information Theory, Wiley, New York (NY), 1991.
81. P. D'Argenio, Algebras and Automata for Timed and Stochastic Systems, Ph. D. Thesis, University of Twente (The Netherlands), 1999.
82. T. R. Dean and J. R. Cordy, A Syntactic Theory of Software Architecture, IEEE Transactions on Software Engineering 21:302-313, 1995.
83. R. De Nicola and M. Hennessy, Testing Equivalences for Processes, Theoretical Computer Science 34:83-133, 1984.
84. F. De Remer and H. H. Kron, Programming-in-the-Large Versus Programming-in-the-Small, IEEE Transactions on Software Engineering 2:80-86, 1976.
85. S. Derisavi, H. Hermanns, and W. H. Sanders, Optimal State-Space Lumping in Markov Chains, Information Processing Letters 87:309-315, 2003.
86. A. Di Pierro and H. Wiklicky, Quantifying Timing Leaks and Cost Optimisation, in Proc. of the 10th Int. Conf. on Information and Communications Security (ICICS 2008), Springer, LNCS 5308:81-96, Birmingham (UK), 2008.
87. B. L. Di Vito, A Model of Cooperative Noninterference for Integrated Modular Avionics, in Proc. of the 7th IFIP Int. Working Conf. on Dependable Computing for Critical Applications (DCCA-7), IEEE-CS Press, pp. 269-286, San Jose (CA), 1999.
88. N. Evans and S. Schneider, Analysing Time Dependent Security Properties in CSP Using PVS, in Proc. of the 5th European Symp. on Research in Computer Security (ESORICS 2000), Springer, LNCS 1895:222-237, Toulouse (France), 2000.
89. D. Ferrari, Considerations on the Insularity of Performance Evaluation, IEEE Transactions on Software Engineering 12:678-683, 1986.
90. R. Focardi and R. Gorrieri, A Classification of Security Properties, Journal of Computer Security 3:5-33, 1995.
91. R. Focardi and R. Gorrieri, Classification of Security Properties (Part I: Information Flow), in Foundations of Security Analysis and Design, Springer, LNCS 2171:331-396, Berlin (Germany), 2001.
92. R. Focardi, F. Martinelli, and R. Gorrieri, Information Flow Analysis in a Discrete-Time Process Algebra, in Proc. of the 13th IEEE Computer Security Foundations Workshop (CSFW 2000), IEEE-CS Press, pp. 170-184, Cambridge (UK), 2000.
93. S. N. Foley, A Taxonomy for Information Flow Policies and Models, in Proc. of the 12th IEEE Symp. on Security and Privacy (SSP 1991), IEEE-CS Press, pp. 98-108, Oakland (CA), 1991.
94. H. Garavel, R. Mateescu, F. Lang, and W. Serwe, CADP 2006: A Toolbox for the Construction and Analysis of Distributed Processes, in Proc. of the 19th Int. Conf. on Computer Aided Verification (CAV 2007), Springer, LNCS 4590:158-163, Berlin (Germany), 2007.
95. H. Garavel and M. Sighireanu, A Graphical Parallel Composition Operator for Process Algebras, in Proc. of the IFIP Joint Int. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols and Protocol Specification, Testing and Verification (FORTE/PSTV 1999), Kluwer, pp. 185-202, Beijing (China), 1999.
96. D. Garlan, R. Allen, and J. Ockerbloom, Exploiting Style in Architectural Design Environments, in Proc. of the 2nd ACM Int. Symp. on the Foundations of Software Engineering (FSE-2), ACM Press, pp. 175-188, New Orleans (LA), 1994.
97. D. Garlan, R. Allen, and J. Ockerbloom, Architectural Mismatch: Why Reuse Is So Hard, IEEE Software 12(6):17-26, 1995.
98. D. Garlan, R. T. Monroe, and D. Wile, Acme: Architectural Description of Component-Based Systems, in Foundations of Component-Based Systems, Cambridge University Press, pp. 47-68, Cambridge (UK), 2000.
99. R. J. van Glabbeek, The Linear Time - Branching Time Spectrum I, in Handbook of Process Algebra, Elsevier, pp. 3-99, Amsterdam (The Netherlands), 2001.
100. R. J. van Glabbeek, S. A. Smolka, and B. Steffen, Reactive, Generative and Stratified Models of Probabilistic Processes, Information and Computation 121:59-80, 1995.
101. R. J. van Glabbeek and W. P. Weijland, Branching Time and Abstraction in Bisimulation Semantics, Journal of the ACM 43:555-600, 1996.
102. J. A. Goguen and J. Meseguer, Security Policy and Security Models, in Proc. of the 3rd IEEE Symp. on Security and Privacy (SSP 1982), IEEE-CS Press, pp. 11-20, Oakland (CA), 1982.
103. R. Gorrieri, M. Roccetti, and E. Stancampiano, A Theory of Processes with Durational Actions, Theoretical Computer Science 140:73-94, 1995.
104. G. Gössler and J. Sifakis, Composition for Component-Based Modeling, in Proc. of the 1st Int. Symp. on Formal Methods for Components and Objects (FMCO 2002), Springer, LNCS 2852:443-466, Leiden (The Netherlands), 2002.
105. N. Götz, U. Herzog, and M. Rettelbach, Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis Using Stochastic Process Algebras, in Proc. of the 16th Int. Symp. on Computer Performance Modelling, Measurement and Evaluation (PERFORMANCE 1993), Springer, LNCS 729:121-146, Rome (Italy), 1993.
106. S. Graf, B. Steffen, and G. Lüttgen, Compositional Minimization of Finite State Systems Using Interface Specifications, Formal Aspects of Computing 8:607-616, 1996.
107. J. W. Gray III and P. F. Syverson, A Logical Approach to Multilevel Security of Probabilistic Systems, in Proc. of the 13th IEEE Symp. on Security and Privacy, IEEE-CS Press, pp. 164-176, Oakland (CA), 1992.
108. V. Gupta, V. Lam, H. V. Ramasamy, W. H. Sanders, and S. Singh, Dependability and Performance Evaluation of Intrusion-Tolerant Server Architectures, in Proc. of the 1st Latin-American Symp. on Dependable Computing (LADC 2003), Springer, LNCS 2847:81-101, Sao Paulo (Brazil), 2003.
109. B. R. Haverkort, Markovian Models for Performance and Dependability Evaluation, in Trends in Computer Science, Springer, LNCS 2090:38-83, Berlin (Germany), 2001.
110. B. R. Haverkort and K. S. Trivedi, Specification Techniques for Markov Reward Models, Discrete Event Dynamic Systems: Theory and Applications 3:219-247, 1993.
111. A. Hein and M. Dal Cin, Performance and Dependability Evaluation of Scalable Massively Parallel Computer Systems with Conjoint Simulation, ACM Transactions on Modeling and Computer Simulation 8:333-373, 1998.
112. M. Hennessy, Acceptance Trees, Journal of the ACM 32:896-928, 1985.
113. M. Hennessy, Algebraic Theory of Processes, MIT Press, Cambridge (MA), 1988.
114. M. Hennessy and R. Milner, Algebraic Laws for Nondeterminism and Concurrency, Journal of the ACM 32:137-162, 1985.
115. M. Hennessy and T. Regan, A Process Algebra for Timed Systems, Information and Computation 117:221-239, 1995.
116. H. Hermanns, Interactive Markov Chains, Springer, LNCS 2428, Berlin (Germany), 2002.
117. H. Hermanns and M. Rettelbach, Syntax, Semantics, Equivalences, and Axioms for MTIPP, in Proc. of the 2nd Int. Workshop on Process Algebra and Performance Modelling (PAPM 1994), Technical Report 27-4, pp. 71-87, Erlangen (Germany), 1994.
118. J. Hillston, The Nature of Synchronisation, in Proc. of the 2nd Int. Workshop on Process Algebra and Performance Modelling (PAPM 1994), Technical Report 27-4, pp. 51-70, Erlangen (Germany), 1994.
119. J. Hillston, A Compositional Approach to Performance Modelling, Cambridge University Press, Cambridge (UK), 1996.
120. C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall, Englewood Cliffs (NJ), 1985.
121. R. A. Howard, Dynamic Probabilistic Systems, Wiley, New York (NY), 1971.
122. D. T. Huynh and L. Tian, On Some Equivalence Relations for Probabilistic Processes, Fundamenta Informaticae 17:211-234, 1992.
123. P. Inverardi and S. Uchitel, Proving Deadlock Freedom in Component-Based Programming, in Proc. of the 4th Int. Conf. on Fundamental Approaches to Software Engineering (FASE 2001), Springer, LNCS 2029:60-75, Genoa (Italy), 2001.
124. P. Inverardi and A. L. Wolf, Formal Specification and Analysis of Software Architectures Using the Chemical Abstract Machine Model, IEEE Transactions on Software Engineering 21:373-386, 1995.
125. P. Inverardi, A. L. Wolf, and D. Yankelevich, Static Checking of System Behaviors Using Derived Component Assumptions, ACM Transactions on Software Engineering and Methodology 9:239-272, 2000.
126. F. Javier Thayer, J. C. Herzog, and J. D. Guttman, Strand Spaces: Why Is a Security Protocol Correct?, in Proc. of the 19th IEEE Symp. on Security and Privacy (SSP 1998), IEEE-CS Press, pp. 160-171, Oakland (CA), 1998.
127. B. Jonsson and K. G. Larsen, Specification and Refinement of Probabilistic Processes, in Proc. of the 6th IEEE Symp. on Logic in Computer Science (LICS 1991), IEEE-CS Press, pp. 266-277, Amsterdam (The Netherlands), 1991.
128. C.-C. Jou and S. A. Smolka, Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes, in Proc. of the 1st Int. Conf. on Concurrency Theory (CON-CUR 1990), Springer, LNCS 458:367-383, Amsterdam (The Netherlands), 1990.
129. P. C. Kanellakis and S. A. Smolka, CCS Expressions, Finite State Processes, and Three Problems of Equivalence, Information and Computation 86:43-68, 1990.
130. M. H. Kang, A. P. Moore, and I. S. Moskowitz, Design and Assurance Strategy for the NRL Pump, IEEE Computer Magazine 31:56-64, 1998.
131. L. Kleinrock, Queueing Systems, Wiley, New York (NY), 1975.
132. J. Kramer and J. Magee, Exposing the Skeleton in the Coordination Closet, in Proc. of the 2nd Int. Conf. on Coordination Models and Languages (COORDINATION 1997), Springer, LNCS 1282:18-31, Berlin (Germany), 1997.
133. M. Z. Kwiatkowska and G. J. Norman, A Testing Equivalence for Reactive Probabilistic Processes, in Proc. of the 2nd Int. Workshop on Expressiveness in Concurrency (EXPRESS 1998), Elsevier, ENTCS 16(2):114-132, Nice (France), 1998.
134. R. Lanotte, A. Maggiolo-Schettini, S. Tini, A. Troina, and E. Tronci, Automatic Analysis of the NRL Pump, in Formal Methods for Security and Time, Elsevier, ENTCS 99:245-266, Amsterdam (The Netherlands), 2004.
135. R. Lanotte, A. Maggiolo-Schettini, and A. Troina, A Classification of Time and/or Probability Dependent Security Properties, in Proc. of the 3rd Int. Workshop on Quantitative Aspects of Programming Languages (QAPL 2005), Elsevier, ENTCS 153(2):177-193, Edinburgh (UK), 2005.
136. J. C. Laprie (ed.), Dependability: Basic Concepts and Terminology, Springer, Berlin (Germany), 1992.
137. K. G. Larsen and A. Skou, Bisimulation through Probabilistic Testing, Information and Computation 94:1-28, 1991.
138. E. D. Lazowska, J. Zahorjan, G. Scott Graham, and K. C. Sevcik, Quantitative System Performance: Computer System Analysis Using Queueing Network Models, Prentice-Hall, Englewood Cliffs (NJ), 1984.
139. D. Le Metayer, Describing Software Architecture Styles Using Graph Grammars, IEEE Transactions on Software Engineering 24:521-533, 1998.
140. G. Lowe, Casper: A Compiler for the Analysis of Security Protocols, in Proc. of the 10th IEEE Computer Security Foundations Workshop (CSFW 1997), IEEE-CS Press, pp. 18-30, Rockport (MA), 1997.
141. D. C. Luckham, J. J. Kenney, L. M. Augustin, J. Vera, D. Bryan, and W. Mann, Specification and Analysis of System Architecture Using Rapide, IEEE Transactions on Software Engineering 21:336-355, 1995.
142. J. Magee, N. Dulay, S. Eisenbach, and J. Kramer, Specifying Distributed Software Architectures, in Proc. of the 5th European Software Engineering Conf. (ESEC 1995), Springer, LNCS 989:137-153, Barcelona (Spain), 1995.
143. J. Magee and J. Kramer, Concurrency: State Models & Java Programs, Wiley, New York (NY), 1999.
144. S. Mahevas and G. Rubino, Bound Computation of Dependability and Performance Measures, IEEE Transactions on Computers 50:399-413, 2001.
145. H. Mantel, Possibilistic Definitions of Security - An Assembly Kit, in Proc. of the 13th IEEE Computer Security Foundations Workshop (CSFW 2000), IEEE-CS Press, pp. 185-199, Cambridge (UK), 2000.
146. H. Mantel and H. Sudbrock, Comparing Countermeasures Against Interrupt-Related Covert Channels in an Information-Theoretic Framework, in Proc. of the 20th IEEE Computer Security Foundations Symposium (CSFW 2007), IEEE-CS Press, pp. 326-340, Venice (Italy), 2007.
147. J. McLean, Security Models and Information Flow, in Proc. of the 11th IEEE Symp. on Security and Privacy (SSP 1990), IEEE-CS Press, pp. 180-187, Oakland (CA), 1990.
148. C. Meadows, What Makes a Cryptographic Protocol Secure? The Evolution of Requirements Specification in Formal Cryptographic Protocol Analysis, in Proc. of the 12th European Symp. on Programming Languages and Systems (ESOP 2003), Springer, LNCS 2618:10-21, Warsaw (Poland), 2003.
149. N. Medvidovic, P. Oreizy, J. E. Robbins, and R. N. Taylor, Using Object-Oriented Typing to Support Architectural Design in the C2 Style, in Proc. of the 4th ACM Int. Symp. on the Foundations of Software Engineering (FSE-4), ACM Press, pp. 24-32, San Francisco (CA), 1996.
150. N. Medvidovic, D. S. Rosenblum, D. F. Redmiles, and J. E. Robbins, Modeling Software Architectures in the Unified Modeling Language, ACM Transactions on Software Engineering and Methodology 11:2-57, 2002.
151. N. Medvidovic and R. N. Taylor, A Classification and Comparison Framework for Software Architecture Description Languages, IEEE Transactions on Software Engineering 26:70-93, 2000.
152. J. F. Meyer, Performability: A Retrospective and Some Pointers to the Future, Performance Evaluation 14:139-156, 1992.
153. L. Michotte, R. B. France, and F. Fleurey, Modeling and Integrating Aspects into Component Architectures, in Proc. of the 10th IEEE Int. Enterprise Distributed Object Computing Conference (EDOC 2006), IEEE-CS Press, pp. 181-190, Hong Kong, 2006.
154. R. Milner, A Calculus of Communicating Systems, Springer, LNCS 92, Berlin (Germany), 1980.
155. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs (NJ), 1989.
156. R. Milner, Communicating and Mobile Systems: The π-Calculus, Cambridge University Press, Cambridge (UK), 1999.
157. R. Milner, J. Parrow, and D. Walker, A Calculus of Mobile Processes, Information and Computation 100:1-77, 1992.
158. F. Moller and C. Tofts, A Temporal Calculus of Communicating Systems, in Proc. of the 1st Int. Conf. on Concurrency Theory (CONCUR 1990), Springer, LNCS 458:401-415, Amsterdam (The Netherlands), 1990.
159. F. Moller and C. Tofts, Relating Processes with Respect to Speed, in Proc. of the 2nd Int. Conf. on Concurrency Theory (CONCUR 1991), Springer, LNCS 527:424-438, Amsterdam (The Netherlands), 1991.
160. M. Moriconi, X. Qian, and R. A. Riemenschneider, Correct Architecture Refinement, IEEE Transactions on Software Engineering 21:356-372, 1995.
161. I. S. Moskowitz and M. H. Kang, Covert Channels - Here to Stay?, in Proc. of the 9th Conf. on Computer Assurance (COMPASS 1994), NIST, pp. 235-244, Gaithersburg (MD), 1994.
162. M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models - An Algorithmic Approach, John Hopkins University Press, Baltimore (MD), 1981.
163. X. Nicollin and J. Sifakis, An Overview and Synthesis on Timed Process Algebras, in Proc. of the REX Workshop on Real Time: Theory in Practice, Springer, LNCS 600:526-548, Mook (The Netherlands), 1991.
164. X. Nicollin and J. Sifakis, The Algebra of Timed Processes ATP: Theory and Application, Information and Computation 114:131-178, 1994.
165. E.-R. Olderog and C. A. R. Hoare, Specification-Oriented Semantics for Communicating Processes, Acta Informatica 23:9-66, 1986.
166. G. On, J. Schmitt, and R. Steinmetz, On Availability QoS for Replicated Multimedia Service and Content, in Proc. of the Joint Int. Workshops on Interactive Distributed Multimedia Systems and Protocols for Multimedia Systems (IDMS/PROMS 2002), Springer, LNCS 2515:313-326, Coimbra (Portugal), 2002.
167. F. Oquendo, π-ADL: An Architecture Description Language Based on the Higher-Order Ty pe d π-Calculus for Specifying Dynamic and Mobile Software Architectures, ACM SIG-SOFT Software Engineering Notes 29:1-14, 2004.
168. R. Paige and R. E. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing 16:973-989, 1987.
169. D. Park, Concurrency and Automata on Infinite Sequences, in Proc. of the 5th GI Conf. on Theoretical Computer Science, Springer, LNCS 104:167-183, Karlsruhe (Germany), 1981.
170. D. E. Perry and A. L. Wolf, Foundations for the Study of Software Architecture, ACM SIG-SOFT Software Engineering Notes 17:40-52, 1992.
171. C. A. Petri, Kommunikation mit Automaten, Ph. D. Thesis, Technical University of Darmstadt (Germany), 1962.
172. G. D. Plotkin, A Structural Approach to Operational Semantics, Technical Report DAIMI-FN-19, Aarhus University (Denmark), 1981
173. (published in Journal of Logic and Algebraic Programming 60/61:17-139, 2004).
174. C. Priami, Stochastic π-Calculus, Computer Journal 38:578-589, 1995.
175. J. Quemada, D. de Frutos, and A. Azcorra, TIC: A Timed Calculus, Formal Aspects of Computing 5:224-252, 1993.
176. G. M. Reed and A. W. Roscoe, A Timed Model for Communicating Sequential Processes, Theoretical Computer Science 58:249-261, 1988.
177. M. Reiser and S. S. Lavenberg, Mean-Value Analysis of Closed Multichain Queueing Networks, Journal of the ACM 27:313-322, 1980.
178. M. Rettelbach, Probabilistic Branching in Markovian Process Algebras, Computer Journal 38:590-599, 1995.
179. P. Y. A. Ryan, J. McLean, J. Millen, and V. Gligor, Non-interference: Who Needs It?, in Proc. of the 14th IEEE Computer Security Foundations Workshop (CSFW 2001), IEEE-CS Press, pp. 237-238, Cape Breton (Canada), 2001.
180. P. Y. A. Ryan and S. Schneider, Process Algebra and Noninterference, in Proc. of the 12th IEEE Computer Security Foundations Workshop (CSFW 1999), IEEE-CS Press, pp. 214-227, Mordano (Italy), 1999.
181. A. Sabelfeld and D. Sands, Probabilistic Noninterference for Multi-Threaded Programs, in Proc. of the 13th IEEE Computer Security Foundations Workshop (CSFW 2000), IEEE-CS Press, pp. 200-214, Cambridge (UK), 2000.
182. W. H. Sanders and J. F. Meyer, A Unified Approach for Specifying Measures of Performance, Dependability, and Performability, Dependable Computing and Fault Tolerant Systems 4:215-237, 1991.
183. D. Sangiorgi and D. Walker, The π-Calculus: A Theory of Mobile Processes, Cambridge University Press, Cambridge (UK), 2001.
184. D. S. Scott, Data Types as Lattices, SIAM Journal on Computing 5:522-587, 1976.
185. M. Shaw, R. De Line, D. V. Klein, T. L. Ross, D. M. Young, and G. Zelesnik, Abstractions for Software Architecture and Tools to Support Them, IEEE Transactions on Software Engineering 21:314-335, 1995.
186. M. Shaw and D. Garlan, Software Architecture: Perspectives on an Emerging Discipline, Prentice-Hall, Englewood Cliffs (NJ), 1996.
187. A. Simpson, J. Woodcock, and J. Davies, Safety Through Security, in Proc. of the 9th IEEE Workshop on Software Specification and Design (IWSSD-9), IEEE-CS Press, pp. 18-24, Ise-Shima (Japan), 1998.
188. C. Smith, Performance Engineering of Software Systems, Addison-Wesley, Reading (MA), 1990.
189. E. W. Stark, R. Cleaveland, and S. A. Smolka, A Process-Algebraic Language for Probabilistic I/O Automata, in Proc. of the 14th Int. Conf. on Concurrency Theory (CONCUR 2003), Springer, LNCS 2761:189-203, Marseille (France), 2003.
190. W. J. Stewart, Introduction to the Numerical Solution of Markov Chains, Princeton University Press, Princeton (NJ), 1994.
191. V. Stravridou and B. Dutertre, From Security to Safety and Back, in Proc. of the IEEE Workshop on Computer Security, Dependability, and Assurance: From Needs to Solutions (CSDA 1998), IEEE-CS Press, pp. 182-195, Williamsburg (VA), 1998.
192. M. Tivoli and P. Inverardi, Failure-Free Coordinators Synthesis for Component-Based Architectures, Science of Computer Programming 71:181-212, 2008.
193. W.-G. Tzeng, A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata, SIAM Journal on Computing 21:216-227, 1992.
194. G. Winskel, Events in Computation, Ph. D. Thesis, University of Edinburgh (UK), 1980.
195. J. T. Wittbold and D. M. Johnson, Information Flow in Nondeterministic Systems, in Proc. of the 11th IEEE Symp. on Security and Privacy (SSP 1990), IEEE-CS Press, pp. 144-161, Oakland (CA), 1990.
196. V. Wolf, C. Baier, and M. Majster-Cederbaum, Trace Machines for Observing Continuous-Time Markov Chains, in Proc. of the 3rd Int. Workshop on Quantitative Aspects of Programming Languages (QAPL 2005), Elsevier, ENTCS 153(2):259-277, Edinburgh (UK), 2005.
197. C. M. Woodside, J. E. Neilson, D. C. Petriu, and S. Majumdar, The Stochastic Rendezvous Network Model for Performance of Synchronous Client-Server-Like Distributed Software, IEEE Transactions on Computers 44:20-34, 1995.
198. F. Wu, H. Johnson, and A. Nilsson, SOLA: Lightweight Security for Access Control in IEEE 802.11, IT Professional 6:10-16, 2004.
199. S. Yau, M. Yan, and D. Huang, Design of Service-Based Systems with Adaptive Tradeoff Between Security and Service Delay, in Proc. of the 4th Int. Conf. on Autonomic and Trusted Computing (ATC 2007), Springer, LNCS 4610:103-113, Hong Kong, 2007.
200. D. M. Yellin and R. E. Strom, Protocol Specifications and Component Adaptors, ACM Transactions on Programming Languages and Systems 19:292-333, 1997.
201. W. Yi, CCS + Time = An Interleaving Model for Real Time Systems, in Proc. of the 18th Int. Coll. on Automata, Languages and Programming (ICALP 1991), Springer, LNCS 510:217-228, Madrid (Spain), 1991.