Sciweavers

1472 search results - page 163 / 295
» On Model Checking Infinite-State Systems
Sort
View
RTA
2005
Springer
15 years 9 months ago
Natural Narrowing for General Term Rewriting Systems
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...
Santiago Escobar, José Meseguer, Prasanna T...
CSCWD
2005
Springer
15 years 6 months ago
Process mining in CSCW systems
Process mining techniques allow for extracting information from event logs. For example, the audit trails of a workflow management system or the transaction logs of an enterprise ...
Wil M. P. van der Aalst
IJAOSE
2010
126views more  IJAOSE 2010»
15 years 1 months ago
Automated analysis of compositional multi-agent systems
An approach for handling the complex dynamics of a multi-agent system is based on distinguishing aggregation levels. The behaviour at a given aggregation level is specified by a se...
Alexei Sharpanskykh, Jan Treur
QEST
2007
IEEE
15 years 10 months ago
Symbolic Bisimulations for Probabilistic Systems
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
Peng Wu 0002, Catuscia Palamidessi, Huimin Lin
RSP
2007
IEEE
141views Control Systems» more  RSP 2007»
15 years 10 months ago
Rapid Prototyping of Intrusion Detection Systems
Designing security softwares that evolve as quickly as threats is a truthful challenge. In addition, current software becomes increasingly more complex and difficult to handle ev...
Fabrice Kordon, Jean-Baptiste Voron