AbstractThis paper develops a mathematical framework to describe and reason about semantic theories of processes where actions have a non-zero duration. The framework relies on the notions of reduction and observability and allows one to naturally explain the possible choices to incorporate timing information in terms of process interaction mechanisms. The framework provides a parameterized context where well-known and new theories can be formally compared and classified by a suitable instantiation of the parameters. A proof-technique to derive from the reduction semantics an equivalent SOS-based characterization is also provided
Reasoning about actions and change based on common sense knowledge is one of the most important and ...
The possibility of two or more actions to be performed consecutively at the same point in time is n...
This paper presents a discrete formalism for temporal reasoning about actions and change, which enjo...
AbstractThis paper develops a mathematical framework to describe and reason about semantic theories ...
AbstractThis paper develops a formal framework to describe and reason about semantic theories which ...
AbstractA new bisimulation based semantics, called performance equivalence, is proposed for a proces...
Several Markovian process calculi have been proposed in the literature, which differ from each other...
AbstractTimed process algebras are useful tools for the specification and verification of real-time ...
Several timed process calculi have been proposed in the literature, which mainly differ for the way ...
Several timed process calculi have been proposed in the literature, which mainly differ for the way ...
This thesis presents and studies a timed computational model of parallelism, a Timed Calculus of Com...
AbstractA formulation of semantic theories for processes which does not rely on the notion of observ...
In this chapter, we present an overview of how timing information can be embedded in process-algebra...
AbstractIn this paper we study restrictions on the expressivity of the timed process algebra with du...
AbstractIn ACP-style process algebra, the interpretation of a constant atomic action combines action...
Reasoning about actions and change based on common sense knowledge is one of the most important and ...
The possibility of two or more actions to be performed consecutively at the same point in time is n...
This paper presents a discrete formalism for temporal reasoning about actions and change, which enjo...
AbstractThis paper develops a mathematical framework to describe and reason about semantic theories ...
AbstractThis paper develops a formal framework to describe and reason about semantic theories which ...
AbstractA new bisimulation based semantics, called performance equivalence, is proposed for a proces...
Several Markovian process calculi have been proposed in the literature, which differ from each other...
AbstractTimed process algebras are useful tools for the specification and verification of real-time ...
Several timed process calculi have been proposed in the literature, which mainly differ for the way ...
Several timed process calculi have been proposed in the literature, which mainly differ for the way ...
This thesis presents and studies a timed computational model of parallelism, a Timed Calculus of Com...
AbstractA formulation of semantic theories for processes which does not rely on the notion of observ...
In this chapter, we present an overview of how timing information can be embedded in process-algebra...
AbstractIn this paper we study restrictions on the expressivity of the timed process algebra with du...
AbstractIn ACP-style process algebra, the interpretation of a constant atomic action combines action...
Reasoning about actions and change based on common sense knowledge is one of the most important and ...
The possibility of two or more actions to be performed consecutively at the same point in time is n...
This paper presents a discrete formalism for temporal reasoning about actions and change, which enjo...