Event Structures for Arbitrary Disruption

Authors:
Harald Fecher;Mila Majster-Cederbaum
Affiliations:
Christian Albrecht Universität zu Kiel, Technische Fakultät, Institut für Informatik, Hermann-Rodewaldstr. 3, 24118 Kiel, Germany. E-mail: hf@informatik.uni-kiel.de;Universität Mannheim, Fakultät für Mathematik und Informatik, D7, 27, 68131 Mannheim, Germany. E-mail: mcb@pi2.informatik.uni-mannheim.de
Venue:
Fundamenta Informaticae
Year:
2005

Citing 16
Cited 1

Introduction to the ISO specification language LOTOS

Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Communication and concurrency

Communication and concurrency
The connection between an event structure semantics and an operational semantics TCSP

Acta Informatica
On the nature of events: another perspective in concurrency

MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Domain theory

Handbook of logic in computer science (vol. 3)
An event structure semantics for general Petri nets

Theoretical Computer Science - Special volume on Petri nets
Transition systems from event structures revisited

Information Processing Letters
Contextual Petri nets, asymmetric event structures, and processes

Information and Computation
Handbook of Process Algebra

Handbook of Process Algebra
Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement

ACM Transactions on Computational Logic (TOCL)
Bundle event structures: a non-interleaving semantics for LOTOS

FORTE '92 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, V
Event Automata as a Generic Model of Reactive Systems

KORSO - Methods, Languages, and Tools for the Construction of Correct Software
A Generalized Event Structure for the Muller Unfolding of a Safe Net

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Permutation of transitions: An event structure semantics for CCS and SCCS

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
An introduction to event structures

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Configuration Structures

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science

Finite abstract models for deterministic transition systems: fair parallel composition and refinement-preserving logic

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In process algebras that allow for some form of disruption, it is important to state when a process terminates. One option is to include a termination action √. Another approach is that the 'final' executed action of a process terminates the process. The semantics of the former approach has been investigated in the literature in detail, e.g. by providing consistent true-concurrency and operational descriptions. The 'final' executed action termination approach, which is more adequate for modelling, still lacks the existence of a detailed true concurrent description. In order to give a true concurrency model of such a termination view, we introduce a new class of event structures. This type of event structures models disabling by indicating sets of precursor events. We show that the introduced class of event structures has more expressive power with respect to event traces than the common event structures. We also give a classification of the expressive power in terms of sets of event traces. A consistency result of an operational and a denotational semantics is shown.