Abstract. We study the relationship between name creation and replication in a setting of infinitestate communicating automata. By name creation we mean the capacity of dynamicall...
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
Business Process Execution Language for Web Services (BPEL) is becoming the industrial standard for modeling web service-based business processes. Behavioral compatibility for web ...
In this paper we show how to extend Coloured Petri Nets (CP-nets), with three new modelling primitives—place capacities, test arcs and inhibitor arcs. The new modelling primitiv...