Failures semantics based on interval semiwords is a congruence for refinement

DOI10.1007/BF01798961zbMATH Open0723.68069MaRDI QIDQ757073FDOQ757073

Authors: Walter Vogler 

Publication date: 1991

Published in: Distributed Computing (Search for Journal in Brave)

Recommendations

• scientific article
• Automata, Languages and Programming
• A sound and complete semantics for a version of negation as failure
• Failure of completeness in proof-theoretic semantics
• On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
• scientific article; zbMATH DE number 1405454
• Failure of interpolation in constant domain intuitionistic logic
• Revisiting Semilattice Semantics
• scientific article; zbMATH DE number 7585729
• A reinterpretation of the semilattice semantics with applications

zbMATH Keywords

divergencePetri netsaction refinementinterval orderspartial order semanticsfailures semantics

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Petri nets, event structures and domains. I
• Concurrent bisimulations in Petri nets
• Process algebra for synchronous communication
• Title not available (Why is that?)
• Modeling concurrency with partial orders
• Intransitive indifference with unequal indifference intervals
• A calculus of communicating systems
• The non-sequential behaviour of Petri nets
• A Theory of Communicating Sequential Processes
• Title not available (Why is that?)
• Sequential and concurrent behaviour in Petri net theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A method for stepwise refinement and abstraction of Petri nets
• Analysis of Petri nets by stepwise refinements
• Petri nets: central models and their properties. Advances in Petri nets 1986, Part I. Proceedings of an advanced course, Bad Honnef, September 8--19, 1986
• Failures semantics and deadlocking of modular Petri nets
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (15)

• The box algebra = Petri nets + process expressions
• Finite Petri nets as models for recursive causal behaviour
• Axiomatizing shuffle and concatenation in languages
• Concurrent testing of processes
• The difference between splitting in \(n\) and \(n+1\)
• Vertical implementation
• Timing and causality in process algebra
• Languages of higher-dimensional automata
• Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
• Taking decisions late: end-based choice combined with action refinement
• Generating Posets Beyond N
• Deciding true concurrency equivalences on finite safe nets (preliminary report)
• Bisimulation and action refinement
• Deciding true concurrency equivalences on safe, finite nets
• Title not available (Why is that?)

This page was built for publication: Failures semantics based on interval semiwords is a congruence for refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757073)