Sciweavers

4126 search results - page 424 / 826
» Relationships with other Formalisms
Sort
View
ICDCS
1996
IEEE
15 years 11 months ago
Making Trust Explicit in Distributed Commerce Transactions
In a distributed environment where nodes are independently motivated, many transactions or commercial exchanges may be stymied due to a lack of trust between the participants. The...
Steven P. Ketchpel, Hector Garcia-Molina
IPPS
1996
IEEE
15 years 11 months ago
Self-Timed Resynchronization: A Post-Optimization for Static Multiprocessor Schedules
In a shared-memory multiprocessor system, it is possible that certain synchronization operations are redundant -that is, their corresponding sequencing requirements are enforced c...
Shuvra S. Bhattacharyya, Sundararajan Sriram, Edwa...
IFIP
1992
Springer
15 years 11 months ago
Controller Implementation by Communicating Asynchronous Sequential Circuits Generated from a Petri Net Specification of Required
This paper presents a completely systematic design procedure for asynchronous controllers. The initial step is the construction of a signal transition graph (STG, an interpreted P...
Jochen Beister, Ralf Wollowski
CONCUR
1990
Springer
15 years 11 months ago
A Temporal Calculus of Communicating Systems
In this paper we describe the calculus TCCS, an extension of the process algebra CCS with temporal constructs. The calculus is useful for the formal analysis of the timing aspects...
Faron Moller, Chris M. N. Tofts
AUSAI
2007
Springer
15 years 11 months ago
Planning as Satisfiability with Relaxed $-Step Plans
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
Martin Wehrle, Jussi Rintanen