Forward and backward simulations I.: untimed systems
Information and Computation
Distributed Algorithms
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
Efficiency of Asynchronous Systems and Read Arcs in Petri Nets
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
General Refinement and Recursion Operators for the Petri Box Calculus
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
The Failure of Failures in a Paradigm for Asynchronous Communication
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
A Compositional Partial Order Semantics for Petri Net Components
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Replacement of Open Interface Subnets and Stable State Transformation Equivalence
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Compositional Analysis with Place-Bordered Subnets
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
An Algebraic Theory of Process Efficiency
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
| Hi-index | 0.00 |
A parallel composition is introduced that combines nets (regarded as system components) by merging so-called interface places; the novel feature is a flexible typing of these places, which formulates assumptions a component makes about its environment. Based on a testing scenario, a faster-than relation is defined and shown to support modular construction, since it is a precongruence for parallel composition, hiding and renaming. The faster-than relation is characterized without reference to tests, and this characterization is used to compare the temporal effciency of some examples.