Failures semantics based on interval semiwords is a congruence for refinement
From MaRDI portal
(Redirected from Publication:757073)
Recommendations
- scientific article; zbMATH DE number 4206024
- 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
- A semantics for a failed axiomatization of \textsf{K}
- A reinterpretation of the semilattice semantics with applications
Cites work
- scientific article; zbMATH DE number 4206024 (Why is no real title available?)
- scientific article; zbMATH DE number 3812965 (Why is no real title available?)
- scientific article; zbMATH DE number 3972197 (Why is no real title available?)
- scientific article; zbMATH DE number 4030999 (Why is no real title available?)
- scientific article; zbMATH DE number 4035159 (Why is no real title available?)
- scientific article; zbMATH DE number 4060688 (Why is no real title available?)
- scientific article; zbMATH DE number 4087033 (Why is no real title available?)
- scientific article; zbMATH DE number 3735177 (Why is no real title available?)
- scientific article; zbMATH DE number 17804 (Why is no real title available?)
- scientific article; zbMATH DE number 176514 (Why is no real title available?)
- scientific article; zbMATH DE number 1988986 (Why is no real title available?)
- scientific article; zbMATH DE number 3795366 (Why is no real title available?)
- A Theory of Communicating Sequential Processes
- A calculus of communicating systems
- A method for stepwise refinement and abstraction of Petri nets
- Analysis of Petri nets by stepwise refinements
- Concurrent bisimulations in Petri nets
- Failures semantics and deadlocking of modular Petri nets
- Finite representations of CCS and TCSP programs by automata and Petri nets
- Intransitive indifference with unequal indifference intervals
- Modeling concurrency with partial orders
- Petri nets, event structures and domains. I
- 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
- Process algebra for synchronous communication
- Sequential and concurrent behaviour in Petri net theory
- The non-sequential behaviour of Petri nets
Cited in
(15)- Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
- Timing and causality in process algebra
- Axiomatizing shuffle and concatenation in languages
- Concurrent testing of processes
- Generating Posets Beyond N
- The box algebra = Petri nets + process expressions
- The difference between splitting in \(n\) and \(n+1\)
- Languages of higher-dimensional automata
- Bisimulations respecting duration and causality for the non-interleaving applied \(\pi\)-calculus
- Finite Petri nets as models for recursive causal behaviour
- Deciding true concurrency equivalences on safe, finite nets
- Deciding true concurrency equivalences on finite safe nets (preliminary report)
- Bisimulation and action refinement
- Vertical implementation
- Taking decisions late: end-based choice combined with action refinement
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)
