Learn More
We present an inference system for a version of the π-calculus in Haskell for the session type proposed by Honda et al. The session type is very useful in checking if the communications are wellbehaved. The full session type implementation in Haskell was first presented by Pucella and Tov, which is ‘semi-automatic’ in that the manual operations for the type(More)
We propose equivalences and preorders with congruence properties for a timed extension of the π-calculus. We present a timed extension of syntax and basic operational semantics to the π-calculus. The derived timed bisimulation relations are shown to be non-input congruent. The timed bisimilarities equalize the bisimilar processes not only in actions but(More)
This paper proposes a new timed model named nested timed automata (NeTAs). An NeTA is a pushdown system whose stack symbols are timed automata (TAs). It either behaves as the top TA in the stack, or switches from one TA to another by pushing, popping, or changing the top TA of the stack. Different from existing component-based context-switch models such as(More)
A nested timed automaton (NeTA) is a pushdown system whose control locations and stack alphabet are timed automata (TAs). A control location describes a working TA, and the stack presents a pile of interrupted TAs. In NeTAs, all local clocks of TAs proceed uniformly also in the stack. This paper extends NeTAs with frozen local clocks (NeTAFs). All clocks of(More)
We introduce a reversible process calculus with a new feature of execution control that allows us to change the direction and pattern of computation. This feature allows us to model a variety of modes of reverse computation, ranging from strict backtracking to reversing which respects causal ordering of events, and even reversing which violates causal(More)