CONCUR 2004 - PDF Preprint Papers

CONCUR 2004 Seminar on Concurrency

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CONCUR-2004 Paper

click to vote

CONCUR
2004
Springer

144views Distributed And Parallel Com...» more CONCUR 2004»

Characterizing EF and EX Tree Logics

13 years 9 months ago

Download www.labri.fr

We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages deﬁnable...

Mikolaj Bojanczyk, Igor Walukiewicz

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	144	Characterizing EF and EX Tree Logics	claim
2	139	Modular Construction of Modal Logics	claim
3	134	Session Types for Functional Multithreading	claim
4	130	Extended Process Rewrite Systems: Expressiveness and Reachability	claim
5	128	Verifying Finite-State Graph Grammars: An Unfolding-Based Approach	claim
6	126	Asynchronous Games 2: The True Concurrency of Innocence	claim
7	126	A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications	claim
8	121	Open Maps, Alternating Simulations and Control Synthesis	claim
9	119	Parameterised Boolean Equation Systems (Extended Abstract)	claim
10	113	Type Based Discretionary Access Control	claim
11	112	Resources, Concurrency and Local Reasoning	claim
12	109	Timed vs. Time-Triggered Automata	claim
13	102	A Semantics for Concurrent Separation Logic	claim
14	100	An Extensional Spatial Logic for Mobile Processes	claim
15	99	Probabilistic Event Structures and Domains	claim
16	98	Compiling Pattern Matching in Join-Patterns	claim
17	98	Model Checking Restricted Sets of Timed Paths	claim
18	94	The Pros and Cons of Netcharts	claim
19	94	Model Checking Timed Automata with One or Two Clocks	claim
20	89	µABC: A Minimal Aspect Calculus	claim
21	88	Message-Passing Automata Are Expressively Equivalent to EMSO Logic	claim
22	87	Elimination of Quantifiers and Undecidability in Spatial Logics for Concurrency	claim
23	83	On Flatness for 2-Dimensional Vector Addition Systems with States	claim
24	76	Symbolic Bisimulation in the Spi Calculus	claim
25	70	Resource Control for Synchronous Cooperative Threads	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers