[PDF][PDF] An overview of the applications of multisets.
D Singh, AM Ibrahim, T Yohanna, JN Singh - Novi Sad Journal of …, 2007 - eudml.org
A multiset (mset, for short) is an unordered collection of objects (called the elements) in
which, unlike a standard (Cantorian) set, elements are allowed to repeat. In other words, an …
which, unlike a standard (Cantorian) set, elements are allowed to repeat. In other words, an …
Elementary net systems
G Rozenberg, J Engelfriet - Advanced Course on Petri Nets, 1996 - Springer
The area of Petri Nets was initiated by CA Petri in the early sixties ([Pet62]). Since then this
area has been developed tremendously in both the theory and the applications. Although …
area has been developed tremendously in both the theory and the applications. Although …
[图书][B] Principles of model checking
A comprehensive introduction to the foundations of model checking, a fully automated
technique for finding flaws in hardware and software; with extensive examples and both …
technique for finding flaws in hardware and software; with extensive examples and both …
[图书][B] Reasoning about knowledge
Reasoning about knowledge—particularly the knowledge of agents who reason about the
world and each other's knowledge—was once the exclusive province of philosophers and …
world and each other's knowledge—was once the exclusive province of philosophers and …
[图书][B] The power of events
D Luckham - 2002 - sisis.rz.htw-berlin.de
The Power of Events Page 1 The Power of Events An Introduction to Complex Event
Processing in Distributed Enterprise Systems David Luckham AAddison-Wesley Boston San …
Processing in Distributed Enterprise Systems David Luckham AAddison-Wesley Boston San …
[图书][B] Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem
P Godefroid - 1996 - Springer
The first technique for computing the set of transitions T to consider in a selective search
actually corresponds to a whole family of algorithms lOve81, Va191, GW91b] that have been …
actually corresponds to a whole family of algorithms lOve81, Va191, GW91b] that have been …
A specifier's introduction to formal methods
JM Wing - Computer, 1990 - ieeexplore.ieee.org
Formal methods used in developing computer systems (ie mathematically based techniques
for describing system properties) are defined, and their role is delineated. Formal …
for describing system properties) are defined, and their role is delineated. Formal …
Branching time and abstraction in bisimulation semantics
RJ Van Glabbeek, WP Weijland - Journal of the ACM (JACM), 1996 - dl.acm.org
In comparative concurrency semantics, one usually distinguishes between linear time and
branching time semantic equivalences. Milner's notion of observatin equivalence is often …
branching time semantic equivalences. Milner's notion of observatin equivalence is often …
A framework for comparing models of computation
EA Lee… - IEEE Transactions on …, 1998 - ieeexplore.ieee.org
We give a denotational framework (a" meta model") within which certain properties of
models of computation can be compared. It describes concurrent processes in general terms …
models of computation can be compared. It describes concurrent processes in general terms …