67 search results - page 9 / 14 » Reasoning on temporal class diagrams: Undecidability results |
LICS
2003
IEEE
15 years 2 months ago
2003
IEEE
Given a regular collection of Mazurkiewicz traces, which can be seen as the behaviours of a finite-state concurrent system, one can associate with it a canonical regular event st...
106
click to vote
LICS
2012
IEEE
12 years 12 months ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
LOGCOM
2007
14 years 9 months ago
2007
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
ICALP
1998
Springer
15 years 1 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
EWCBR
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Helping software designers in their task implies the development of tools with intelligent capabilities. One such capability is the integration of natural language unders...