Modeling concurrency with interval traces
From MaRDI portal
Publication:515576
DOI10.1016/J.IC.2016.12.009zbMATH Open1359.68224OpenAlexW2190677066MaRDI QIDQ515576FDOQ515576
Authors: Ryszard Janicki, Xiang Yin 
Publication date: 16 March 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11375/18319
Recommendations
- Trace-oriented models of concurrency
- Modelling concurrency with comtraces and generalized comtraces
- Modeling Timed Concurrent Systems
- scientific article; zbMATH DE number 176124
- scientific article; zbMATH DE number 1314563
- Context for models of concurrency
- Interval traces with mutex relation
- Interleaving based model checking of concurrency and causality
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Maintaining knowledge about temporal intervals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intransitive indifference with unequal indifference intervals
- Title not available (Why is that?)
- Domain and event structure semantics for Petri nets with read and inhibitor arcs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Betweenness, orders and interval graphs
- Title not available (Why is that?)
- Process semantics of general inhibitor nets
- Title not available (Why is that?)
- Semantics of inhibitor nets
- Contextual nets
- A formal semantics for concurrent systems with a priority relation
- Concurrent histories: a basis for observing distributed systems
- Fundamentals of modelling concurrency using discrete relational structures
- Partial order semantics and read arcs
- Timed testing of concurrent systems
- On characterising distributability
- Modeling interval order structures with partially commutative monoids
- On interval process semantics of Petri nets with inhibitor arcs
- Quotient monoids and concurrent behaviours
- On three alternative characterizations of combined traces
- Title not available (Why is that?)
- Algebraical characterisation of interval-timed Petri nets with discrete delays
- Mutex causality in processes and traces of general elementary nets
- The mutual exclusion problem
- Step traces
- Modelling concurrency with comtraces and generalized comtraces
- Nets, time and space
- Structure of concurrency
- Relational structures model of concurrency
Cited In (13)
- Interval traces with mutex relation
- On Interval Semantics of Inhibitor and Activator Nets
- Modeling interval order structures with partially commutative monoids
- Relational structures for concurrent behaviours
- Operational semantics, interval orders and sequences of antichains
- Interval semantics for Petri nets with inhibitor arcs
- Modeling operational semantics with interval orders represented by sequences of antichains
- Languages of higher-dimensional automata
- Posets with interfaces as a model for concurrency
- Modelling concurrency with semi-commutations
- Algebraic structure of step traces and interval traces
- Generating Posets Beyond N
- Modelling concurrency with comtraces and generalized comtraces
This page was built for publication: Modeling concurrency with interval traces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515576)
