129 search results - page 16 / 26 » Completeness Results for Linear Logic on Petri Nets |
ENTCS
2008
13 years 7 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
CAV
2005
Springer
14 years 1 months ago
2005
Springer
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
IEEESCC
2005
IEEE
14 years 1 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
18
Voted
AML
2010
13 years 7 months ago
2010
In Abstract Algebraic Logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this proce...
CONEXT
2009
ACM
13 years 8 months ago
2009
ACM
The lack of automation associated with network operations in general and network configuration management in particular, is widely recognized as a significant contributing factor ...