Sciweavers

129 search results - page 10 / 26
» Completeness Results for Linear Logic on Petri Nets
Sort
View
ACSC
2009
IEEE
13 years 11 months ago
Verification of the SIP Transaction Using Coloured Petri Nets
The Session Initiation Protocol (SIP) is one of the leading protocols for multimedia control over the Internet, including initiating, maintaining and terminating multimedia sessio...
Lin Liu
FUIN
2010
141views more  FUIN 2010»
13 years 4 months ago
Decidability Problems in Petri Nets with Names and Replication
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T n...
Fernando Rosa Velardo, David de Frutos-Escrig
TOPNOC
2008
13 years 7 months ago
Directed Unfolding of Petri Nets
The key to efficient on-the-fly reachability analysis based on unfolding is to focus the expansion of the finite prefix towards the desired marking. However, current unfolding stra...
Blai Bonet, Patrik Haslum, Sarah L. Hickmott, Sylv...
LICS
1994
IEEE
13 years 11 months ago
Linear Logic, Totality and Full Completeness
I give a `totality space' model for linear logic [4], detaking an abstract view of computations on a datatype. The model has similarities with both the coherence space model ...
Ralph Loader
LICS
1990
IEEE
13 years 11 months ago
Normal Process Representatives
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
Vijay Gehlot, Carl A. Gunter