Communicating sequential processes
Communicating sequential processes
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Communication and concurrency
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
Bisimulation through probabilistic testing
Information and Computation
Transition system specifications with negative premises
Theoretical Computer Science
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
On "Axiomatising Finite Concurrent Processes"
SIAM Journal on Computing
A LOTOS extension for the performance analysis of distributed systems
IEEE/ACM Transactions on Networking (TON)
Adding action refinement to a finite process algebra
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Theoretical Computer Science
Towards Performance Evaluation with General Distributions in Process Algebras
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Axiomatising ST-Bisimulation Equivalence
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
An algebraic approach to the specification of stochastic systems
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
An Overview and Synthesis on Timed Process Algebras
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Deciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement
Deciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement
ACM Transactions on Computational Logic (TOCL)
General distributions in process algebra
Lectures on formal methods and performance analysis
Product form solution for an insensitive stochastic process algebra structure
Performance Evaluation - Unified specification and performance evaluation using stochastic process algebras
MoDeST - A Modelling and Description Language for Stochastic Timed Systems
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
A Testing Theory for Generally Distributed Stochastic Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Stochastic Process Algebras Meet Eden
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
A theory of stochastic systems: part I: Stochastic automata
Information and Computation
A theory of stochastic systems: part II: process algebra
Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)
Mutation testing from probabilistic and stochastic finite state machines
Journal of Systems and Software
A Statistical Approach to Test Stochastic and Probabilistic Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
A theory of stochastic systems part I: Stochastic automata
Information and Computation
A theory of Stochastic systems. Part II: Process algebra
Information and Computation
An expressiveness study of priority in process calculi
Mathematical Structures in Computer Science
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Formal testing of systems presenting soft and hard deadlines
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
A compositional semantics for dynamic fault trees in terms of interactive Markov chains
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
SPAMR: extending PAMR with stochastic time
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
A comparative study of STOPA and RTPA
Transactions on computational science II
Implementation relations for stochastic finite state machines
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Bio-PEPAd: A non-Markovian extension of Bio-PEPA
Theoretical Computer Science
Weak stochastic bisimulation for non-markovian processes
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Assessing the expressivity of formal specification languages
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Foundational aspects of multiscale modeling of biological systems with process algebras
Theoretical Computer Science
Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)
On the expressive power of global and local priority in process calculi
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
| Hi-index | 5.23 |
In this paper we introduce the calculus of interactive generalized semi-Markov processes (IGSMPs), a stochastic process algebra which can express probabilistic timed delays with general distributions and synchronizable actions with zero duration, and where choices may be probabilistic, non-deterministic and prioritized. IGSMP is equipped with a structural operational semantics which generates semantic models in the form of generalized semi-Markov processes (GSMPs), i.e. probabilistic systems with generally distributed time, extended with action transitions representing interaction among system components. This is obtained by expressing the concurrent execution of delays through a variant of ST semantics which is based on dynamic names. The fact that names for delays are generated dynamically by the semantics makes it possible to define a notion of observational congruence for IGSMP (that abstracts from internal actions with zero duration) simply as a combination of standard observational congruence and probabilistic bisimulation. We also present a complete axiomatization for observational congruence over IGSMP. Finally, we show how to derive a GSMP from a given IGSMP specification in order to evaluate the system performance and we present a case study.