Sciweavers

289 search results - page 47 / 58
» Regular Linear Temporal Logic
Sort
View
ISCAS
2003
IEEE
135views Hardware» more  ISCAS 2003»
15 years 11 months ago
Formal verification of LTL formulas for SystemC designs
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
Daniel Große, Rolf Drechsler
FSTTCS
2006
Springer
15 years 9 months ago
On Decidability of LTL Model Checking for Process Rewrite Systems
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
Laura Bozzelli, Mojmír Kretínsk&yacu...
ATAL
2008
Springer
15 years 7 months ago
An Automata-Based Monitoring Technique for Commitment-Based Multi-Agent Systems
In open multi-agent systems (MASs) we cannot assume agents to be developed in a centralized fashion. Recent proposals of commitmentbased communication frameworks aim at increasing ...
Paola Spoletini, Mario Verdicchio
AOSD
2007
ACM
15 years 10 months ago
Open bisimulation for aspects
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
Radha Jagadeesan, Corin Pitcher, James Riely
ECAI
2010
Springer
15 years 3 months ago
LTL Goal Specifications Revisited
The language of linear temporal logic (LTL) has been proposed as a formalism for specifying temporally extended goals and search control constraints in planning. However, the seman...
Andreas Bauer 0002, Patrik Haslum