The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
—Current malware is often transmitted in packed or encrypted form to prevent examination by anti-virus software. To analyze new malware, researchers typically resort to dynamic c...
Kevin Coogan, Saumya K. Debray, Tasneem Kaochar, G...
— Knowledge processing is an essential technique for enabling autonomous robots to do the right thing to the right object in the right way. Using knowledge processing the robots ...
Abstract—The World Wide Web offers easy sharing of information, but provides only few options for the protection of sensitive information and other sensitive resources. Tradition...
Sergej Zerr, Daniel Olmedilla, Juri Luca De Coi, W...