148 search results - page 13 / 30 » Linear Logic on Petri Nets |
159
click to vote
FSTTCS
2006
Springer
15 years 9 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
155
click to vote
APLAS
2010
ACM
15 years 6 months ago
2010
ACM
We describe an approach to using one logic to reason about specifications written in a second logic. One level of logic, called the "reasoning logic", is used to state th...
148
click to vote
APAL
2008
15 years 6 months ago
2008
Abstract. We provide an alternative proof of the sequentialisation theorem for proof nets of multiplicative linear logic. Namely, we show how a proof net can be transformed into a ...
164
click to vote
CONCUR
2000
Springer
15 years 9 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
147
click to vote
FOSSACS
2010
Springer
16 years 15 days ago
2010
Springer
Abstract. Spatial logics have been introduced to reason about distributed computation in models for concurrency. We first define a spatial logic for a general class of infinite-...