In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...
Marius Kloetzer, Cristian Mahulea, Calin Belta, Ma...
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...
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as mixed logical dy...
Abstract. An approximate Herbrand theorem is established for firstorder infinite-valued Lukasiewicz Logic and used to obtain a proof-theoretic proof of Skolemization. These resul...
Abstract. In the framework of Carter and Wegman, a k-independent hash function maps any k keys independently. It is known that 5independent hashing provides good expected performan...