Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Branching processes of Petri nets
Acta Informatica
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
A compositional approach to performance modelling
A compositional approach to performance modelling
Theoretical Computer Science
Automated compositional Markov chain generation for a plain-old telephone system
Science of Computer Programming
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
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
Graph Layout through the VCG Tool
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Model Checking LTL Using Net Unforldings
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A Complete Finite Prefix for Process Algebra
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
General distributions in process algebra
Lectures on formal methods and performance analysis
Using Max-Plus Algebra for the Evaluation of Stochastic Process Algebra Prefixes
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
A theory of stochastic systems: part II: process algebra
Information and Computation
Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
A theory of Stochastic systems. Part II: Process algebra
Information and Computation
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Calculating probabilities of real-time test cases
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Hi-index | 0.00 |
This paper proposes a partial-order semantics for a stochastic process algebra that supports general (non-memoryless) distributions and combines this with an approach to numerically analyse the first passage time of an event. Based on an adaptation of McMillan's complete finite prefix approach tailored to event structures and process algebra, finite representations are obtained for recursive processes. The behaviour between two events is now captured by a partial order that is mapped on a stochastic task graph, a structure amenable to numerical analysis. Our approach is supported by the (new) tool FOREST for generating the complete prefix and the (existing) tool PEPP for analysing the generated task graph. As a case study, the delay of the first resolution in the root contention phase of the IEEE 1394 serial bus protocol is analysed.