Operational and denotational semantics for the box algebra
Theoretical Computer Science
Metric Spaces as Models for Real-Time Concurrency
Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
A Temporal Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
A Refined View of the Box Algebra
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
The box calculus: a new causal algebra with multi-label communication
Advances in Petri Nets 1992, The DEMON Project
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
A compositional model of time Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Effective representation of RT-LOTOS terms by finite time petri nets
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
sPBC: A Markovian Extension of Petri Box Calculus with Immediate Multiactions
Fundamenta Informaticae
Discrete Time Stochastic Petri Box Calculus with Immediate Multiactions dtsiPBC
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
PBC (Petri Box Calculus) is a process algebra where real parallelism of concurrent systems can be naturally expressed. One of its main features is the definition of a denotational semantics based on Petri nets, which emphasizes the structural aspects of the modelled systems. However, this formal model does not include temporal aspects of processes, which are necessary when considering real-time systems. The aim of this paper is to extend the existing calculus with those temporal aspects. We consider that actions are not instantaneous, that is, their execution takes time. We present an operational semantics and a denotational semantics based on timed Petri nets. Finally, we discuss the introduction of other new features such as time-outs and delays. Throughout the paper we assume that the reader is familiar with both Petri nets and PBC.