Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structur...
Distributed information systems are critical to the functioning of many businesses; designing them to be dependable is a challenging but important task. We report our experience i...
Jeremy Bryans, John S. Fitzgerald, Alexander Roman...
Enterprise modeling is a daunting task to be carried out from a single perspective. A challenge to this whole complexity is conflicting descriptions given by different actors when ...
Many researchers in the software agent field use the financial domain as a test bed to develop adaptation, cooperation and learning skills of software agents. However, there are no...
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...