The Timing and Probability Workbench: A Tool for Analysing Timed Processes

We describe the implementation of a tool for analysing systems described in the TPCCS process algebra (CCS extended with time and probability). The tool essentially provides three functions: (i) simulation of TPCCS speciications, (ii) checking whether two TPCCS speciications are equivalent with respect to TPCCS strong bisimulation equivalence, and (iii) checking whether a TPCCS speciication satisses a system property described in TPCTL, a branching time logic similar to CTL in which timing and probabilistic properties of systems can be expressed. The printed version of the thesis diiers from the original text in some minor details. The introduction contains a short discussion on the diierences between the versions.

[1]  Colin Stirling,et al.  Modal and temporal logics , 1993, LICS 1993.

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  E. Clarke,et al.  Automatic Veriication of Nite-state Concurrent Systems Using Temporal-logic Speciications. Acm , 1993 .

[4]  G. Boudol,et al.  Notes on Algebraic Calculi of Processes , 1989, Logics and Models of Concurrent Systems.

[5]  Faron Moller,et al.  A Temporal Calculus of Communicating Systems , 1990, CONCUR.

[6]  Hans A. Hansson Time and probability in formal design of distributed systems , 1991, DoCS.

[7]  Chan-Hee Lee Implementering av CCS med värdeöverföring , 1989 .

[8]  Robin Milner,et al.  Definition of standard ML , 1990 .

[9]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[10]  Mary K. Vernon,et al.  A Generalized Timed Petri Net Model for Performance Analysis , 1985, IEEE Transactions on Software Engineering.

[11]  Robert de Simone,et al.  Symbolic Bisimulation Minimisation , 1992, CAV.

[12]  Mary K. Vernon,et al.  The GTPN Analyzer: Numerical Methods and User Interface , 1986, FJCC.

[13]  Leslie Lamport,et al.  The mutual exclusion problem: partII—statement and solutions , 1986, JACM.

[14]  Lars-Åke Fredlund,et al.  An Implementation of a Translational Semantics for an Imperative Language , 1990, CONCUR.

[15]  Rajeev Alur,et al.  The Theory of Timed Automata , 1991, REX Workshop.

[16]  Yi Wang A calculus of real time systems , 1991 .

[17]  Bengt Jonsson,et al.  A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[18]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[19]  Rance Cleaveland,et al.  The concurrency workbench: a semantics-based tool for the verification of concurrent systems , 1993, TOPL.

[20]  Jean-Claude Fernandez Ald Ebaran: a Tool for Veriication of Communicating Processes , 1989 .

[21]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[22]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[23]  BolRoland,et al.  The meaning of negative premises in transition system specifications , 1996 .

[24]  Faron Moller Process Algebra as a Tool for Real Time Analysis , 1991 .

[25]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[26]  Rajeev Alur,et al.  Verifying Automata Specifications of Probabilistic Real-time Systems , 1991, REX Workshop.

[27]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[28]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[29]  Jan Friso Groote,et al.  The Syntax and Semantics of μCRL , 1995 .

[30]  Joseph Sifakis,et al.  From ATP to Timed Graphs and Hybrid Systems , 1991, REX Workshop.