55 search results - page 3 / 11 » Pomset Languages of Finite Step Transition Systems |
TOPNOC
2010
13 years 2 months ago
2010
Information systems supporting business process are mostly very complex. If we have to ensure that certain business rules are enforced in a business process, it is often easier to ...
ICFCA
2004
Springer
14 years 26 days ago
2004
Springer
Based on the conceptual representation of objects in space and time as introduced in Temporal Concept Analysis first steps are done into the direction of a conceptual theory of ...
FMOODS
2008
13 years 9 months ago
2008
In this work, novel symbolic step encodings of the transition relation for object based communicating state machines are presented. This class of systems is tailored to capture the...
RP
2010
Springer
13 years 5 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
POPL
2005
ACM
14 years 7 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...