A Calculus Based on Absence of Actions

In this article we present a process algebra where the behaviour can be speci ed when certain actions cannot be exhibited. This is useful in specifying time outs, interrupts etc. We present a few properties which form the basis for a sound and complete axiomatisation of a bisimulation equivalence relation. A comparison with other approaches is presented.

[1]  Jane W.-S. Liu,et al.  i . ' il ' . Imprecise Results : Utilizing Partial Computations in Real-Time Systems , 2004 .

[2]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

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

[4]  Glynn Winskel,et al.  CCS with Priority Choice , 1995, Inf. Comput..

[5]  Jan A. Bergstra,et al.  Syntax and defining equations for an interrupt mechanism in process algebra , 1985 .

[6]  Gérard Berry,et al.  Preemption in Concurrent Systems , 1993, FSTTCS.

[7]  Wang Yi,et al.  CCS + Time = An Interleaving Model for Real Time Systems , 1991, ICALP.

[8]  P. Krishnan.  A Calculus of Timed Communicating Systems , 1992, Int. J. Found. Comput. Sci..

[9]  Padmanabhan Krishnan,et al.  A case study in specifying and testing architectural features , 1994, Microprocess. Microsystems.

[10]  Colin Stirling,et al.  An Introduction to Modal and Temporal Logics for CCS , 1991, Concurrency: Theory, Language, And Architecture.

[11]  Jan A. Bergstra,et al.  Process theory based on bisimulation semantics , 1988, REX Workshop.

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

[13]  Tommaso Bolognesi,et al.  Timed Process Algebras with Urgent Interactions and a Unique Powerful Binary Operator , 1991, REX Workshop.

[14]  Jan Friso Groote.  Transition System Specifications with Negative Premises (Extended Abstract) , 1990, CONCUR.

[15]  Radha Jagadeesan,et al.  Default timed concurrent constraint programming , 1995, POPL '95.