A Consistent Causality-Based View on a Timed Process AlgebraIncluding Urgent Interactions
Formal Methods in System Design - Special issue: industrial critical systems
Enhanced operational semantics: a tool for describing and analyzing concurrent systems
ACM Computing Surveys (CSUR)
Performance Evaluation of Mobile Processes via Abstract Machines
IEEE Transactions on Software Engineering
Process algebra for performance evaluation
Theoretical Computer Science
Process algebra and Markov chains
Lectures on formal methods and performance analysis
General distributions in process algebra
Lectures on formal methods and performance analysis
Language-based performance prediction for distributed and mobile systems
Information and Computation
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
Characterizing Timed Net Processes Categorically
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
On the Category of Event Structures with Dense Time
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Modelling Timeouts without Timelocks
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Engineering of distributed control systems
Stochastic Petri net semantics for stochastic process algebras
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Applying object-oriented concepts to the Development of Real-Time Industrial automation systems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
The expressive power of urgent, lazy and busy-waiting actions in timed processes
Mathematical Structures in Computer Science
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Extending Timed Process Algebra with Discrete Stochastic Time
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata
Fundamenta Informaticae - Application of Concurrency to System Design
Fundamenta Informaticae - Application of Concurrency to System Design
An evaluation of timed scenario notations
Journal of Systems and Software
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
TTCN-3 for distributed testing embedded software
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Process algebras in systems biology
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Relational concurrent refinement: timed refinement
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Embedding real time in stochastic process algebras
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Simulated time for testing railway interlockings with TTCN-3
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata
Fundamenta Informaticae - Application of Concurrency to System Design
Fundamenta Informaticae - Application of Concurrency to System Design
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Analysis of Timed Concurrent Models Based on Testing Equivalence
Fundamenta Informaticae
On the Relationships among four Timed Process Algebras
Fundamenta Informaticae
| Hi-index | 0.00 |