Sciweavers

129 search results - page 13 / 26
» Completeness Results for Linear Logic on Petri Nets
Sort
View
LPAR
2001
Springer
13 years 12 months ago
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
Volker Diekert, Paul Gastin
INFORMATICALT
2010
138views more  INFORMATICALT 2010»
13 years 4 months ago
Recognition of Human Emotions in Reasoning Algorithms of Wheelchair Type Robots
This paper analyses the possibilities of integrating different technological and knowledge representation techniques for the development of a framework for the remote control of mu...
Dale Dzemydiene, Antanas Andrius Bielskis, Arunas ...
DAC
2006
ACM
14 years 8 months ago
State encoding of large asynchronous controllers
A novel method to solve the state encoding problem in Signal Transition Graphs is presented. It is based on the structural theory of Petri nets and can be applied to large specifi...
Josep Carmona, Jordi Cortadella
CSL
2007
Springer
14 years 1 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 7 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger