A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories
DOI10.1007/978-3-319-51963-0_5zbMATH Open1433.68213OpenAlexW2343479187MaRDI QIDQ2971124FDOQ2971124
Authors: Uli Fahrenberg, Axel Legay 
Publication date: 4 April 2017
Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-51963-0_5
Recommendations
- A linear-time-branching-time spectrum for behavioral specification theories
- A Coalgebraic Characterization of Behaviours in the Linear Time – Branching Time Spectrum
- CONCUR 2005 – Concurrency Theory
- Revisiting timed specification theories: a linear-time perspective
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Towards bialgebraic semantics for the linear time -- branching time spectrum
- Unifying the linear time-branching time spectrum of process semantics
- A spectrum of behavioral relations over LTSs on probability distributions
- scientific article
- scientific article
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Structured operational semantics and bisimulation as a congruence
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Algebraic laws for nondeterminism and concurrency
- Calculi for synchrony and asynchrony
- Bisimulation through probabilistic testing
- Communicating sequential processes
- A Theory of Communicating Sequential Processes
- Title not available (Why is that?)
- Modal event-clock specifications for timed component-based design
- Weighted modal transition systems
- A modal interface theory for component-based design
- Extending modal transition systems with structured labels
- Modal transition systems: composition and LTL model checking
- Modular construction and partial order semantics of Petri nets
- General quantitative specification theories with modal transition systems
- 20 years of modal and mixed specifications.
- Nested semantics over finite trees are equationally hard
- Failures semantics and deadlocking of modular Petri nets
- A context dependent equivalence between processes
- The quantitative linear-time-branching-time spectrum
- Ensuring reachability by design
- ACTL for modal interface automata
Cited In (2)
This page was built for publication: A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971124)
