- Research Article
5
- 10.1016/s1571-0661(04)00120-3
Event Structures for Local Traces
- Jan 01, 1998
- Electronic Notes in Theoretical Computer Science
- H.C.M Kleijn + 2 more +2
Event Structures for Local Traces
We review the conceptual development of (true) concurrency and branching time starting from Petri nets and proceeding via Mazurkiewicz traces, pomsets, bisimulation, and event structures up to higher dimensional automata (HDAs), whose acyclic case may be identified with triadic event structures and triadic Chu spaces. Acyclic HDAs may be understood as extending the two truth values of Boolean logic with a third value .
Event Structures for Local Traces
Event Structures for Local Traces
Connectedness and synchronization
Connectedness and synchronization
Conditional Inference and Logic for Intelligent Systems: A Theory of Measure-Free Conditioning
Introduction. Motivation and objectives. State-of-the-art. Outline of main contributions. Overview of the book. A Survey of Previous Work on Conditional Events. Implicative Boolean algebras and Lewis' triviality result. Division of events. Three-valued logic. Coset form of conditional events. Logical operations among conditional events. Notes. Derivation of Conditional Events. Generalities. Conditioning operators. Conditional events. Logical Operations on Conditional Events. The extension problem. Conditional logical operations. An order relation and related concepts. Connections with three-valued logic. Comparison of various systems of logical operators. Connection with qualitative probability. Algebraic Structure of Conditional Events. Basic algebraic properties. An abstraction of the space of conditional events. Semi-simple MV-algebras. Conditional Events and Probability. Uncertainty measures on conditionals. Conditional probability evaluations. Random conditional objects. Qualitative conditional independence. Conditional Probability Logic. Essentials of probability logic. Syntax and basic properties. Truth conditional semantics. Additional properties of CPL. Fuzzy Conditionals. Generalities on fuzziness. Fuzzy logics. Syntax representation of fuzzy sets. Fuzzy conditionals. Probability qualification. Iterated fuzzy conditionals. Iterated Conditioning and Miscellaneous Issues. Iterated conditioning. Non-monotonic logics on conditionals. Operations on cosets of regular rings. Miscellaneous issues and open problems. References and Bibliography. Subject Index.
Read moreBisimulation from Open Maps
An abstract definition of bisimulation is presented. It enables a uniform definition of bisimulation across a range of different models for parallel computation presented as categories. As examples, transition systems, synchronisation trees, transition systems with independence (an abstraction from Petri nets) and labelled event structures are considered. On transition systems the abstract definition readily specialises to Milner's strong bisimulation. On event structures it explains and leads to a revision of history-preserving bisimulation of Rabinovitch and Traktenbrot, Goltz and van Glabeek. A tie-up with open maps in a (pre)topos, as they appear in the work of Joyal and Moerdijk, brings to light a promising new model, presheaves on categories of pomsets, into which the usual category of labelled event structures embeds fully and faithfully. As an indication of its promise, this new presheaf model has ``refinement'' operators, though further work is required to justify their appropriateness and understand their relation to previous attempts. The general approach yields a logic, generalising Hennessy-Milner logic, which is characteristic for the generalised notion of bisimulation.
Read moreSome recent applications of high-level Petri nets
The author presents a tutorial on high-level Petri nets and their applications. The author illustrates the transition firing rule of a high-level Petri net using an example. A high-level net can be considered as a structurally folded version of a regular Petri net, if the number of colors is finite. Thus, a high-level net can be unfolded into a regular Petri net by unfolding each place p into a set of places, one for each color of tokens which p may hold, and by unfolding each transition t into a set of transitions, one for each way that t may fire. The author informally introduces high-level nets through examples. The examples are taken from recent applications of high-level Petri nets to : (1) Horn clause logic programs, (2) four-valued annotated predicate logic, (3) nonmonotonic logic and (4) robot planning.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Read moreA map of dependencies among three-valued logics
A map of dependencies among three-valued logics
Infinitary partial Petri net languages and their relationship to other Petri net semantics
We introduce infinitary partial languages for Petri nets and study some of their properties. Earlier results on the interrelation between various Petri net semantics for finite behaviour are shown to be valid for infinite behaviour. As a consequence step sequences and event structures of processes both can be taken as a semantics for Petri nets without any loss of information.Via the introduction of infinite partial words it is possible to express the properties of justice and fairness in a natural way: justice can be characterized as maximality of progress and fairness as ‘fair’ conflict resolution. By this we overcome the ambiguity arising from the lack of discrimination between concurrency and non-determinism in the sequential approach.
Read moreHyper-Contradictions, Generalized Truth Values and Logics of Truth and Falsehood
In Philosophical Logic, the Liar Paradox has been used to motivate the introduction of both truth value gaps and truth value gluts. Moreover, in the light of "revenge Liar" arguments, also higher-order combinations of generalized truth values have been suggested to account for so-called hyper-contradictions. In the present paper, Graham Priest's treatment of generalized truth values is scrutinized and compared with another strategy of generalizing the set of classical truth values and defining an entailment relation on the resulting sets of higher-order values. This method is based on the concept of a multilattice. If the method is applied to the set of truth values of Belnap's "useful four-valued logic", one obtains a trilattice, and, more generally, structures here called Belnap-trilattices. As in Priest's case, it is shown that the generalized truth values motivated by hyper-contradictions have no effect on the logic. Whereas Priest's construction in terms of designated truth values always results in his Logic of Paradox, the present construction in terms of truth and falsity orderings always results in First Degree Entailment. However, it is observed that applying the multilattice-approach to Priest's initial set of truth values leads to an interesting algebraic structure of a "bi-and-a-half" lattice which determines seven-valued logics different from Priest's Logic of Paradox.
Read moreNULL Convention Logic/sup TM/: a complete and consistent logic for asynchronous digital circuit synthesis
NULL Convention Logic (NCL) is a symbolically complete logic which expresses process completely in terms of the logic itself and inherently and conveniently expresses asynchronous digital circuits. The traditional form of Boolean logic is not symbolically complete in the sense that it requires the participation of a fundamentally different form of expression, time in the form of the clock, which has to be very carefully coordinated with the logic part of the expression to completely and effectively express a process. We introduce NULL Convention Logic in relation to Boolean logic as a four value logic, and as a three value logic and finally as two value logic quite different from traditional Boolean logic. We then show how systems can be constructed entirely in terms of NULL Convention Logic.
Read moreRegular Event Structures and Finite Petri Nets: A Conjecture
We formulate the notion of a regular event structures and conjecture that they correspond exactly to finite 1-safe Petri nets. We offer a partial result in support of the conjecture. This result is in terms of a natural subclass of regular event structures that admit a sensible labeling with Mazurkiewicz trace alphabets.
Read moreA Study on Flexible Manufacturing Systems using Petri Net Reduction
Petrinets are the suitable tool for modeling and analysis of discrete event systems. The effective methods of analyzing the discrete event systems (DES) are exhibited by Petri nets. The entire structure of the system is mathematically expressed using Petrinets and also all the properties are analysed by different methods. The properties of Petrinets are different in various systems, a Flexible Manufacturing System (FMS) requires production activities in which raw materials, energy, labour, and equipment are combined together in the modification process for the production of good quality goods.” The word “flexible” explains the capability of the system to relate productively to make changes in the system. These changes can be internal failure of the system or classification problems such as a sample or external changes in the structure of the model as well as demand for the process. The inherent limitations such as undecidable properties, complexity in checking, automatic verification of the modeled system are existing in FMS. This paper explains a study on FMS using Petri net reduction. A PN underlies event structures with casuality and compatibility relations. Partial order methods and reduction methods reduce the complexity of constructing the reachability graph. The determination of PN system through reduction methods in recent years focused by many researchers. The significance of reduction methods are highlighted to execute the faster analysis of a system. Instead of coverability trees and the graphical representation the incidence matrix of the PNs are used for the reduction methods. Reduction methods are used to simplify large scale PNs into “equivalent” smaller nets. Boundedness, liveness, simplification of implicit places, shared resources and elimination of self-loops are checked though equivalent smaller nets. The structure of FMS is preserved.
Read moreA hybrid model for intelligent control systems
Hybrid continuous-time and discrete-event system models are developed for applications to intelligent robot and autonomous control systems. Certain general properties, including the interface structure between the discrete event part and the continuous part of hybrid systems, are studied. Petri nets are proposed as the model for the discrete event sub-system (DES), and state equations with a set of binary parameters as the model for the continuous time sub-system (CTS) in a hybrid system. The quantized CTS is formulated in prime event structures, which can also be modeled by a condition/event Petri net. Therefore, a complete hybrid system can be fit into an extended Petri net formalism, which provides a unified framework for hybrid system description. The validity of the proposed model is demonstrated by modeling a two-tank system.
Read moreUpper Boundary Algebra for Modeling the Missing Values Is a Residuated Lattice
It is already more than 100 years since the first proposal on three-valued logic appeared and it became a seminal work initiating lots of followers among scholars and researchers. Since then, we have observed distinct logical and algebraic approaches to modeling undefined values, i.e., the situation when the truth value of a given proposition is neither true nor false, but it is not defined. These various algebraic models of three-valued functionality are built to model various types of undefinedness, e.g., conceptional undefinedness, inconsistencies, indeterminable values, meaningless values, or half-true. It is not surprising that recently, these three-valued logics have been extended to partial fuzzy logics, i.e. specific many-valued logics that are extended by the dummy value * that models the undefined truth value. The algebraic structures for such logics are called partial algebras. Recently, two partial algebras, namely the Dragonfly algebra and the Lower Estimation, were both developed to capture the missing or unknown values. Their main idea consists in determining the lower boundary of the truth value of a proposition that we may guarantee after processing the operations independently on what values would replace the dummies *. Such an approach naturally leads to the consequence that the dummy * behaves as a “nearly zero” or “almost false” value. Though the application potential of such algebras in processing the missing values turned out to be very useful at some problems, it turned to be promising to consider a nearly dual approach. Such an approach should model the upper boundary idea and lead to a “nearly one” or “almost true” value. This study provides the first definition of such an algebra and investigates which of the standard properties of residuated lattices remain preserved. Unlike in the lower boundary case, we surprisingly show that in principle all of them are preserved, i.e., that the Upper Boundary algebra, though extended, remains to be the residuated lattice.
Read moreGeneralized Truth Values: From FOUR 2 to SIXTEEN 3
In the present chapter, we discuss the possibility of generalizing the very notion of a truth value by constructing truth values as complex units which may possess a ramified inner structure. We consider some approaches to truth values as structured entities and summarize this point in the notion of a generalized truth value conceived as a subset of some basic set of initial truth values of a lower degree. We are essentially led by the idea which is at the heart of Belnap and Dunn’s useful four-valued logic, where the set \({{\mathbf{2}}} = \{T,F\}\) of classical truth values is generalized to the set \({{\mathbf{4}}} = {{\fancyscript{P}}}({{\mathbf{2}}}) = \{\varnothing,\{T\},\{F\},\{T,F\}\}.\) We argue in favor of extending this process to the set \({{\mathbf{16}}} = {{\fancyscript{P}}}({{\mathbf{4}}}).\) It turns out that this generalization is well-motivated and leads to a notion of a truth value multilattice. In particular, we proceed from the bilattice \(FOUR_{2}\) with both an information and truth-and-falsity ordering to another algebraic structure, namely the trilattice \(SIXTEEN_{3}\) with an information ordering together with a truth ordering \(and\) a (distinct) falsity ordering. We also consider another exemplification of essentially the same structure based on the set of truth values one can find in various constructive logics.
Read moreProcess-commutative distributed objects: From cryptocurrencies to Byzantine-Fault-Tolerant CRDTs
This paper explores the territory that lies between best-effort Byzantine-Fault-Tolerant Conflict-free Replicated Data Types (BFT CRDTs) and totally ordered distributed ledgers, such as those implemented by Blockchains. It formally characterizes a novel class of distributed objects that only requires a First In First Out (FIFO) order on the object operations from each process (taken individually). The formalization leverages Mazurkiewicz traces to define legal sequences of operations and ensure both Strong Eventual Consistency (SEC) and Pipleline Consistency (PC). The paper presents a generic algorithm that implements this novel class of distributed objects both in a crash and Byzantine setting. It also illustrates the practical interest of the proposed approach using four instances of this class of objects, namely money transfer, Petri nets, multi-sets, and concurrent work stealing dequeues.
Read more