54 search results - page 4 / 11 » Symbolic Negotiation with Linear Logic |
TIME
2002
IEEE
14 years 16 days ago
2002
IEEE
In this paper, we propose a logical approach to represent and reason about different time granularities. We identify a time granularity as a discrete infinite sequence of time po...
FROCOS
2007
Springer
14 years 1 months ago
2007
Springer
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
CODES
2002
IEEE
14 years 18 days ago
2002
IEEE
This paper describes the formal verification of the recently introduced Dual Transition Petri Net (DTPN) models [12], using model checking techniques. The methodology presented a...
ARTS
1999
Springer
13 years 12 months ago
1999
Springer
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checkin...
CAV
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...